Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A new two-phase sampling based algorithm for discovering association rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Mining of Frequent Patterns from Uncertain Data
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A decremental approach for mining frequent itemsets from uncertain data
PAKDD'08 Proceedings of the 12th 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
Probabilistic spatial queries on existentially uncertain data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Since there are many real-life situations in which people are uncertain about the content of transactions, association rule mining with uncertain data is in demand. Most of these studies focus on the improvement of classical algorithms for frequent itemsets mining. To obtain a tradeoff between the accuracy and computation time, in this paper we introduces an efficient algorithm for finding association rules from uncertain data with sampling-SARMUT, which is based on the FAST algorithm introduced by Chen et al. Unlike FAST, SARMUT is designed for uncertain data mining. In response to the special characteristics of uncertainty, we propose a new definition of "distance" as a measure to pick representative transactions. To evaluate its performance and accuracy, a comparison against the natural extension of FAST is performed using synthetic datasets. The experimental results show that the proposed sampling algorithm SARMUT outperforms FAST algorithm, and achieves up to 97% accuracy in some cases.