Automatic Query Refinement Using Mined Semantic Relations

Authors:
Jens Graupmann;Jun Cai;Ralf Schenkel
Affiliations:
Max-Planck Institut fur Informatik, 66123 Saarbrucken, Germany;Max-Planck Institut fur Informatik, 66123 Saarbrucken, Germany;Max-Planck Institut fur Informatik, 66123 Saarbrucken, Germany
Venue:
WIRI '05 Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration
Year:
2005

Citing 0
Cited 4

The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Ontology-based automatic query refinement

International Journal of Artificial Intelligence and Soft Computing
A semantic search system using query definitions

Proceedings of the First International Conference on Intelligent Interactive Technologies and Multimedia
A Survey of Automatic Query Expansion in Information Retrieval

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the Web of today being unstructured and semantically heterogeneous, keyword-based queries are likely to miss important results. Therefore, refining and expanding queries plays an important role today. This paper presents a novel approach for query expansion that applies dependency rules mined from a large Web crawl, combining several existing techniques for data extraction and mining. Additionally, the rules help binding keyword queries to the input fields of forms on Web portals, opening up the tremendous resources of the HiddenWeb. Preliminary, yet convincing experiments from a restricted application domain indicate the viability of our approach.