Record linkage: making maximum use of the discriminating power of identifying information
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Declarative Data Cleaning: Language, Model, and Algorithms
Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Adaptive duplicate detection using learnable string similarity measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Semantic integration: a survey of ontology-based approaches
ACM SIGMOD Record
Reference reconciliation in complex information spaces
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Object identification with attribute-mediated dependences
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Refining Instance Coreferencing Results Using Belief Propagation
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Combining a Logical and a Numerical Method for Data Reconciliation
Journal on Data Semantics XII
A Property Restriction Based Knowledge Merging Method
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Merging and Ranking Answers in the Semantic Web: The Wisdom of Crowds
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
A self-training approach for resolving object coreference on the semantic web
Proceedings of the 20th international conference on World wide web
An ontology-based method for duplicate detection in web data tables
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Linking semantic desktop data to the web of data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part II
PARIS: probabilistic alignment of relations, instances, and schema
Proceedings of the VLDB Endowment
Data Linking for the Semantic Web
International Journal on Semantic Web & Information Systems
Discovering interesting information with advances in web technology
ACM SIGKDD Explorations Newsletter
Hi-index | 0.00 |
The reference reconciliation problem consists in deciding whether different identifiers refer to the same data, i.e., correspond to the same world entity. The L2R system exploits the semantics of a rich data model, which extends RDFS by a fragment of OWL-DL and SWRL rules. In L2R, the semantics of the schema is translated into a set of logical rules of reconciliation, which are then used to infer correct decisions both of reconciliation and no reconciliation. In contrast with other approaches, the L2R method has a precision of 100% by construction. First experiments show promising results for recall, and most importantly significant increases when rules are added.