Sciweavers

9 search results - page 1 / 2
» Discovery of maximum length frequent itemsets
Sort
View
ISCI
2008
116views more  ISCI 2008»
13 years 4 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
DAWAK
2004
Springer
13 years 10 months 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
AAAI
2006
13 years 6 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 6 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 4 months ago
Significant Interval and Frequent Pattern Discovery in Web Log Data
There is a considerable body of work on sequence mining of Web Log Data We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the tr...
Kanak Saxena, Rahul Shukla