An experimental study on large-scale web categorization

  • Authors:
  • Tie-Yan LIU;Yiming YANG;Hao WAN;Qian ZHOU;Bin GAO;Hua-Jun ZENG;Zheng CHEN;Wei-Ying MA

  • Affiliations:
  • Microsoft Research Asia, Beijing, P. R. China;Carnegie Mellon University, PA;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Peking University, Beijing, P. R. China;Microsoft Research Asia, Beijing, P. R. China;Microsoft Research Asia, Beijing, P. R. China;Microsoft Research Asia, Beijing, P. R. China

  • Venue:
  • WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification technologies can perform well on and scale up to such large-scale applications. To understand this, we conducted the evaluation of several representative methods (Support Vector Machines, k-Nearest Neighbor and Naive Bayes) with Yahoo! taxonomies. In particular, we evaluated the effectiveness/efficiency tradeoff in classifiers with hierarchical setting compared to conventional (flat) setting, and tested popular threshold tuning strategies for their scalability and accuracy in large-scale classification problems.