Sciweavers

680 search results - page 13 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen
FIMI
2004
161views Data Mining» more  FIMI 2004»
14 years 11 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
15 years 2 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
RCIS
2010
14 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
JCIT
2008
128views more  JCIT 2008»
14 years 9 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya