返回
Query enrichment for Web-query classification
DOI:10.1145/1165774.1165776.png)
摘要
En 中文
Web-search queries are typically short and ambiguous. To classify these queries into certain target categories is a difficult but important problem. In this article, we present a new technique called query enrichment, which takes a short query and maps it to intermediate objects. Based on the collected intermediate objects, the query is then mapped to target categories. To build the necessary mapping functions, we use an ensemble of search engines to produce an enrichment of the queries. Our technique was applied to the ACM Knowledge Discovery and Data Mining competition (ACM KDDCUP) in 2005, where we won the championship on all three evaluation metrics (aprecision, F1 measure, which combines precision and recall, and creativity, which is judged by the organizers) among a total of 33 teams worldwide. In this article, we show that, despite the difficulty of an abundance of ambiguous queries and lack of training data, our query-enrichment technique can solve the problem satisfactorily through a two-phase classification framework. We present a detailed description of our algorithm and experimental evaluation. Our best result for F1 and precision is 42.4% and 44.4%, respectively, which is 9.6% and 24.3% higher than those from the runner-ups, respectively.
Keyword:
algorithms
experimentation
performance
query classification
query enrichment
synonym-based classifier
ensemble learning
KDDCUP2005
期刊
IF:
9.1
论文数:
1.2K
被引数:
4.7K
机构
暂无机构信息
引用论文
Macroscopic Control of Helix Orientation in Films Dried from Cholesteric Liquid‐Crystalline Cellulose Nanocrystal Suspensions
ChemPhysChem
IF0
Neutron Tomographic Investigation of the Effect of Hydrophobicity Gradients within MPL and MEA on the Spatial Distribution and Transport of Liquid Water in PEMFCsMPL和MEA内疏水性梯度对pemfc中液态水的空间分布和传输的影响的中子层析成像研究

