Mining constrained frequent itemsets from distributed uncertain data

Future Generation Computer Systems

Volumn 37, Issue , 2014, Pages 117-126

  Cuzzocrea, Alfredo ^a   Leung, Carson Kai Sang ^b   Mackinnon, Richard Kyle ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Advanced data intensive computing algorithms; Constraints; Data mining; Distributed computing; Frequent pattern mining

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; UNCERTAINTY ANALYSIS; WIRELESS SENSOR NETWORKS;

CONSTRAINTS; DATA-INTENSIVE COMPUTING; DISTRIBUTED ENVIRONMENTS; ENVIRONMENTAL SURVEILLANCE; FREQUENT ITEMSET MINING; FREQUENT PATTERN MINING; NETWORK LATENCIES; TREE-BASED MININGS;

DATA MINING;

EID: 84901635064     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2013.10.026     Document Type: Article

References (38)

1. J.J. Cameron, A. Cuzzocrea, F. Jiang, C.K.-S. Leung, Mining frequent itemsets from sparse data streams in limited memory environments, in: Proceedings of the WAIM 2013, Springer, pp. 51-57.
2. E. Çem, and Ö. Özkasap ProFID: practical frequent items discovery in peer-to-peer networks Future Gener. Comput. Syst. 29 6 2013 1544 1560
3. C.K.-S. Leung, C.L. Carmichael, Exploring social networks: a frequent pattern visualization approach, in: Proceedings of the SocialCom 2010, IEEE Computer Society, pp. 419-424.
4. R. Agrawal, T. Imieliński, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD 1993, pp. 207-216.
5. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the VLDB 1994, Morgan Kaufmann, pp. 487-499.
6. J. Han, J. Pei, Y. Yin, and R. Mao Mining frequent patterns without candidate generation: a frequent-pattern tree approach Data Min. Knowl. Discov. 8 1 2004 53 87 (Pubitemid 39019971)
7. J. Ke, Y. Zhan, X. Chen, and M. Wang The retrieval of motion event by associations of temporal frequent pattern growth Future Gener. Comput. Syst. 29 1 2013 442 450
8. C.K.-S. Leung, S.K. Tanbeer, PUF-tree: a compact tree structure for frequent pattern mining of uncertain data, in: Proceedings of the PAKDD 2013, Part I, Springer, pp. 13-25.
9. A. Cuzzocrea, Approximate OLAP query processing over uncertain and imprecise multidimensional data streams, in: Proceedings of the DEXA 2013, Part II, Springer, pp. 156-173.
10. A. Cuzzocrea, Retrieving accurate estimates to OLAP queries over uncertain and imprecise multidimensional data streams, in: Proceedings of the SSDBM 2011, Springer, pp. 575-576.
11. C.K.-S. Leung, B. Hao, Mining of frequent itemsets from streams of uncertain data, in: Proceedings of the IEEE ICDE 2009, pp. 1663-1670.
12. S.R. Sarangi, K. Murthy, DUST: a generalized notion of similarity between uncertain time series, in: Proceedings of the ACM KDD 2010, pp. 383-392.
13. T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, A. Zuefle, Probabilistic frequent itemset mining in uncertain databases, in: Proceedings of the ACM KDD 2009, pp. 119-127.
14. F. Jiang, C.K.-S. Leung, Stream mining of frequent patterns from delayed batches of uncertain data, in: Proceedings of the DaWaK 2013, Springer, pp. 209-221.
15. C.K.-S. Leung, A. Cuzzocrea, and F. Jiang Discovering frequent patterns from uncertain data streams with time-fading and landmark models LNCS Trans. Large Scale Data Knowl. Centered Syst. 8 2013 174 196
16. C.-K. Chui, B. Kao, E. Hung, Mining frequent itemsets from uncertain data, in: Proceedings of the PAKDD 2007, Springer, pp. 47-58.
17. C.K.-S. Leung, M.A.F. Mateo, D.A. Brajczuk, A tree-based approach for frequent pattern mining from uncertain data, in: Proceedings of the PAKDD 2008, Springer, pp. 653-661. (Pubitemid 351776357)
18. G. Grahne, L.V.S. Lakshmanan, X. Wang, Efficient mining of constrained correlated sets, in: Proceedings of the IEEE ICDE 2000, pp. 512-521. (Pubitemid 30585717)
19. C.K.-S. Leung Frequent itemset mining with constraints L. Liu, M.T. Özsu, Encyclopedia of Database Systems 2009 Springer 1179 1183
20. R.T. Ng, L.V.S. Lakshmanan, J. Han, A. Pang, Exploratory mining and pruning optimizations of constrained associations rules, in: Proceedings of the ACM SIGMOD 1998, pp. 13-24. (Pubitemid 128655953)
21. L.V.S. Lakshmanan, C.K.-S. Leung, and R.T. Ng Efficient dynamic mining of constrained frequent sets ACM Trans. Database Syst. 28 4 2003 337 389
22. J. Pei, J. Han, and L.V.S. Lakshmanan Pushing convertible constraints in frequent itemset mining Data Min. Knowl. Discov. 8 3 2004 227 252 (Pubitemid 39019962)
23. A. Cuzzocrea, P. Serafino, LCS-Hist: taming massive high-dimensional data cube compression, in: Proceedings of the EDBT 2009, ACM Press, pp. 768-779.
24. C.K.-S. Leung, Y. Hayduk, Mining frequent patterns from uncertain data with MapReduce for big data analytics, in: Proceedings of the DASFAA 2013, Part I, Springer, pp. 440-455.
25. A. Bonifati, and A. Cuzzocrea Storing and retrieving XPath fragments in structured P2P networks Data Knowl. Eng. 59 2 2006 247 269 (Pubitemid 44321996)
26. A. Faro, D. Giordano, and F. Maiorana Mining massive datasets by an unsupervised parallel clustering on a GRID: novel algorithms and case study Future Gener. Comput. Syst. 27 1 2011 711 724
27. J. Secretan, M. Georgiopoulos, A. Koufakou, and K. Cardona APHID: an architecture for private, high-performance integrated data mining Future Gener. Comput. Syst. 26 7 2010 891 904
28. M.T. Swain, C.G. Silva, N. Loureiro-Ferreira, V. Ostropytskyy, J. Brito, O. Riche, F. Stahl, W. Dubitzky, and R.M.M. Brito P-found: grid-enabling distributed repositories of protein folding and unfolding simulations for data mining Future Gener. Comput. Syst. 26 3 2010 424 433
29. A. Schuster, R. Wolff, and D. Trock A high-performance distributed algorithm for mining association rules Knowl. Inf. Syst. 7 4 2005 458 475 (Pubitemid 41166795)
30. M.J. Zaki Parallel and distributed association mining: a survey IEEE Concurr. 7 4 1999 14 25
31. R. Agrawal, and J. Shafer Parallel mining of association rules IEEE Trans. Knowl. Data Eng. 8 6 1996 962 969 (Pubitemid 126774152)
32. D.W. Cheung, J. Han, V.T. Ng, A.W. Fu, Y. Fu, A fast distributed algorithm for mining association rules, in: Proceedings of the PDIS 1996, IEEE Computer Society, pp. 31-42.
33. M. El-Hajj, O.R. Zaïane, Parallel leap: large-scale maximal pattern mining in a distributed environment, in: Proceedings of the ICPADS 2006, IEEE Computer Society, pp. 135-142.
34. Y. Kozawa, T. Amagasa, H. Kitagawa, GPU acceleration of probabilistic frequent itemset mining from uncertain databases, in: Proceedings of the ACM CIKM 2012, pp. 892-901.
35. A. Cuzzocrea, C.K.-S. Leung, Distributed mining of constrained frequent sets from uncertain data, in: Proceedings of the ICA3PP 2011, Part I, Springer, pp. 40-53.
36. A. Cuzzocrea, C.K.-S. Leung, Frequent itemset mining of distributed uncertain data under user-defined constraints, in: Proceedings of the SEBD 2012, pp. 243-250.
37. C.C. Aggarwal, Y. Li, J. Wang, J. Wang, Frequent pattern mining with uncertain data, in: Proceedings of the ACM KDD 2009, pp. 29-37.
38. C.K.-S. Leung Mining uncertain data WIREs Data Min. Knowl. Discov. 1 4 2011 316 329