Abstract
In recent years, many new applications, such as location-based services, sensor monitoring systems, and data integration, have shown a growing amount of importance of uncertain data mining. In addition, due to instrument errors, imprecise of sensor monitoring systems, and so on, real-world data tend to be numerical data with inherent uncertainty. Thus, mining association rules from an uncertain, especially probabilistic numerical dataset has been studied recently. However, a probabilistic numerical dataset often grows as new data append. Thus, developing a mining algorithm that can incrementally maintain discovered information is quite important. In this paper, we have designed an efficient, incremental mining algorithm to mine association rules from a probabilistic numeric dataset using estimated-frequent uncertain-itemsets. By using a user-specified support threshold, estimated-frequent uncertain-itemsets could act as a gap to avoid small itemsets becoming large in the updated dataset when new transactions are inserted. As a result, the algorithm has execution time faster than that of previous methods. An illustrated example is given to demonstrate the procedures of the algorithm.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th Conference on VLDB, Santiago, Chile, pp. 487–499 (1994)
Aggarwal, C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: KDD (2009)
Chui, C.K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: PAKDD (2007)
Zhang, Q., Li, F., Yi, K.: Finding frequent items inprobabilistic data. In: SIGMOD (2008)
Sun, L., Cheng, R., Cheung, D.W., Cheng, J.: Mining uncertain data with probabilistic guarantees. In: KDD (2010)
Carvalho, J.V., Ruiz, D.D.: Discovering frequent itemsets on uncertain data: a systematic review. In: Perner, P. (ed.) MLDM 2013. LNCS (LNAI), vol. 7988, pp. 390–404. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39712-7_30
Wang, Y., Li, X., Li, X., et al.: A survey of queries over uncertain data. Knowl. Inf. Syst. 37(3), 485–530 (2013)
Aggarwal, C.C., Philip, S.Y.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609–623 (2009)
Pei, B., Zhao, S., Chen, H., et al.: FARP: mining fuzzy association rules from a probabilistic quantitative database. Inf. Sci. 237, 242–260 (2013)
Tsai, P.S.M., Lee, C.-C., Chen, A.L.P.: An efficient approach for incremental association rule mining. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 74–83. Springer, Heidelberg (1999). doi:10.1007/3-540-48912-6_10
Acknowledgement
This research is supported by Anhui Provincial Natural Science Foundation (1408085MF117).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Pei, B., Wang, F., Wang, X. (2017). Mining Association Rules from a Dynamic Probabilistic Numerical Dataset Using Estimated-Frequent Uncertain-Itemsets. In: Qiu, M. (eds) Smart Computing and Communication. SmartCom 2016. Lecture Notes in Computer Science(), vol 10135. Springer, Cham. https://doi.org/10.1007/978-3-319-52015-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-52015-5_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-52014-8
Online ISBN: 978-3-319-52015-5
eBook Packages: Computer ScienceComputer Science (R0)