A Case Study in Using Linguistic Phrases for Text Categorization on the WWW
Published 1 January 1998
Johannes Ffirnkranz, Tom M. Mitchell, Ellen Riloff
Citations101
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
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.
Abstract
Most learning algorithms that are applied to text categorization problems rely on a bag-of-words document representation, i.e., each word occurring in the document is considered as a separate feature. In this paper, we investigate the use of linguistic phrases as input features for text categorization problems. These features are based on information extraction patterns that are generated and used by the AUTOSLOG-TS system. We present experimental results on using such features as background knowledge for two machine learning algorithms on a classification task on the WWW. The results show that phrasal features can improve the precision of learned theories at the expense of coverage.
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.
Elsevier eBooksNewsWeeder: Learning to Filter Netnews
2,022 Citations1995Ken Lang
The results show that a learning algorithm based on the Minimum Description Length (MDL) principle was able to raise the percentage of interesting articles to be shown to users from 14% to 52% on average.
Machine LearningLearning Logical Definitions from Relations
1,425 Citations1990J. R. Quinlan
FOIL is a system that learns Horn clauses from data expressed as relations, but extends them to a first-order formalism, which has been applied successfully to several tasks taken from the machine learning literature.
IEEE Transactions on Information TheoryThe zero-frequency problem: estimating the probabilities of novel events in adaptive text compression
726 Citations1991Ian H. Witten, Tim Bell
The authors propose the application of a Poisson process model of novelty, which ability to predict novel tokens is evaluated, and it consistently outperforms existing methods and offers a small improvement in the coding efficiency of text compression over the best method previously known.
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.
Automatically generating extraction patterns from untagged text
620 Citations1996Ellen Riloff
This work has developed a system called AutoSlog-TS that creates dictionaries of extraction patterns using only untagged text, and in experiments with the MUG-4 terrorism domain, created a dictionary of extraction pattern that performed comparably to a dictionary created by autoSlog, using only preclassified texts as input.
Artificial Intelligence ReviewSeparate-and-Conquer Rule Learning
523 Citations1999Johannes Fürnkranz
This paper is a survey of inductive rule learning algorithms that use a separate-and-conquer strategy and analyzes them along three different dimensions, namely their search, language and overfitting avoidance biases.
Elsevier eBooksIncremental Reduced Error Pruning
363 Citations1994Johannes Fürnkranz, Gerhard Widmer
Experiments show that in many noisy domains this method is much more efficient than alternative algorithms, along with a slight gain in accuracy, however, the experiments show that the use of the algorithm cannot be recommended for domains which require a very specific concept description.
Context-sensitive learning methods for text categorization
253 Citations1996William W. Cohen, Yoram Singer
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.
Artificial IntelligenceAn empirical study of automated dictionary construction for information extraction in three domains
136 Citations1996Ellen Riloff
The performance of AutoSlog across the three domains is compared, the lessons learned about the generality of this approach are discussed, and results from two experiments which demonstrate that novice users can generate effective dictionaries using autoSlog are presented.
Little words can make a big difference for text classification
117 Citations1995Ellen Riloff
This work presents results from text classification experiments that compare relevancy signatures, which use local linguistic context, with corresponding indexing terms that do not, and suggests that stopword lists and stemming algorithms may remove or conflate many words that could be used to create more effective indexing Terms.
Text, speech and language technologyExtraction-Based Text Categorization: Generating Domain-Specific Role Relationships Automatically
42 Citations1999Ellen Riloff, Jeffrey Lorenzen
This chapter explains how the extraction patterns can be generated automatically using only preclassified texts as input and presents the word-augmented relevancy signatures algorithm that uses lexical items to represent domain-specific role relationships instead of semantic features.