Vol. 2024 No. 5 (2024)
Articles

Data mining on uncertain data based on frequent probability

PDF
  • Hyun-jun Son,
  • Jae-hoon Yoo
Hyun-jun Son
Sungkyunkwan University Press,25-2 Sungkyunkwan-ro, Myeongnyun 3(sam)ga, Jongno-gu, Seoul,03063, Korea
Jae-hoon Yoo
Sungkyunkwan University Press,25-2 Sungkyunkwan-ro, Myeongnyun 3(sam)ga, Jongno-gu, Seoul,03063, Korea

Published 12-11-2024

Keywords

  • Frequent Probability,
  • Possible Worlds,
  • Probabilistic Frequent Itemsets

Copyright (c) 2024 Cambridge Science Advance

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite

[1]
H.- jun Son and J.- hoon Yoo, “Data mining on uncertain data based on frequent probability”, Camb. Sci. Adv., vol. 2024, no. 5, pp. 1–4, Nov. 2024, doi: 10.62852/csa/2024/91.

Abstract

Uncertain data exists in many applications, such as sensor monitoring systems, location-based services, and biological databases. To handle a large amount of uncertain information, probabilistic databases have been proposed. The main research involves interpreting probabilistic databases using possible world semantics and discovering frequent patterns within probabilistic databases. Since the possible worlds in probabilistic databases grow exponentially, this mining process is a technical challenge.

PDF

References

  1. R. Agrawal, R. Srikant. Fast algorithms for mining association rules [C].20th International Conference on Very Large Data Bases (VLDB). Santiago: Morgan Kaufmann Publishers, 1994: 487-499.
  2. Leung C K S, Carmichael C L, Hao B. Effcient mining of frequent pattens from uncertain data[C]. Proc IEEE ICDM Workshops, 2007:489-494. DOI: https://doi.org/10.1109/ICDMW.2007.84
  3. C. Chui, B. Kao, E. Hung. Mining frequent itemsets from uncertain data[C]. m The Pacifie-Asia Conference on Knowledge Discovery and Data Mining (PAKDD). Berlin Heidelberg: Springer- verlag,2007:47-58. DOI: https://doi.org/10.1007/978-3-540-71701-0_8
  4. Chui C K, Kao B. A decremental approach for mining frequent itemsets from uncertain data[C]. L NAI 5012: The Pacific-Asia Confer ence on Knowledge Discovery and Data Mining (PAKDD), 2008:64-75. DOI: https://doi.org/10.1007/978-3-540-68125-0_8
  5. Y. Tong, L. Chen, B. Ding. Discovering threshold-based frequent closed itemsets over probabilistic data[C]. I EEE 28th International Conference on Data engineering,2012:270-281. DOI: https://doi.org/10.1109/ICDE.2012.51
  6. Leung C KS, Mateo MAF, Brajczuk D A. A tree-based approach for frequent t pattern mining from uncertain data[C]. L NAI 5012: The Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD),2008:653-661. DOI: https://doi.org/10.1007/978-3-540-68125-0_61
  7. C. Aggarwal, P. Yu. A survey of uncertain data algorithms and applications [J]. I EEE Transactions on Knowledge and Data Engineering,2009,21(5):609-623. DOI: https://doi.org/10.1109/TKDE.2008.190