Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Finding frequent items in probabilistic data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Multi-level Frequent Pattern Mining
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Mining of Frequent Itemsets from Streams of Uncertain Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic frequent itemset mining in uncertain databases
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Approximation of Frequentness Probability of Itemsets in Uncertain Data
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
An alternative interestingness measure for mining periodic-frequent patterns
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Frequent pattern mining from time-fading streams of uncertain data
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Efficient pattern mining of uncertain data with sampling
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
A constrained frequent pattern mining system for handling aggregate constraints
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Mining probabilistic datasets vertically
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Mining popular patterns from transactional databases
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
FARP: Mining fuzzy association rules from a probabilistic quantitative database
Information Sciences: an International Journal
| Hi-index | 0.00 |
Over the past two decades, numerous algorithms have been proposed for mining frequent itemsets from precise data. However, there are situations in which data are uncertain. In recent years, tree-based algorithms have been proposed to mine frequent itemsets from uncertain data. While the key success of tree-based algorithms for mining precise data is due to the compactness of a tree structure in capturing precise data, the corresponding tree structure in capturing uncertain data may not be so compact. In this paper, we propose a novel tree structure for capturing uncertain data such that it is as compact as the tree for capturing precise data. Moreover, we also propose two fast algorithms that use this compact tree structure to mine frequent itemsets. Experimental results showed the compactness of our tree and the effectiveness of our algorithms in mining frequent itemsets from uncertain data.