English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Automatic Query Refinement Using Mined Semantic Relations

MPS-Authors
/persons/resource/persons44521

Graupmann,  Jens
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons44215

Cai,  Jun
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45380

Schenkel,  Ralf
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Graupmann, J., Cai, J., & Schenkel, R. (2005). Automatic Query Refinement Using Mined Semantic Relations. In International Workshop on Challenges in Web Information Retrieval and Integration (WIRI) (pp. 205-213). Los Alamitos, USA: IEEE.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-25E7-B
Abstract
With the Web of today being unstructured and semantically heterogeneous, keyword-based queries are likely to miss important results. Therefore, {\em refining} and {\em 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 Hidden Web. Preliminary, yet convincing experiments from a restricted application domain indicate the viability of our approach.