A Study of Approaches to Hypertext Categorization

  • Authors:

  • Yiming Yang;Seá/n Slattery;Rayid Ghani

  • Affiliations:

  • School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA. yiming.yang@cs.cmu.edu;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA. sean.slattery@cs.cmu.edu;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA&semi/ Accenture Technology Labs—/Research, Northbrook, IL 60062, USA. rayid.ghani@cs.cmu.edu

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hypertext poses new research challenges for text classification. Hyperlinks, HTML tags, category labels distributed over linked documents, and meta data extracted from related Web sites all provide rich information for classifying hypertext documents. How to appropriately represent that information and automatically learn statistical patterns for solving hypertext classification problems is an open question. This paper seeks a principled approach to providing the answers. Specifically, we define five hypertext regularities which may (or may not) hold in a particular application domain, and whose presence (or absence) may significantly influence the optimal design of a classifier. Using three hypertext datasets and three well-known learning algorithms (Naive Bayes, Nearest Neighbor, and First Order Inductive Learner), we examine these regularities in different domains, and compare alternative ways to exploit them. Our results show that the identification of hypertext regularities in the data and the selection of appropriate representations for hypertext in particular domains are crucial, but seldom obvious, in real-world problems. We find that adding the words in the linked neighborhood to the page having those links (both inlinks and outlinks) were helpful for all our classifiers on one data set, but more harmful than helpful for two out of the three classifiers on the remaining datasets. We also observed that extracting meta data from related Web sites was extremely useful for improving classification accuracy in some of those domains. Finally, the relative performance of the classifiers being tested provided insights into their strengths and limitations for solving classification problems involving diverse and often noisy Web pages.