Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
<<< = SBBD Papers>>>
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003

Mining Class-Dependent Rules Using the Concept of Generalization/Specialization Hierarchies


Juliano Brito da Justa Neves and Marina T. Pires Vieira

  View Paper (PDF)  

Return to Data Mining


Abstract

Data mining is the process of discovering useful and previously unknown patterns in large datasets. Discovering association rules between items in large datasets is one such data mining task. A discovered rule is considered interesting if it brings new and useful information about the data. In this paper we show that if a dataset can be divided into subclasses and analyzed as if it was a generalization/specialization hierarchy, the class/subclass relationship can lead to the discovery of class-dependent rules showing interesting differences between the behavior of the whole dataset and the behavior of each of its subclasses. These differences are extracted from the association rules mined from the whole dataset and from each subclass separately. Using the concept of generalization/specialization hierarchies, comparisons and tests of statistical hypotheses, we present methods that are able to efficiently discover class-dependent rules and which classes have a higher influence on each rule. They also show when a given stimulus can provoke on one class a response that was not expected if only the undivided dataset was analyzed.


©2004 Association for Computing Machinery