Modeling interestingness of streaming classification rules as a classification problem

Authors:
Tolga Aydın;Halil Altay Güvenir
Affiliations:
Department of Computer Engineering, Bilkent University, Ankara, Turkey;Department of Computer Engineering, Bilkent University, Ankara, Turkey
Venue:
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Year:
2005

Citing 4
Cited 2

Finding interesting rules from large sets of discovered association rules

CIKM '94 Proceedings of the third international conference on Information and knowledge management
Interestingness of Discovered Association Rules in Terms of Neighborhood-Based Unexpectedness

PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
Exception Rule Mining with a Relative Interestingness Measure

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Post-analysis of learned rules

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Extensions of the k Nearest Neighbour methods for classification problems

AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Classification rule mining for a stream of perennial objects

RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications

Quantified Score

Hi-index	0.00

Visualization

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 classification rules' interestingness learning algorithm (ICRIL) is developed to automatically label the classification rules either as “interesting” or “uninteresting” with limited user interaction. In our study, VFFP (Voting Fuzzified Feature Projections), a feature projection based incremental classification algorithm, is also developed in the framework of ICRIL. The concept description learned by the VFFP is the interestingness concept of streaming classification rules.