Selecting the right search term in query-based systems for deduplication
Essentially three approaches could be identified when choosing a proper search term to detect bibliographic duplicates. Stop words are excluded in all of them, then (1) just the first term of an entry will be selected or (2) that term is selected, which produces the smallest number of hits or finally (...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
2021
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://hdl.handle.net/10356/154222 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Essentially three approaches could be identified when choosing a proper search term to detect bibliographic duplicates. Stop words are excluded in all of them, then (1) just the first term of an entry will be selected or (2) that term is selected, which produces the smallest number of hits or finally (3) that term will be used, which has a certain number of hits below a defined threshold. These three procedures are compared with each other here. The results derive from series of measurements done with bibliographic data from the Austrian Central Catalog. |
|---|