Constructing Subsumption Hierarchies of Web Queries
|Title:||Constructing Subsumption Hierarchies of Web Queries||Authors:||Prohaska, Alexander
|Permanent link:||http://hdl.handle.net/10197/6857||Date:||4-Jun-2015||Abstract:||In this work, we present an approach for automatically identifying subsumption relations between web queries, a difficult (due to feature sparseness and ambiguity), but extremely useful task for many applications, ranging from user profiling and semantic enhancement of query logs, to traffic minimisation in distributed search environments (e.g., federations of digital libraries or cloud-based systems). We start by matching each query to the topics of a comprehensive web directory, and use these topics to apply query expansion in an iterative fashion. Subsequently, all expanded queries are mapped onto the DMOZ hierarchy, and the resulting subsumption relations are directly inferred from the directory structure once conflicts in the hierarchy are resolved. We evaluate our technique on real-world queries, and show that our approach is effective under all settings.||Type of material:||Conference Publication||Keywords:||Machine learning;Statistics;Subsumption hierarchies;Keyword queries||Language:||en||Status of Item:||Peer reviewed||Conference Details:||12th ESWC 2015, Portoroz, Slovenia, 31 May - 4 June 2015|
|Appears in Collections:||Insight Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.