Abstract
In recent years there has been a growing interest in Bayesian Network learning from uncertain data. While many researchers focus on Bayesian Network learning from data with tuple uncertainty, Bayesian Network structure learning from data with attribute uncertainty gets little attention. In this paper we make a clear definition of attribute uncertain data and Bayesian Network Learning problem from such data. We propose a structure learning method named DTAU based on information theory. The algorithm assumes that the structure of a Bayesian network is a tree. It avoids enumerating all possible worlds. The dependency tree is computed with polynomial time complexity. We conduct experiments to demonstrate the effectiveness and efficiency of our method. The experiments show the clustering results on uncertain dataset by our dependency tree are acceptable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dalvi, N., Suciu, D.: Effcient query evaluation on probabilistic databases. The VLDB Journal 16(4), 523–544 (2007)
Bernecker, T., Kriegel, H.P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent item set mining in uncertain databases. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 119–128. ACM Press, Paris (2009)
Singh, S., Mayfield, C., Shah, R., Prabhakar, S., Hambrusch, S., Neville, J., Cheng, R.: Database support for probabilistic attributes and tuples. In: 24th IEEE ICDE International Conference on Data Engineering, pp. 1053–1061. IEEE Press, Cancún (2008)
Lee, S.D., Kao, B., Cheng, R.: Reducing UK-means to K-means. In: 7th IEEE ICDM Workshops International Conference on Data Mining Workshops, pp. 483–488. IEEE Press, Omaha (2008)
Gullo, F., Ponti, G., Tagarelli, A., Greco, S.: A Hierarchical Algorithm for Clustering Uncertain Data via an Information-Theoretic Approach. In: 8th IEEE ICDM International Conference on Data Mining, pp. 1053–1061. IEEE Press, Pisa (2008)
Günnemann, S., Kremer, H., Seidl, T.: Subspace Clustering for Uncertain Data. In: SIAM SDM SIAM Conference on Data Mining, pp. 385–396. SIAM Press, Ohio (2010)
He, J., Zhang, Y., Li, X., Wang, Y.: Naive Bayes classifier for positive unlabeled learning with uncertainty. In: SIAM SDM SIAM Conference on Data Mining, pp. 361–372. SIAM Press, Ohio (2010)
Ren, J., Lee, S.D., Chen, X., Kao, B., Cheng, R., Cheung, D.: Naive bayes classification of uncertain data. In: 9th IEEE ICDM International Conference on Data Mining, pp. 944–949. IEEE Press, Miami (2009)
Dalvi, N., Suciu, D.: Learning Bayesian networks is NP-complete. Lecture Notes In Statistics, pp. 121–130. Springer, New York (1996)
Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory Journal 14(3), 462–467 (1968)
Heckerman, D., et al.: A tutorial on learning with Bayesian networks. In: Learning in Graphical Models, Michael I. Jordan, Massachusetts (1999)
Friedman, N., Nachman, I., Peér, D.: Learning Bayesian Network Structure from Massive Datasets: The “Sparse Candidate” Algorithm. In: UAI 14th Conference on Uncertainty in Artificial Intelligence, Madison, pp. 206–215 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, W., Yu, J.X., Cheng, H., Liu, H., He, J., Du, X. (2012). Bayesian Network Structure Learning from Attribute Uncertain Data. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds) Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32281-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-32281-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32280-8
Online ISBN: 978-3-642-32281-5
eBook Packages: Computer ScienceComputer Science (R0)