Sciweavers

388 search results - page 1 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
VLDB
2000
ACM
130views Database» more  VLDB 2000»
13 years 11 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
14 years 12 days ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
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, ...
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 7 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
DAWAK
2004
Springer
14 years 26 days ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan