Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Salton, M. McGill (1983)
Introduction to Modern Information Retrieval
William Cohen (1998)
Integration of heterogeneous databases without common domains using queries based on textual similarity
Andrew Fiore, Marc Smith (2001)
Treemap Visualizations of Newsgroups
B. Shneiderman (1992)
Tree visualization with tree-maps: 2-d space-filling approachACM Trans. Graph., 11
A. Elmagarmid, Panagiotis Ipeirotis, Vassilios Verykios (2007)
Duplicate Record Detection: A SurveyIEEE Transactions on Knowledge and Data Engineering, 19
S. Lawrence, C. Giles, K. Bollacker (1999)
Digital Libraries and Autonomous Citation IndexingComputer, 32
I. Fellegi, A. Sunter (1969)
A Theory for Record LinkageJournal of the American Statistical Association, 64
Hye-Kyung Chung (2009)
An analysis model of creating a core journal collection for academic librariesLibrary Collections, Acquisitions, and Technical Services, 33
William Cohen, Pradeep Ravikumar, S. Fienberg (2003)
A Comparison of String Metrics for Matching Names and Records
Biljana Kosanović (2002)
Koordinirana nabavka inostranih izvora naučno-tehničkih informacija u Srbiji - stanje i perspektive
M. Bruls, K. Huising, J.J. van Wijk
Squarified treemaps
K. Mahesh, Jacquelynn Kud, Paul Dixon (1999)
Oracle at Trec8: A Lexical Approach
J. Goldberg, J. Helfman (2005)
Enterprise Network Monitoring Using TreemapsProceedings of the Human Factors and Ergonomics Society Annual Meeting, 49
W. Winkler (2011)
20. Matching and Record Linkage
Golnessa Moghaddam, V. Talawar (2009)
Library consortia in developing countries: an overviewProgram, 43
Purpose – This paper aims to address the problem of enhancing the selection of titles offered by a digital library, by analysing the differences in these titles when they are cited by local authors in their publications and when they are listed in the digital library offer. Design/methodology/approach – Text mining techniques were used to identify duplicate references. Moreover, the process of identifying syntactically different data was improved with the automated discovery of thesauri from correctly matched data, and the generated thesaurus was further used in semantic clustering. The results were effectively visually represented. Findings – The paper finds that the function based on the Jaro‐Winkler algorithm may be efficiently used in the de‐duplication process. A generated thesaurus that utilises domain‐specific knowledge can also be used in the semantic clustering of references. It was shown that semantic clustering may be most useful in partitioning data, which is particularly significant when dealing with large amounts of data, which is usually the case. Moreover, those references that have the same or similar scores may be considered as candidate matches in the further de‐duplication process. Finally, it proved to be a more efficient way of visually representing the results. Originality/value – This function can be implemented to enhance the selection of titles to be offered by a digital library, in terms of making that offer more compliant with what the library users frequently cite.
Program – Emerald Publishing
Published: Apr 27, 2010
Keywords: Digital libraries; Data collection; Semantics; Databases; Serbia
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.