Fast tree-based mining of frequent itemsets from uncertain data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7238 LNCS, Issue PART 1, 2012, Pages 272-287

  Leung, Carson Kai Sang ^a   Tanbeer, Syed K ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Data mining; frequent patterns; probabilistic databases; tree based mining; uncertain data

Indexed keywords

COMPACT TREE; FAST ALGORITHMS; FREQUENT PATTERNS; ITEM SETS; MINING FREQUENT ITEMSETS; PROBABILISTIC DATABASE; TREE STRUCTURES; TREE-BASED; TREE-BASED ALGORITHMS; UNCERTAIN DATAS;

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; FORESTRY;

TREES (MATHEMATICS);

ALGORITHMS; DATA PROCESSING; FORESTRY; MATHEMATICS; TREES;

EID: 84860697181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29038-1_21     Document Type: Conference Paper

References (16)

1. Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: ACM KDD 2009, pp. 29-37 (2009)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487-499 (1994)
3. Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent itemset mining in uncertain databases. In: ACM KDD 2009, pp. 119-127 (2009)
4. Calders, T., Garboni, C., Goethals, B.: Approximation of frequentness probability of itemsets in uncertain data. In: IEEE ICDM 2010, pp. 749-754 (2010)
5. Calders, T., Garboni, C., Goethals, B.: Efficient Pattern Mining of Uncertain Data with Sampling. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS (LNAI), vol. 6118, pp. 480-487. Springer, Heidelberg (2010)
6. Chui, C.-K., Kao, B., Hung, E.: Mining Frequent Itemsets from Uncertain Data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47-58. Springer, Heidelberg (2007)
7. Eavis, T., Zheng, X.: Multi-Level Frequent Pattern Mining. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 369-383. Springer, Heidelberg (2009)
8. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1-12 (2000)
9. Kiran, R.U., Reddy, P.K.: An Alternative Interestingness Measure for Mining Periodic-Frequent Patterns. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 183-192. Springer, Heidelberg (2011)
10. Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS 28(4), 337-389 (2003)
11. Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: IEEE ICDE 2009, pp. 1663-1670 (2009)
12. Leung, C.K.-S., Jiang, F.: Frequent Pattern Mining from Time-Fading Streams of Uncertain Data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252-264. Springer, Heidelberg (2011)
13. Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A Tree-Based approach for Frequent Pattern Mining from Uncertain Data. In:Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653-661. Springer, Heidelberg (2008)
14. Lin, C.-W., Hong, T.-P., Lu, W.-H.: A new tree structure for mining frequent itemsets from uncertain databases. In: Nat'l Conf. on Fuzzy Theory and its App., pp. 575-579 (2009)
15. Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: hyper-structure mining of frequent patterns in large databases. In: IEEE ICDM 2001, pp. 441-448 (2001)
16. Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: ACM SIGMOD 2008, pp. 819-832 (2008)