When simple is (more than) good enough: effective semantic search with (almost) no semantics

Authors:
Robert Neumayer;Krisztian Balog;Kjetil Nørvåg
Affiliations:
Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway
Venue:
ECIR'12 Proceedings of the 34th European conference on Advances in Information Retrieval
Year:
2012

Citing 5
Cited 1

Combining document representations for known-item search

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Simple BM25 extension to multiple weighted fields

Proceedings of the thirteenth ACM international conference on Information and knowledge management
Ad-hoc object retrieval in the web of data

Proceedings of the 19th international conference on World wide web
Using BM25F for semantic search

Proceedings of the 3rd International Semantic Search Workshop
Effective and efficient entity search in RDF data

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I

A test collection for entity search in DBpedia

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using keyword queries to find entities has emerged as one of the major search types on the Web. In this paper, we study the task of ad-hoc entity retrieval: keyword search in a collection of structured data. We start with a baseline retrieval system that constructs pseudo documents from RDF triples and introduce three extensions: preprocessing of URIs, using two-fielded retrieval models, and boosting popular domains. Using the query sets of the 2010 and 2011 Semantic Search Challenge, we show that our straightforward approach outperforms all previously reported results, some generated by far more complex systems.