idMesh: graph-based disambiguation of linked data Export

@inproceedings{citeulike:4464627, abstract = {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 constraint-satisfaction 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.}, address = {New York, NY, USA}, author = {Mauroux, Philippe C. and Haghani, Parisa and Jost, Michael and Aberer, Karl and De Meer, Hermann}, booktitle = {WWW '09: Proceedings of the 18th international conference on World wide web}, citeulike-article-id = {4464627}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1526709.1526789}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1526709.1526789}, doi = {10.1145/1526709.1526789}, isbn = {978-1-60558-487-4}, keywords = {linked-data, named-entity-disambiguation}, location = {Madrid, Spain}, pages = {591--600}, posted-at = {2009-07-30 15:58:14}, priority = {0}, publisher = {ACM}, title = {idMesh: graph-based disambiguation of linked data}, url = {http://dx.doi.org/10.1145/1526709.1526789}, year = {2009} }

TY - CONF ID - citeulike:4464627 L3 - citeulike-article-id:4464627 N2 - 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 constraint-satisfaction 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. CY - Madrid, Spain SN - 978-1-60558-487-4 AD - New York, NY, USA EP - 600 TI - idMesh: graph-based disambiguation of linked data PB - ACM T2 - WWW '09: Proceedings of the 18th international conference on World wide web SP - 591 KW - linked-data KW - named-entity-disambiguation AU - Mauroux, Philippe AU - Haghani, Parisa AU - Jost, Michael AU - Aberer, Karl AU - De Meer, Hermann PY - 2009/// UR - http://dx.doi.org/10.1145/1526709.1526789 ER -