Sciweavers

680 search results - page 15 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 3 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 1 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
77
Voted
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
15 years 3 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
15 years 3 months ago
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. ...
Robert Jäschke, Andreas Hotho, Christoph Schm...
PPOPP
2005
ACM
15 years 3 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...