A practice probability frequent pattern mining method over transactional uncertain data streams

Authors:
Guoqiong Liao;Linqing Wu;Changxuan Wan;Naixue Xiong
Affiliations:
School of Information Technology, Jiangxi University of Finance and Economics, Nanchang and Jiangxi Key Laboratory of Data and Knowledge Engineering, Nanchang, China;School of Information Technology, Jiangxi University of Finance and Economics, Nanchang and Jiangxi Key Laboratory of Data and Knowledge Engineering, Nanchang, China;School of Information Technology, Jiangxi University of Finance and Economics, Nanchang and Jiangxi Key Laboratory of Data and Knowledge Engineering, Nanchang, China;Department of Computer Science, Georgia State University
Venue:
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Year:
2011

Citing 14
Cited 0

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
Hancock: A language for analyzing transactional data streams

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Mining of Frequent Patterns from Uncertain Data

ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Finding frequent items in probabilistic data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A Framework for Clustering Uncertain Data Streams

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
On High Dimensional Projected Clustering of Uncertain Data Streams

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Tracking High Quality Clusters over Uncertain Data Streams

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns; (2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree; and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space.