Authors: François Bry; Fabian Kneissl; Klara Weiand; Tim Furche
Addresses: Institute for Informatics, Ludwig-Maximilian University of Munich, 80538 Munich, Germany ' Institute for Informatics, Ludwig-Maximilian University of Munich, 80538 Munich, Germany ' Institute for Informatics, Ludwig-Maximilian University of Munich, 80538 Munich, Germany ' Department of Computer Science, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK
Abstract: Fuzzy matching and ranking are two information retrieval techniques widely used in web search. Their application to structured data, however, remains an open problem. This article investigates how eigenvector-centrality can be used for approximate matching in multi-relation graphs, that is, graphs where connections of many different types may exist. Based on an extension of the PageRank matrix, eigenvectors representing the distribution of a term after propagating term weights between related data items are computed. The result is an index which takes the document structure into account and can be used with standard document retrieval techniques. As the scheme takes the shape of an index transformation, all necessary calculations are performed during index time.
Keywords: approximate matching; structured data; eigenvector centrality; indexing methods; keyword search; social networks; semantic web; PageRank; multi-relation networks; fuzzy matching; fuzzy ranking; information retrieval; web search; structured data; multi-relation graphs; eigenvectors; term distribution; document structure; document retrieval.
International Journal of Social Network Mining, 2012 Vol.1 No.2, pp.141 - 159
Available online: 15 Dec 2012 *Full-text access for editors Access for subscribers Purchase this article Comment on this article