We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Applying Semantic Social Graphs to Disambiguate...
View graph of relations

« Back

Applying Semantic Social Graphs to Disambiguate Identity References

Research output: Contribution in Book/Report/ProceedingsPaper


Publication date2009
Host publicationThe Semantic Web: Research and Applications 6th European Semantic Web Conference, ESWC 2009 Heraklion, Crete, Greece, May 31–June 4, 2009 Proceedings
EditorsLora Aroyo, Paolo Traverso , Fabio Ciravegna , Philipp Cimiano, Tom Heath, Eero Hyvönen , Riichiro Mizoguchi , Eyal Oren, Marta Sabou , Elena Simperl
Place of publicationBerlin
PublisherSpringer Verlag
Number of pages15
ISBN (Print)978-3-642-02120-6
<mark>Original language</mark>English


ConferenceEuropean Semantic Web Conference 2009
Period2/06/09 → …

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceEuropean Semantic Web Conference 2009
Period2/06/09 → …


Person disambiguation monitors web appearances of a person by disambiguating information belonging to different people sharing the same name. In this paper we extend person disambiguation to incorporate the ABSTRACT notion of identity. This extension utilises semantic web technologies to represent the identity of the person to be found and the web resources to be disambiguated as semantic graphs. Our approach extracts a complete semantic social graph from distributed web 2.0 services. Web resources containing possible person references are converted into semantic graphs describing available identity features. We disambiguate these web resources to identify correct identity references by performing random walks through the graph space, measuring the distances between the social graph and web resource graphs, and clustering similar web resources. We present a new distance measure called “Optimum Transitions” and evaluate the accuracy of our approach using the information retrieval measure f-measure.