Discovering threshold-based frequent closed itemsets over probabilistic data

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 270-281

  Tong, Yongxin ^a   Chen, Lei ^a   Ding, Bolin ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION MANAGEMENT; SENSOR NETWORKS;

BOUNDING TECHNIQUES; DEPTH FIRST SEARCH; DOWNWARD CLOSURE PROPERTIES; EXPONENTIAL NUMBERS; FREQUENT CLOSED ITEMSETS; ITEM SETS; MINING ALGORITHMS; MOVING OBJECTS; NETWORK MONITORING; NEW APPLICATIONS; PROBABILISTIC DATA; PROBABILISTIC DATABASE; REDUNDANT COMPUTATION; SEARCH SPACES; SET MINING;

DATA MINING;

EID: 84864210741     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.51     Document Type: Conference Paper

References (35)

1. C. Aggarwal, Y. Li, J. Wang, J. Wang, "Frequent pattern mining with uncertain data," in KDD, 2009.
2. R. Agrawal, T. Imielinski, A. N. Swami, "Mining association rules between sets of items in large databases," in SIGMOD, 1993.
3. R. Agrawal, R. Srikant, "Fast algorithms for mining association rules," in VLDB, 1994.
4. T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, A. Zuefle, "Probabilistic frequent itemset mining in uncertain databases," in KDD, 2009.
5. C. Böhm, A. Pryakhin, M. Schubert, "The Gauss-tree: efficient object identification in databases of probabilistic feature vectors," in ICDE, 2006.
6. D. de Caen, "A lower bound on the probability of a union," Discrete Math., 169: 217-220, 1997.
7. T. Calders, C. Garboni, B. Goethals, "Efficient pattern mining of uncertain data with sampling," in PAKDD, 2010.
8. L. Chen, M. T. Özsu, V. Oria, "Robust and fast similarity search for moving object trajectories," in SIGMOD, 2005.
9. C. Chui, B. Kao, E. Hung, "Mining frequent itemsets from uncertain data," in PAKDD, 2007.
10. C. Chui, B. Kao, "A decremental approach for mining frequent itemsets from uncertain data," in PAKDD, 2008.
11. B. Ding, D. Lo, J, Han, S. C. Khoo, "Efficient mining of closed repetitive gapped subsequences from a sequence database," in ICDE, 2009.
12. G. Grahne and J. Zhu, "Fast algorithms for frequent itemset mining using fp-trees," IEEE Trans. on Know. and Data Eng., 17(10): 1347-1362, 2005.
13. J. Han, J. Pei, Y. Yin, "Mining frequent patterns without candidate generation," in SIGMOD, 2000.
14. R.M. Karp, M. Luby, "Monte-Carlo algorithms for enumeration and reliability problems," in FOCS, 1983.
15. C. Leung, M. F. Mateo, D. A. Brajczuk, "A tree-based approach for frequent pattern mining from uncertain data," in PAKDD, 2008.
16. M. Li, Y. Liu, "Underground coal mine monitoring with wireless sensor networks," ACM Trans. on Sensor Networks, 5(2): 10-29, 2009.
17. L. Mo, Y. He, Y. Liu, J. Zhao, S. Tang, X. Li, G. Dai, "Canopy closure estimates with GreenOrbs: sustainable sensing in the forest," in SenSys, 2009.
18. N. Pasquier, Y. Bastide, Taouil R, Lakhal, "Discovering frequent closed itemsets for association rules," in ICDT, 1999.
19. J. Pei, J. Han, R. Mao, "CLOSET: An efficient algorithm for mining frequent closed itemsets," in DMKD, 2000.
20. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang, "H-Mine: Hyperstructure mining of frequent patterns in large databases," in ICDM, 2001.
21. Y.S. Sathe, M. Pradhan, S.P. Shah, "Inequalities for the probability of the occurrence of at least m out of n events," J. Appl. Probab., 17: 1127-1132, 1980.
22. L. Sun, R. Cheng, D.W. Cheung, J. Cheng, "Mining uncertain data with probabilistic guarantees," in KDD, 2010.
23. L. Wang, R. Cheng, S. Lee, D. Cheung, "Accelerating probabilistic frequent itemset mining: a model-based approach," in CIKM, 2010.
24. J. Wang, J. Han, J. Pei, "CLOSET+: Searching for the best strategies for mining frequent closed itemsets," in KDD, 2003.
25. J. Wang, J. Han, "BIDE: Efficient mining of frequent closed sequences," in ICDE, 2004.
26. X. Yan, J. Han, "CloseGraph: mining frequent closed graph patterns," In KDD, 2003.
27. X. Yan, J. Han, R. Afhar, "CloSpan: Mining closed sequential patterns in large datasets," in SDM, 2003.
28. M. J. Zaki, "Scalable algorithms for association mining," IEEE Trans. on Know. and Data Eng., 42(1/2): 31-60, 2001.
29. M. J. Zaki, C-J. Hsiao, "Efficient algorithms for mining closed itemsets and their lattice structure," IEEE Trans. on Know. and Data Eng., 17(4): 462-478, 2005.
30. Q. Zhang, F. Li, K. Yi, "Finding frequent items in probabilistic data," in SIGMOD, 2008.
31. Z. Zou, J. Li, H. Gao, S. Zhang, "Mining frequent subgraph patterns from uncertain graph data," IEEE Trans. on Know. and Data Eng., 22(9): 1203-1218, 2010.
32. Z. Zou, J. Li, H. Gao, "Discovering probabilistic frequent subgraphs over uncertain graph databases," in KDD, 2010.
33. L. Valiant, "The complexity of enumeration and reliability problems," SIAM Journal on Computing, 8(3): 410-421, 1979.
34. P. Tang, E. A. Peterson, "Mining probabilistic frequent closed itemsets in uncertain databases," in ACM Southeast Conference, 2011.
35. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, 58 (301): 13-30, 1963.