Probabilistic frequent pattern growth for itemset mining in uncertain databases

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

Volumn 7338 LNCS, Issue , 2012, Pages 38-55

  Bernecker, Thomas ^a   Kriegel, Hans Peter ^a   Renz, Matthias ^a   Verhein, Florian ^a   Züfle, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE GENERATION; EXPERIMENTAL SECTION; FP TREE; FP-GROWTH ALGORITHM; FREQUENT ITEMSET MINING; FREQUENT PATTERN GROWTH; GENERATING FUNCTIONS; ITEM SETS; ITEMSET; ITEMSET MINING; LINEAR TIME; POSSIBLE WORLD SEMANTICS; STATE-OF-THE-ART ALGORITHMS; TRADITIONAL TECHNIQUES; TRANSACTION DATABASE; UNCERTAIN DATABASE;

ALGORITHMS; COMBINATORIAL CIRCUITS; FORESTRY; PROBABILITY DISTRIBUTIONS; SEMANTICS; TREES (MATHEMATICS);

DATABASE SYSTEMS;

ALGORITHMS; DATA BASES; ELECTRIC CIRCUITS; FORESTRY; PROBABILITY;

EID: 84863468033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31235-9_3     Document Type: Conference Paper

References (22)

1. Aggarwal, C.C., Li, Y.,Wang, J.,Wang, J.: Frequent pattern mining with uncertain data. In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France (2009)
2. Agrawal, P., Benjelloun, O., Sarma, A.D., Hayworth, C., Nabar, S., Sugihara, T., Widom, J.: Trio: A system for data, uncertainty, and lineage. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), Seoul, Korea (2006)
3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN (1994)
4. Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and simple relational processing of uncertain data. In: Proceedings of the 24th International Conference on Data Engineering (ICDE), Cancun, Mexico (2008)
5. Benjelloun, O., Sarma, A.D., Halevy, A., Widom, J.: ULDBs: Databases with uncertainty and lineage. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), Seoul, Korea, pp. 1249-1264 (2006)
6. Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Züfle, A.: Probabilistic frequent itemset mining in uncertain databases. In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, pp. 119-128 (2009)
7. Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Züfle, A.: Probabilistic frequent pattern growth for itemset mining in uncertain databases (technical report). Computing Research Repository, abs/1008.2 (2010)
8. Chui, C.-K., Kao, B.: A Decremental Approach for Mining Frequent Itemsets from Uncertain Data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 64-75. Springer, Heidelberg (2008)
9. 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)
10. Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. The VLDB Journal 16(4), 523-544 (2007)
11. Geurts, K., Wets, G., Brijs, T., Vanhoof, K.: Profiling high frequency accident locations using association rules. In: Proceedings of the 82nd Annual Transportation Research Board, Washington, DC, USA, January 12-16, p. 18 (2003)
12. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMOD Rec. 29(2), 1-12 (2000)
13. Leung, M.M.K., Brajczuk, D.: A Tree-Based Approach for Frequent PatternMining 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. Kriegel, H.-P., Kunath, P., Pfeifle, M., Renz, M.: Probabilistic Similarity Join on Uncertain Data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 295-309. Springer, Heidelberg (2006) (Pubitemid 43978648)
15. Leung, C.K.-S., Carmichael, C.L., Hao, B.: Efficient mining of frequent patterns from uncertain data. In: ICDMW 2007: Proceedings of the Seventh IEEE International Conference on Data Mining Workshops, pp. 489-494 (2007)
16. Li, J., Saha, B., Deshpande, A.: A unified approach to ranking in probabilistic databases. Proceedings of the VLDB Endowment 2(1), 502-513 (2009)
17. Ré, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probalistic databases. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey (2007)
18. Sen, R., Deshpande, A.: Representing and querying correlated tuples in probabilistic databases. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey (2007)
19. Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey, pp. 896-905 (2007)
20. Xia, Y., Yang, Y., Chi, Y.: Mining association rules with non-uniform privacy concerns. In: DMKD 2004: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 27-34 (2004)
21. Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient processing of top-k queries in uncertain databases. In: Proceedings of the 24th International Conference on Data Engineering (ICDE), Cancun, Mexico (2008)
22. Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Vancouver, BC, pp. 819-832 (2008)