Learning interestingness of streaming classification rules

Date
2004
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computer and Information Sciences - ISCIS 2004
Print ISSN
0302-9743
Electronic ISSN
Publisher
Springer, Berlin, Heidelberg
Volume
3280
Issue
Pages
62 - 71
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Inducing classification rules on domains from which information is gathered at regular periods lead the number of such classification rules to be generally so huge that selection of interesting ones among all discovered rules becomes an important task. At each period, using the newly gathered information from the domain, the new classification rules are induced. Therefore, these rules stream through time and are so called streaming classification rules. In this paper, an interactive rule interestingness-learning algorithm (IRIL) is developed to automatically label the classification rules either as "interesting" or "uninteresting" with limited user interaction. In our study, VFP (Voting Feature Projections), a feature projection based incremental classification learning algorithm, is also developed in the framework of IRIL. The concept description learned by the VFP algorithm constitutes a novel approach for interestingness analysis of streaming classification rules. © Springer-Verlag 2004.

Course
Other identifiers
Book Title
Citation