Sciweavers

851 search results - page 65 / 171
» On the Complexity of Mining Association Rules
Sort
View
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
15 years 10 months ago
Computing Optimized Rectilinear Regions for Association Rules
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, ...
IMECS
2007
15 years 7 months ago
A New Class Based Associative Classification Algorithm
—applying the association rule into classification can improve the accuracy and obtain some valuable rules and information that cannot be captured by other classification approac...
Zhonghua Tang, Qin Liao
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 10 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
JMLR
2010
116views more  JMLR 2010»
15 years 29 days ago
Feature Selection, Association Rules Network and Theory Building
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...
Sanjay Chawla
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
15 years 11 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang