idMesh: graph-based disambiguation of linked data

We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ? self-organize in a dynamic and probabilistic manner. Our solution has the following two desirable properties: i) it lets end-users freely define associations between arbitrary entities and ii) it probabilistically infers entity relationships based on uncertain links using constraintsatisfaction mechanisms. We outline the interface between our scheme and the current data Web, and show how higher-layer applications can take advantage of our approach to enhance search and update of information relating to online entities. We describe a decentralized infrastructure supporting efficient and scalable entity disambiguation and demonstrate the practicability of our approach in a deployment over several hundreds of machines. Categories and Subject Descriptors H.4.m [Information Systems]: Miscellaneous; D.2.12.a [Sof...

• Type: Conference
• Year: 2009
• Where: WWW
• Authors: Hermann de Meer, Karl Aberer, Michael Jost, Parisa Haghani, Philippe Cudré-Mauroux
• Keywords: Arbitrary Entities, Internet Technology, Keywords Entity Disambiguation, Scalable Entity Disambiguation, WWW 2009