Exploring wikipedia's category graph for query classification

Authors:
Milad Alemzadeh;Richard Khoury;Fakhri Karray
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada;Department of Software Engineering, Lakehead University, Thunder Bay, Ontario, Canada;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada
Venue:
AIS'11 Proceedings of the Second international conference on Autonomous and intelligent systems
Year:
2011

Citing 8
Cited 1

Real life, real users, and real needs: a study and analysis of user queries on the web

Information Processing and Management: an International Journal
KDD CUP-2005 report: facing a great challenge

ACM SIGKDD Explorations Newsletter
Q2C@UST: our winning solution to query classification in KDDCUP 2005

ACM SIGKDD Explorations Newsletter
Building bridges for web query classification

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Automatic classification of Web queries using very large unlabeled query logs

ACM Transactions on Information Systems (TOIS)
Domain Ontology Based Automatic Question Answering

ICCET '09 Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02
Understanding user's query intent with wikipedia

Proceedings of the 18th international conference on World wide web
An Efficient Method for Tagging a Query with Category Labels Using Wikipedia towards Enhancing Search Engine Results

WI-IAT '10 Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01

Enhancement of the ROVER's voting scheme using pattern matching

AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wikipedia's category graph is a network of 400,000 interconnected category labels, and can be a powerful resource for many classification tasks. However, its size and the lack of order can make it difficult to navigate. In this paper, we present a new algorithm to efficiently explore this graph and discover accurate classification labels. We implement our algorithm as the core of a query classification system and demonstrate its reliability using the KDD CUP 2005 competition as a benchmark.