By Topic

A new association rule-based text classifier algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Buddeewong ; Fac. of Inf. Technol., King Mongkut's Inst. of Techology Ladkrabang, Bangkok, Thailand ; W. Kreesuradej

This paper proposes a new association rule-based text classifier algorithm to improve the prediction accuracy of association rule-based classifier by categories (ARC-BC) algorithm. Unlike the previous algorithms, the proposed association rule generation algorithm constructs two types of frequent itemsets. The first frequent itemsets, i.e. Lk contain all term that have no an overlap with other categories. The second frequent itemsets, i.e. OLk contain all features that have an overlap with other categories. In addition, this paper also proposes a new join operation for the second frequent itemsets. The experimental results are shown a good performance of the proposed classifier

Published in:

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)

Date of Conference:

16-16 Nov. 2005