Distributed Uncertain Data Mining for Frequent Patterns Satisfying Anti-monotonic Constraints

High volumes of uncertain data can be generated in distributed environments in many real-life biological, medical and life science applications. As an important data mining task, frequent pattern mining helps discover frequently co-occurring items, objects, or events from these distributed databases. However, users may be interested in only some small portions of all the frequent patterns that can be mined from these databases. In this paper, we propose an intelligent computing system that (i) allows users to express their interests via the use of user-specified constraints and (ii)effectively exploits anti-monotonic properties of user-specified constraints and efficiently discovers frequent patterns satisfying these constraints from the distributed databases containing uncertain data.

[1]  Laks V. S. Lakshmanan,et al.  Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.

[2]  Carson Kai-Sang Leung,et al.  Mining of Frequent Itemsets from Streams of Uncertain Data , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[3]  James Bailey,et al.  Mining Probabilistic Frequent Spatio-Temporal Sequential Patterns with Gap Constraints from Uncertain Databases , 2013, 2013 IEEE 13th International Conference on Data Mining.

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

[5]  Wookey Lee,et al.  Mobile Web Navigation in Digital Ecosystems Using Rooted Directed Trees , 2011, IEEE Transactions on Industrial Electronics.

[6]  Fatos Xhafa,et al.  Performance Evaluation of Two Search Space Reduction Methods for a Distributed Network Architecture , 2008, NBiS.

[7]  Viet Phan-Luong,et al.  Mining Normal and Abnormal Class-Association Rules , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[8]  Shaoning Pang,et al.  Malicioius Software Detection Using Multiple Sequence Alignment and Data Mining , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[9]  Bruno Crémilleux,et al.  Optimizing hypergraph transversal computation with an anti-monotone constraint , 2007, SAC '07.

[10]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[11]  Carol S. Smidts,et al.  A Facility Framework for Distributed Application , 2011, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications.

[12]  Jianhua Yang,et al.  Mining Network Traffic Efficiently to Detect Stepping-Stone Intrusion , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[13]  Reynold Cheng,et al.  Voronoi-based nearest neighbor search for multi-dimensional uncertain databases , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[14]  Fatos Xhafa,et al.  Mining Navigation Patterns in a Virtual Campus , 2012, 2012 Third International Conference on Emerging Intelligent Data and Web Technologies.

[15]  Osmar R. Zaïane,et al.  Parallel leap: large-scale maximal pattern mining in a distributed environment , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[16]  Shigeaki Sakurai,et al.  A Discovery Method of Trend Rules from Complex Sequential Data , 2012, 2012 26th International Conference on Advanced Information Networking and Applications Workshops.

[17]  Carson Kai-Sang Leung,et al.  Frequent itemset mining of uncertain data streams using the damped window model , 2011, SAC.

[18]  Carson Kai-Sang Leung,et al.  Finding Strong Groups of Friends among Friends in Social Networks , 2011, 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing.

[19]  Mohammed J. Zaki.  Parallel and distributed association mining: a survey , 1999, IEEE Concurr..

[20]  Jiawei Han,et al.  A fast distributed algorithm for mining association rules , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[21]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[22]  Shengrui Wang,et al.  A Frequent Pattern Mining Approach for ADLs Recognition in Smart Environments , 2011, 2011 IEEE International Conference on Advanced Information Networking and Applications.

[23]  Carson Kai-Sang Leung,et al.  Exploring Social Networks: A Frequent Pattern Visualization Approach , 2010, 2010 IEEE Second International Conference on Social Computing.

[24]  Hayato Yamana,et al.  IC-BIDE: Intensity Constraint-Based Closed Sequential Pattern Mining for Coding Pattern Extraction , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[25]  F. Bonchi,et al.  Extending the state-of-the-art of constraint-based pattern discovery , 2007, Data Knowl. Eng..

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

[27]  Laks V. S. Lakshmanan,et al.  Efficient dynamic mining of constrained frequent sets , 2003, TODS.

[28]  Carson Kai-Sang Leung,et al.  A Tree-Based Approach for Frequent Pattern Mining from Uncertain Data , 2008, PAKDD.

[29]  Ran Wolff,et al.  A high-performance distributed algorithm for mining association rules , 2004, Knowledge and Information Systems.

[30]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[31]  Luc De Raedt,et al.  Constraint programming for itemset mining , 2008, KDD.

[32]  Carson Kai-Sang Leung,et al.  Mining uncertain data , 2011, WIREs Data Mining Knowl. Discov..