Sciweavers

499 search results - page 54 / 100
» PRICES: An Efficient Algorithm for Mining Association Rules
Sort
View
SDM
2008
SIAM
97views Data Mining» more  SDM 2008»
13 years 9 months ago
Efficient Distribution Mining and Classification
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
Yasushi Sakurai, Rosalynn Chong, Lei Li, Christos ...
CORR
2010
Springer
279views Education» more  CORR 2010»
13 years 7 months ago
Mining Frequent Itemsets Using Genetic Algorithm
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
Soumadip Ghosh, Sushanta Biswas, Debasree Sarkar, ...
DIS
2008
Springer
13 years 9 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
13 years 11 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 9 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang