Conferences play a major role in some disciplines such as computer science and are often used in research quality evaluation exercises. Differently from journals and books, for which ISSN and ISBN codes provide unambiguous keys, recognizing the conference series in which a paper was published is a rather complex endeavor: there is no unique code assigned to conferences and the way their names are written may greatly vary across years and catalogs. In this article, we propose a technique for the entity resolution of conferences based on the analysis of different semantic parts of their names. We present the results of an investigation of our technique on a dataset of 42395 distinct computer science conference names excerpted from the DBLP computer science repository1, which we automatically link to different authority files. With suitable data cleaning, the precision of our record linkage algorithm can be as high as 94%. A comparison with results obtainable using state-of-the-art general-purpose record linkage algorithms rounds off the paper, showing that our ad hoc solution largely outperforms them in terms of the quality of the results.
Which conference is that? A case study in computer science / Demetrescu, Camil; Finocchi, Irene; Ribichini, Andrea; Schaerf, Marco. - In: ACM JOURNAL OF DATA AND INFORMATION QUALITY. - ISSN 1936-1955. - 14:3(2022), pp. 1-13. [10.1145/3519031]
Which conference is that? A case study in computer science
Finocchi, Irene
;
2022
Abstract
Conferences play a major role in some disciplines such as computer science and are often used in research quality evaluation exercises. Differently from journals and books, for which ISSN and ISBN codes provide unambiguous keys, recognizing the conference series in which a paper was published is a rather complex endeavor: there is no unique code assigned to conferences and the way their names are written may greatly vary across years and catalogs. In this article, we propose a technique for the entity resolution of conferences based on the analysis of different semantic parts of their names. We present the results of an investigation of our technique on a dataset of 42395 distinct computer science conference names excerpted from the DBLP computer science repository1, which we automatically link to different authority files. With suitable data cleaning, the precision of our record linkage algorithm can be as high as 94%. A comparison with results obtainable using state-of-the-art general-purpose record linkage algorithms rounds off the paper, showing that our ad hoc solution largely outperforms them in terms of the quality of the results.File | Dimensione | Formato | |
---|---|---|---|
ACM-JDIQ22.pdf
Open Access
Tipologia:
Versione dell'editore
Licenza:
Tutti i diritti riservati
Dimensione
192.96 kB
Formato
Adobe PDF
|
192.96 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.