Text Categorization With Ila

No Thumbnail Available

Date

2003

Journal Title

Journal ISSN

Volume Title

Publisher

Springer Verlag

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Journal Issue

Events

Abstract

The sudden expansion of the web and the use of the internet has caused some research fields to regain (or even increase) its old popularity. Of them, text categorization aims at developing a classification system for assigning a number of predefined topic codes to the documents based on the knowledge accumulated in the training process. We propose a framework based on an automatic inductive classifier, called ILA, for text categorization, though this attempt is not a novel approach to the information retrieval community. Our motivation are two folds. One is that there is still much to do for efficient and effective classifiers. The second is of ILA's (Inductive Learning Algorithm) well-known ability in capturing by canonical rules the distinctive features of text categories. Our results with respect to the Reuters 21578 corpus indicate (1) the reduction of features by information gain measurement down to 20 is essentially as good as the case where one would have more features; (2) recall/precision breakeven points of our algorithm without tuning over top 10 categories are comparable to other text categorization methods, namely similarity based matching, naive Bayes, Bayes nets, decision trees, linear support vector machines, steepest descent algorithm. © Springer-Verlag Berlin Heidelberg 2003.

Description

Keywords

Feature Selection, Inductive Learning, Text Categorization

Turkish CoHE Thesis Center URL

Fields of Science

Citation

WoS Q

Scopus Q

Q3

Source

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

2869

Issue

Start Page

300

End Page

307

Collections