Exploiting Structural Information for Text Classification on the WWW

Lecture notes in computer sciencePublished 1 January 1999

Johannes Fürnkranz

DOI10.1007/3-540-48412-4_41

Source URL

Citations123

SJR quartileQ2

SJR score0.35

SNIP0.55

TL;DR

Experimental evidence is presented that confirms the working hypothesis that it is often easier to classify a hypertext page using information provided on pages that point to it instead of using information that is provided on the page itself.

Abstract

In this paper, we report on a set of experiments that explore the utility of making use of the structural information of WWW documents. Our working hypothesis is that it is often easier to classify a hypertext page using information provided on pages that point to it instead of using information that is provided on the page itself. We present experimental evidence that confirms this hypothesis on a set of Web-pages that relate to Computer Science Departments.

Keywords

Computer Science

Elsevier eBooksFast Effective Rule Induction

3,767 Citations1995William W. Cohen

This paper evaluates the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems, and proposes a number of modifications resulting in an algorithm RIPPERk that is very competitive with C4.5 and C 4.5rules with respect to error rates, but much more efficient on large samples.

Learning to extract symbolic knowledge from the World Wide Web

675 Citations1998Mark Craven, Dan DiPasquo +5 more

The goal of the research described here is to automatically create a computer understandable world wide knowledge base whose content mirrors that of the World Wide Web, and several machine learning algorithms for this task are described.

Learning trees and rules with set-valued features

244 Citations1996William W. Cohen

It is argued that many decision tree and rule learning algorithms can be easily extended to set-valued features, and it is shown by example that many real-world learning problems can be efficiently and naturally represented with set- valued features.

Computer Networks and ISDN SystemsParaSite: mining structural information on the Web

165 Citations1997Ellen Spertus

The varieties of link information (not just hyperlinks) on the Web, how the Web differs from conventional hypertext, and how the links can be exploited to build useful applications are discussed.

Machine LearningPruning Algorithms for Rule Learning

139 Citations1997Johannes Fürnkranz

The primary goal of this paper is to show how to solve the problems of noise in decision tree learning with two new algorithms that combine and integrate pre- and post-pruning.

View PDF

A Case Study in Using Linguistic Phrases for Text Categorization on the WWW

101 Citations1998Johannes Ffirnkranz, Tom M. Mitchell +1 more

The results show that phrasal features can improve the precision of learned theories at the expense of coverage in machine learning algorithms on a classification task on the WWW.

Lecture notes in computer scienceCombining statistical and relational methods for learning in hypertext domains

78 Citations1998Seán Slattery, Mark Craven

This work presents a new approach to learning hypertext classifiers that combines a statistical text-learning method with a relational rule learner and demonstrates that this new approach is able to learn more accurate classifiers than either of its constituent methods alone.

Using Statistical and Relational Methods to Characterize Hyperlink Paths

3 Citations1998Mark Craven

This work describes the work in learning definitions for particular relations that exist between pairs of pages in hypertext, which is applicable to the tasks of information extraction from the Web, and resource finding in the Web.