As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In this work we present an approach to extract and to structure bibliographical references from BibTex files, allowing the identification of the duplicate ones, which can appear slightly different in different files. To deal with this problem, existing systems use classifiers, clustering or others algorithms, allied with an Edit Distance metric, to distinguish between duplicate and nonduplicate records. The main challenge is to identify the duplicate records in database where the volume of the references can reach millions, in an efficient computational time. The technique proposed constructs a key (string) with information from each reference and stores them in a metric data structure called Slim-Tree. The Slim-Tree structure allows the minimization of the comparisons between references (being close to O(n log (n))), considering only the most similar keys to a given one.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.