Abstract
Frequent pattern mining aims to discover implicit, previously unknown and potentially useful knowledge—in the form of frequently occurring sets of items—that are embedded in data. Many of the models and algorithms developed in the early days mine frequent patterns from traditional transaction databases of precise data such as shopper market basket data, in which the contents of databases are known. However, we are living in an uncertain world, in which uncertain data can be found in various real-life applications. Hence, in recent years, researchers have paid more attention to frequent pattern mining from probabilistic datasets of uncertain data. This chapter covers key models, algorithms and topics about uncertain frequent pattern mining.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abiteboul, S., Kanellakis, P., & Grahne, G. 1987. On the representation and querying of sets of possible worlds. In Proceedings of the ACM SIGMOD 1987, pages 34–48.
Aggarwal, C.C. 2009. On clustering algorithms for uncertain data. In C.C. Aggarwal (ed.), Managing and Mining Uncertain Data, pages 389–406. Springer.
Aggarwal, C.C. (ed.) 2009. Managing and Mining Uncertain Data. Springer.
Aggarwal, C.C. (ed.) 2011. Social Network Data Analytics. Springer.
Aggarwal, C.C. 2013. Outlier Analysis. Springer.
Aggarwal, C.C. (ed.) 2013. Managing and Mining Sensor Data. Springer.
Aggarwal, C.C. & Reddy, C.K. (eds.), Data Clustering: Algorithms and Applications. CRC Press.
Agrawal, R., & Srikant, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the VLDB 1994, pages 487–499. Morgan Kaufmann.
Aggarwal, C.C., & Yu, P.S. 2008. Outlier detection with uncertain data. In Proceedings of the SIAM SDM 2008, pages 483–493.
Aggarwal, C.C., & Yu, P.S. (eds.) 2008. Privacy-Preserving Data Mining: Models and Algorithms. Springer.
Aggarwal, C.C., & Yu, P.S. 2009. A survey of uncertain data algorithms and applications. IEEE Transactions on Knowledge and Data Engineering (TKDE), 21(5), pages 609–623.
Agrawal, R., Imieliński, T., & Swami, A. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD 1993, pages 207–216.
Aggarwal, C.C., Li, Y., Wang, J., & Wang, J. 2009. Frequent pattern mining with uncertain data. In Proceedings of the ACM KDD 2009, pages 29–38.
Akbarinia, R., & Masseglia, F. 2012. FMU: fast mining of probabilistic frequent itemsets in uncertain data streams. In Proceedings of the BDA 2012.
Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., & Zuefle, A. 2009. Probabilistic frequent itemset mining in uncertain databases. In Proceedings of the ACM KDD 2009, pages 119–127.
Budhia, B.P., Cuzzocrea, A., & Leung, C.K.-S. 2012. Vertical frequent pattern mining from uncertain data. In Proceedings of the KES 2012, pages 1273–1282. IOS Press.
Calders, T.,Garboni, C., & Goethals, B. 2010. Efficient pattern mining of uncertain data with sampling. In Proceedings of the PAKDD 2010, Part I, pages 480–487. Springer.
Chui, C.-K., & Kao, B. 2008. A decremental approach for mining frequent itemsets from uncertain data. In Proceedings of the PAKDD 2008, pages 64–75. Springer.
Chui, C.-K., Kao, B., & Hung, E. 2007. Mining frequent itemsets from uncertain data. In Proceedings of the PAKDD 2007, pages 47–58. Springer.
Cuzzocrea, A., Leung, C.K.-S., & MacKinnon, R.K. 2014. Mining constrained frequent itemsets from distributed uncertain data. Future Generation Computer Systems. Elsevier.
Dalvi, N., & Suciu, D. 2004. Efficient query evaluation on probabilistic databases. In Proceedings of the VLDB 2004, pages 864–875. Morgan Kaufmann.
Gaber, M.M., Zaslavsky, A.B., & Krishnaswamy, S. Mining data streams: a review. ACM SIGMOD Record, 34(2), pages 18–26.
Green, T., & Tannen, V. 2006. Models for incomplete and probabilistic information. Bulletin of the Technical Committee on Data Engineering, 29(1), pages 17–24. IEEE Computer Society.
Han, J., Pei, J., & Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD 2000, pages 1–12.
Jiang, B., Pei, J., Tao, Y., & Lin, X. 2013. Clustering uncertain data based on probability distribution similarity. IEEE Transactions on Knowledge and Data Engineering (TKDE), 25(4), pages 751–763.
Jiang, F., & Leung, C.K.-S. 2013. Stream mining of frequent patterns from delayed batches of uncertain data. In Proceedings of the DaWaK 2013, pages 209–221. Springer.
Lakshmanan, L.V.S., Leung, C.K.-S., & Ng, R.T. 2003. Efficient dynamic mining of constrained frequent sets. ACM Transactions on Database Systems (TODS), 28(4), pages 337–389.
Lee, W., Leung, C.K.-S., Song, J.J., & Eom, C.S.-H. 2012. A network-flow based influence propagation model for social networks. In Proceedings of the CGC/SCA 2012, pages 601–608. IEEE Computer Society (The best paper of SCA 2012).
Leung, C.K.-S. 2009. Convertible constraints. In Encyclopedia of Database Systems, pages 494–495. Springer.
Leung, C.K.-S. 2009. Frequent itemset mining with constraints. In Encyclopedia of Database Systems, pages 1179–1183. Springer.
Leung, C.K.-S. 2009. Succinct constraints. In Encyclopedia of Database Systems, page 2876. Springer.
Leung, C.K.-S. 2011. Mining uncertain data. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery (WIDM), 1(4), pages 316–329.
Leung, C.K.-S., & Brajczuk, D.A. 2009. Efficient algorithms for the mining of constrained frequent patterns from uncertain data. ACM SIGKDD Explorations, 11(2), pages 123–130.
Leung, C.K.-S., & Brajczuk, D.A. 2009. Mining uncertain data for constrained frequent sets. In Proceedings of the IDEAS 2009, pages 109–120. ACM.
Leung, C.K.-S., & Brajczuk, D.A. 2010. uCFS2: an enhanced system that mines uncertain data for constrained frequent sets. In Proceedings of the IDEAS 2010, pages 32–37. ACM.
Leung, C.K.-S., & Hao, B. 2009. Mining of frequent itemsets from streams of uncertain data. In Proceedings of the IEEE ICDE 2009, pages 1663–1670.
Leung, C.K.-S., & Hayduk, Y. 2013. Mining frequent patterns from uncertain data with MapReduce for Big Data analytics. In Proceedings of the DASFAA 2013, Part I, pages 440–455. Springer.
Leung, C.K.-S., & Jiang, F. 2011. Frequent pattern mining from time-fading streams of uncertain data. In Proceedings of the DaWaK 2011, pages 252–264. Springer.
Leung, C.K.-S., & Tanbeer, S.K. 2012. Fast tree-based mining of frequent itemsets from uncertain data. In Proceedings of the DASFAA 2012, Part I, pages 272–287. Springer.
Leung, C.K.-S., & Tanbeer, S.K. 2013. PUF-tree: a compact tree structure for frequent pattern mining of uncertain data. In Proceedings of the PAKDD 2013, Part I, pages 13–25. Springer.
Leung, C.K.-S., Cuzzocrea, A., & Jiang, F. 2013. Discovering frequent patterns from uncertain data streams with time-fading and landmark models. LNCS Transactions on Large-Scale Data- and Knowledge-Centered Systems (TLDKS) VIII, pages 174–196. Springer.
Leung, C.K.-S., Mateo, M.A.F., & Brajczuk, D.A. 2008. A tree-based approach for frequent pattern mining from uncertain data. In Proceedings of the PAKDD 2008, 653–661. Springer.
Leung, C.K.-S., Hao, B., & Brajczuk, D.A. 2010. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proceedings of the ACM SAC 2010, pages 1034–1038.
Leung, C.K.-S., Tanbeer, S.K., Budhia, B.P., & Zacharias, L.C. 2012. Mining probabilistic datasets vertically. In Proceedings of the IDEAS 2012, pages 199–204. ACM.
Madden, S. 2012. From databases to big data. IEEE Internet Computing, 16(3), pages 4–6.
Nadungodage, C.H., Xia, Y., Lee, J.J., & Tu, Y. 2013. Hyper-structure mining of frequent patterns in uncertain data streams. In Knowledge and Information Systems (KAIS), 37(1), pages 219–244. Springer.
Ren, J., Lee, S.D., Chen, X., Kao, B., Cheng, R., & Cheung, D. 2009. Naive Bayes classification of uncertain data. In Proceedings of the IEEE ICDM 2009, pages 944–949.
Suciu, D. 2009. Probabilistic databases. In Encyclopedia of Database Systems, pages 2150–2155. Springer.
Sun, L., Cheng, R., Cheung, D.W., & Cheng, J. 2010. Mining uncertain data with probabilistic guarantees. In Proceedings of the ACM KDD 2010, pages 273–282.
Tong, Y., Chen, L., Cheng, Y., & Yu, P.S. 2012. Mining frequent itemsets over uncertain databases. In Proceedings of the VLDB Endowment (PVLDB), 5(11), pages 1650–1661.
Wang, L., Cheng, R., Lee, S.D., & Cheung, D.W. 2010. Accelerating probabilistic frequent itemset mining: a model-based approach. In Proceedings of the ACM CIKM 2010, pages 429–438.
Wasserkrug, S. 2009. Uncertainty in events. In Encyclopedia of Database Systems, pages 3221–3225. Springer.
Xu, L., & Hung, E. 2012. Improving classification accuracy on uncertain data by considering multiple subclasses. In Proceedings of the Australasian AI 2012, pages 743–754. Springer.
Zaki, M.J. 1999. Parallel and distributed association mining: a survey. IEEE Concurrency, 7(4), pages 14–25.
Zaki, M.J., Parthasarathy, S., Ogihara, M., & Li, W. 1997. New algorithms for fast discovery of association rules. In Proceedings of the ACM KDD 1997, pages 283–286.
Zhang, Q., Li, F., & Yi, K. 2008. Finding frequent items in probabilistic data. In Proceedings of the ACM SIGMOD 2008, pages 819–832.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Leung, CS. (2014). Uncertain Frequent Pattern Mining. In: Aggarwal, C., Han, J. (eds) Frequent Pattern Mining. Springer, Cham. https://doi.org/10.1007/978-3-319-07821-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-07821-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07820-5
Online ISBN: 978-3-319-07821-2
eBook Packages: Computer ScienceComputer Science (R0)