Sciweavers

490 search results - page 16 / 98
» Association rules mining using heavy itemsets
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
RIDE
1997
IEEE
15 years 1 months ago
Evaluation of Sampling for Data Mining of Association Rules
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
IJFCS
2008
102views more  IJFCS 2008»
14 years 9 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 9 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
ICTAI
2003
IEEE
15 years 2 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo