A classification method based on subspace clustering and association rules

Authors:
Takashi Washio;Koutarou Nakanishi;Hiroshi Motoda
Affiliations:
Osaka University, Mihogaoka, Ibaraki City, Osaka, Japan;Osaka University, Mihogaoka, Ibaraki City, Osaka, Japan;Osaka University, Mihogaoka, Ibaraki City, Osaka, Japan
Venue:
New Generation Computing
Year:
2007

Citing 5
Cited 1

Mining quantitative association rules in large relational tables

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Automatic subspace clustering of high dimensional data for data mining applications

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A Monte Carlo algorithm for fast projective clustering

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

Extracting temporal patterns from interval-based sequences

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

Class Association Rule (CAR) based classification is a growing topic in recent datamining study for its high interpretability and accuracy. However, most of the approaches have not intensively addressed the classification of instances including numeric attributes. In this paper, a levelwise subspace clustering deriving hyper-rectangular clusters is proposed to efficiently provide quantitative, interpretative and accurate CARs. Significant performance of the proposed approach has been demonstrated through the tests on UCI repository data.