Find groups of authors to be merged (**EXPERIMENTAL**)
Indicates, by finding similarities between authors' names, groups of authors that possibly should be merged.
lbsFindDuplicateAuthors(conn, names.like = NULL, ignoreWords = c("van", "von", "der", "no", "author", "name", "available"), minWordLength = 4, orderResultsBy = c("citations", "ndocuments", "name"), aggressiveness = 0)
- connection object, see
- character vector of SQL-LIKE patterns that allow for restricting the search procedure to only given authors' names.
- character vector; words to be ignored.
- numeric; minimal word length to be considered.
- determines results' presentation order; one of
- nonnegative integer; controls the search depth.
The function uses a heuristic **EXPERIMENTAL** algorithm. Its behavior
is controlled by the
Search results are presented in a convenient-to-use graphical dialog box. Note that the calculation often takes a few minutes!
names.like parameter determines search patterns in an SQL
i.e. an underscore
_ matches a single character and a percent sign
% matches any set of characters. The search is case-insensitive.
List of authors' identifiers to be merged.
The first element of each vector is the one marked by the user as Parent,
and the rest are the Children.
## Not run: # conn <- lbsConnect("Bibliometrics.db"); # ## ... # listauth <- lbsFindDuplicateAuthors(conn, # ignoreWords=c("van", "von", "der", "no", "author", "name", "available"), # minWordLength=4, # orderResultsBy=c("citations"), # aggressiveness=1); # lbsMergeAuthors(conn, listauth); # dbCommit(conn); # ## ...## End(Not run)