ABSTRACT
The context of the user queries, preceding a given query, is utilized to improve the effectiveness of query classification. Earlier efforts utilize fixed number of preceding queries to derive such context information. We propose and evaluate an approach (DQW) that identifies a set of unambiguous preceding queries in a dynamically determined window to utilize in classifying an ambiguous query. Furthermore, utilizing a relationship-net (R-net) that represents relationships among known categories, we improve the classification effectiveness for those ambiguous queries whose predicted category in this relationship-net is related to the category of a query within the window. Our results indicate that the hybrid approach (DQW+R-net) statistically significantly improves the Conditional Random Field (CRF) query classification approach when static query windowing and hierarchical taxonomy are used (SQW+Tax), in terms of precision (10.8%), recall (13.2%), and F1 measure (11.9%).
- Cao, H., Hu, D. H., Shen, D., Jiang, D., Sun, J., Chen, E., and Yang, Q., Context-aware query classification. SIGIR, 2009 Google ScholarDigital Library
- Lafferty, J. D., McCallum, A., and Pereira, F. C., Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. ICML, 2001 Google ScholarDigital Library
- Mengle, S., Goharian, N., Ambiguity measure feature-selection algorithm. JASIST, 60(5), 2009 Google ScholarDigital Library
- Mengle, S., Goharian, N., Detecting relationships among categories using text classification. JASIST, 61(5), 2010 Google ScholarDigital Library
Index Terms
- Context aware query classification using dynamic query window and relationship net
Recommendations
Context-aware query classification
SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrievalUnderstanding users'search intent expressed through their search queries is crucial to Web search and online advertisement. Web query classification (QC) has been widely studied for this purpose. Most previous QC algorithms classify individual queries ...
Improving context-aware query classification via adaptive self-training
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementTopical classification of user queries is critical for general-purpose web search systems. It is also a challenging task, due to the sparsity of query terms and the lack of labeled queries. On the other hand, search contexts embedded in query sessions ...
View-based query containment
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsQuery containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only ...
Comments