Difference between revisions of "Exploring Wikipedia's Category Graph for Query Classification"
(Adding embed) |
(Adding categories) |
||
Line 32: | Line 32: | ||
</nowiki> | </nowiki> | ||
</code> | </code> | ||
+ | |||
+ | |||
+ | |||
+ | [[Category:Scientific works]] |
Latest revision as of 00:11, 22 July 2019
Authors | Milad Alemzadeh Richard Khoury Fakhri Karray |
---|---|
Publication date | 2011 |
DOI | 10.1007/978-3-642-21538-4_22 |
Links | Original |
Exploring Wikipedia's Category Graph for Query Classification - scientific work related to Wikipedia quality published in 2011, written by Milad Alemzadeh, Richard Khoury and Fakhri Karray.
Overview
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, authors present a new algorithm to efficiently explore this graph and discover accurate classification labels. Authors implement algorithm as the core of a query classification system and demonstrate its reliability using the KDD CUP 2005 competition as a benchmark.
Embed
Wikipedia Quality
Alemzadeh, Milad; Khoury, Richard; Karray, Fakhri. (2011). "[[Exploring Wikipedia's Category Graph for Query Classification]]". Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-21538-4_22.
English Wikipedia
{{cite journal |last1=Alemzadeh |first1=Milad |last2=Khoury |first2=Richard |last3=Karray |first3=Fakhri |title=Exploring Wikipedia's Category Graph for Query Classification |date=2011 |doi=10.1007/978-3-642-21538-4_22 |url=https://wikipediaquality.com/wiki/Exploring_Wikipedia's_Category_Graph_for_Query_Classification |journal=Springer, Berlin, Heidelberg}}
HTML
Alemzadeh, Milad; Khoury, Richard; Karray, Fakhri. (2011). "<a href="https://wikipediaquality.com/wiki/Exploring_Wikipedia's_Category_Graph_for_Query_Classification">Exploring Wikipedia's Category Graph for Query Classification</a>". Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-21538-4_22.