Skip to main content

Bayesian Network Structure Learning from Attribute Uncertain Data

  • Conference paper
Web-Age Information Management (WAIM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7418))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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)

    Article  Google Scholar 

  • 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)

    Chapter  Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Chapter  Google Scholar 

  • Dalvi, N., Suciu, D.: Learning Bayesian networks is NP-complete. Lecture Notes In Statistics, pp. 121–130. Springer, New York (1996)

    Google Scholar 

  • Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory Journal 14(3), 462–467 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  • Heckerman, D., et al.: A tutorial on learning with Bayesian networks. In: Learning in Graphical Models, Michael I. Jordan, Massachusetts (1999)

    Google Scholar 

  • 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics