- (Dong et al., 2005) ⇒ Xin Dong, Alon Y. Halevy, and Jayant Madhavan. (2005). “Reference Reconciliation in Complex Information Spaces.” In: Proceedings of the ACM SIGMOD Conference (SIGMOD 2005). doi:10.1145/1066157.1066168
Subject Headings: Coreference Record Resolution Algorithm.
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previous literature assumed references to a single class that had a fair number of attributes (e.g., research publications). We consider complex information spaces: our references belong to multiple related classes and each reference may have very few attribute values. A prime example of such a space is Personal Information Management, where the goal is to provide a coherent view of all the information on one's desktop.Our reconciliation algorithm has three principal features. First, we exploit the associations between references to design new methods for reference comparison. Second, we propagate information between reconciliation decisions to accumulate positive and negative evidences. Third, we gradually enrich references by merging attribute values. Our experiments show that (1) we considerably improve precision and recall over standard methods on a diverse set of personal information datasets, and (2) there are advantages to using our algorithm even on a standard citation dataset benchmark.
|2005 ReferenceReconciInComplexInfSpaces||Xin Dong|
Alon Y. Halevy
|Reference Reconciliation in Complex Information Spaces||Proceedings of the ACM SIGMOD Conference||http://data.cs.washington.edu/semex/reconciliation sigmod.pdf||10.1145/1066157.1066168||2005|
|Author||Xin Dong +, Alon Y. Halevy + and Jayant Madhavan +|
|journal||Proceedings of the ACM SIGMOD Conference +|
|title||Reference Reconciliation in Complex Information Spaces +|
|titleUrl||http://data.cs.washington.edu/semex/reconciliation sigmod.pdf +|