IR evaluation methods for retrieving highly relevant documents
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Query relaxation for xml model
Query relaxation for xml model
Handbook on Ontologies (International Handbooks on Information Systems)
Handbook on Ontologies (International Handbooks on Information Systems)
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Probabilistic information retrieval approach for ranking of database query results
ACM Transactions on Database Systems (TODS)
Proceedings of the 16th international conference on World Wide Web
Query relaxation using malleable schemas
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Inferring the most important types of a query: a semantic approach
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Foundations and Trends in Databases
Search Engines: Information Retrieval in Practice
Search Engines: Information Retrieval in Practice
StatSnowball: a statistical approach to extracting entity relationships
Proceedings of the 18th international conference on World wide web
SOFIE: a self-organizing framework for information extraction
Proceedings of the 18th international conference on World wide web
Language-model-based ranking for queries on RDF-graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Relaxing RDF queries based on user and domain preferences
Journal of Intelligent Information Systems
Probabilistic models for expert finding
ECIR'07 Proceedings of the 29th European conference on IR research
DBpedia: a nucleus for a web of open data
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Modeling documents as mixtures of persons for expert finding
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
Journal on data semantics X
An Introduction to Duplicate Detection
An Introduction to Duplicate Detection
Heterogeneous web data search using relevance-based on the fly data integration
Proceedings of the 21st international conference on World Wide Web
Towards fuzzy query-relaxation for RDF
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
RDF Xpress: a flexible expressive RDF search engine
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Natural language questions for the web of data
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Structured query reformulations in commerce search
Proceedings of the 21st ACM international conference on Information and knowledge management
Robust question answering over the web of linked data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Entity-relationship-structured data is becoming more important on the Web. For example, large knowledge bases have been automatically constructed by information extraction from Wikipedia and other Web sources. Entities and relationships can be represented by subject-property-object triples in the RDF model, and can then be precisely searched by structured query languages like SPARQL. Because of their Boolean-match semantics, such queries often return too few or even no results. To improve recall, it is thus desirable to support users by automatically relaxing or reformulating queries in such a way that the intention of the original user query is preserved while returning a sufficient number of ranked results. In this paper we describe comprehensive methods to relax SPARQL-like triplepattern queries in a fully automated manner. Our framework produces a set of relaxations by means of statistical language models for structured RDF data and queries. The query processing algorithms merge the results of different relaxations into a unified result list, with ranking based on any ranking function for structured queries over RDF-data. Our experimental evaluation, with two different datasets about movies and books, shows the effectiveness of the automatically generated relaxations and the improved quality of query results based on assessments collected on the Amazon Mechanical Turk platform.