The merge/purge problem for large databases
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Revolutionizing name authority control
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Efficient clustering of high-dimensional data sets with application to reference matching
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Data integration using similarity joins and a word-based information representation language
ACM Transactions on Information Systems (TOIS)
Computer programs for detecting and correcting spelling errors
Communications of the ACM
Learning object identification rules for information integration
Information Systems - Data extraction, cleaning and reconciliation
Modern Information Retrieval
Complexity - Complex Adaptive systems: Part I
Adaptive duplicate detection using learnable string similarity measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Cleaning the Spurious Links in Data
IEEE Intelligent Systems
Adaptive Name Matching in Information Integration
IEEE Intelligent Systems
Author name disambiguation in MEDLINE
ACM Transactions on Knowledge Discovery from Data (TKDD)
Disclosing false identity through hybrid link analysis
Artificial Intelligence and Law
Assessing quality dynamics in unsupervised metadata extraction for digital libraries
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
Hi-index | 0.00 |
This paper gives an overview of personal name matching. Personal name matching is of great importance for all applications that deal with personal names. The problem with personal names is that they are not unique and sometimes even for one name many variations exist. This leads to the fact that databases on the one hand may have several entries for one and the same person and on the other hand have one entry for many different persons. For the evaluation of personal name matching algorithms, test collections are of great importance. This paper gives an overview of existing test collections and presents two new test collections based on real-world bibliographic data. Additionally, state-of-the art techniques and a new approach based on semantics are also described.