Detecting approximately duplicate bibliographic records with text algorithms: experience of creating a union catalogue of libraries at the Warsaw University of Technology

• Autorzy: Płoszajski G.
• Konferencja: Databases for Science INFOBAZY 2002: 3rd National Conference (24-26 June 2002, Gdańsk-Sobieszewo, Poland)
• Języki publikacji: EN

Abstrakty

EN

The paper describes a fault-tolerant method of selecting duplicate bibliographic records in catalogues. The method is based on the use of text algorithms; decisions are suggested to librarians who make the final decision. The method was applied to four library catalogues at the Warsaw University of Technology which were compared with the catalogue of the main library. Process of joining catalogues was conducted differently for non-duplicate records and for duplicate ones. Thanks to this method, a significant portion of records in the catalogues of the joining libraries had been found to be duplicate before the catalogues were added. The algorithms proved helpful in assuring high quality of information.

Słowa kluczowe

EN

duplicate record resolution; n-grams; text algorithms

• Wydawca: Politechnika Gdańska
• Czasopismo: TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk
• Rocznik: 2003
• Tom: Vol. 7, No 2
• Strony: 294--297
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Płoszajski G.

• Warsaw University of Technology, Main Library, Faculty of Electronics and Information Technology, Politechniki 1, 00-661 Warsaw, Poland

• Warsaw University of Technology, Main Library, Faculty of Electronics and Information Technology, Politechniki 1, 00-661 Warsaw, Poland,

Bibliografia

• [1] Cousins S A 1998 J. Information Science 24 (4) 231
• [2] Preece B 2001 The, Journal of Academic Librarian-ship 27 (6) 470
• [3] Jolibois S, Mouze-Ainady M, Chouaniere D, Gradjean F, Nauer E and Ducloy J 2000 Work & Stress 14 (4) 283 (on-line DOI: 10.1080/02678370110040056)
• [4] Atallali M J, Cliyzak F and Dumas P 2001 Algorithmica 29 468 (on-line DOI: 10.1007/s004530010062)
• [5] Baeza-Yates R and Navarro G 1999 Algorithmica 23 127
• [6] Tian Z, Lu H, Ji W, Zhou A and Tian Z 2002 Int.. J. Digital Libraries 3 (4) 325 (on-line DOI: 10.1007/s007990100044)