Effective algorithms for vertical mining probabilistic frequent patterns in uncertain mobile environments

Data uncertainty is inherent in mobile applications. The traditional methods of mining frequent patterns are confronted with enormous challenges in uncertain mobile environments. The present achievements have shown that vertical mining algorithms are promising in mining expected support-based frequent patterns from uncertain data, while they have not captured much attention in mining probabilistic frequent patterns. In this paper, we propose two vertical mining algorithms UBEclat and NDUEclat for probabilistic frequent patterns mining FPM. The UBEclat algorithm is applied to discover exact probabilistic frequent patterns in uncertain environments, while the NDUEclat algorithm is suitable for mining probabilistic frequent patterns approximately in mobile environments with huge uncertain data. We test the two algorithms on real and synthetic datasets, and compare them with well-known FPM algorithms. The extensive evaluations show that the novel Eclat-based algorithms outperform the comparative ones in performance of efficiency and precision.

[1]  Seyed Ahmad Motamedi,et al.  Performance evaluation of beacon enabled IEEE 802.15.4 network with downlink and uplink traffic and limited retransmission , 2015, Int. J. Ad Hoc Ubiquitous Comput..

[2]  Ben-Jye Chang,et al.  Cross-layer-based reliable robust transmission for emergency messages in high mobility unreliable VANET networks , 2015, Int. J. Ad Hoc Ubiquitous Comput..

[3]  A. Sapuppo,et al.  Designing for privacy in ubiquitous social networking , 2015, Int. J. Ad Hoc Ubiquitous Comput..

[4]  Hong Wang,et al.  A Bidirectional Process Algorithm for Mining Probabilistic Frequent Itemsets , 2014, 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications.

[5]  Rajeev Raman,et al.  Mining sequential patterns from probabilistic databases , 2011, Knowledge and Information Systems.

[6]  Jong-Tae Park,et al.  An enhanced fast IP mobility management using multiple care-of-addresses in vehicular networks , 2013, Int. J. Ad Hoc Ubiquitous Comput..

[7]  Reynold Cheng,et al.  Efficient Mining of Frequent Item Sets on Large Uncertain Databases , 2012, IEEE Transactions on Knowledge and Data Engineering.

[8]  Jin Li,et al.  Efficient Fair Conditional Payments for Outsourcing Computations , 2012, IEEE Transactions on Information Forensics and Security.

[9]  Kemal Akkaya,et al.  Connectivity restoration in delay-tolerant sensor networks using game theory , 2012, Int. J. Ad Hoc Ubiquitous Comput..

[10]  Carson Kai-Sang Leung,et al.  Mining probabilistic datasets vertically , 2012, IDEAS '12.

[11]  Philip S. Yu,et al.  Mining Frequent Itemsets over Uncertain Databases , 2012, Proc. VLDB Endow..

[12]  Carson Kai-Sang Leung,et al.  Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data , 2012, DASFAA.

[13]  Carson Kai-Sang Leung,et al.  Equivalence class transformation based mining of frequent itemsets from uncertain data , 2011, SAC.

[14]  Rajeev Raman,et al.  On Probabilistic Models for Uncertain Sequential Pattern Mining , 2010, ADMA.

[15]  Reynold Cheng,et al.  Accelerating probabilistic frequent itemset mining: a model-based approach , 2010, CIKM.

[16]  Rajeev Raman,et al.  Uncertainty in Sequential Pattern Mining , 2010, BNCOD.

[17]  Toon Calders,et al.  Efficient Pattern Mining of Uncertain Data with Sampling , 2010, PAKDD.

[18]  Mohamed E. El-Sharkawi,et al.  Vertical Mining of Frequent Patterns from Uncertain Data , 2010, Comput. Inf. Sci..

[19]  Yen-Liang Chen,et al.  Mining fuzzy association rules from uncertain data , 2010, Knowledge and Information Systems.

[20]  Charu C. Aggarwal,et al.  Frequent pattern mining with uncertain data , 2009, KDD.

[21]  Hans-Peter Kriegel,et al.  Probabilistic frequent itemset mining in uncertain databases , 2009, KDD.

[22]  Feifei Li,et al.  Finding frequent items in probabilistic data , 2008, SIGMOD Conference.

[23]  Ben Kao,et al.  A Decremental Approach for Mining Frequent Itemsets from Uncertain Data , 2008, PAKDD.

[24]  Yen-Liang Chen,et al.  Mining association rules from imprecise ordinal data , 2008, Fuzzy Sets Syst..

[25]  Sanjay Kumar Dhurandher,et al.  Highly stable and adaptive clustering with efficient routing in wireless ad hoc networks , 2008, Int. J. Ad Hoc Ubiquitous Comput..

[26]  Edward Hung,et al.  Mining Frequent Itemsets from Uncertain Data , 2007, PAKDD.

[27]  Sanguthevar Rajasekaran,et al.  Ieee Transactions on Knowledge and Data Engineering 1 a Transaction Mapping Algorithm for Frequent Itemsets Mining , 2022 .

[28]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[29]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[30]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[31]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[32]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[33]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.