Skip to main content

Learning with Concept Hierarchies in Probabilistic Relational Data Mining

  • Conference paper
  • First Online:
Advances in Web-Age Information Management (WAIM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2419))

Included in the following conference series:

  • 325 Accesses

Abstract

Probabilistic relational models (PRMs) extend Bayesian networks to multi-relational domains and represent the dependencies between attributes within a table and across multiple tables. This paper presents a method of integrating and learning with concept hierarchies with PRMs, in order to retrieve richer object and relational information from multi-relational databases. A concept hierarchy defines a partially ordered sequence of mappings from a set of concepts to their higher-level correspondences. Natural concept hierarchies are often associated with some attributes in databases and can be used to discover knowledge. We first introduce concept hierarchies to PRMs by using background knowledge. A score-based search algorithm is then investigated for learning with concept hierarchies in PRMs parameter estimation procedure. The method can learn the most appropriate concepts from the data and use them to update the parameters. Experimental results on both real and synthetic data are discussed.

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

  1. Learning Statistical Models from Relational Data. URL: http://robotics.stanford.edu/srl/ (2000)

  2. Elmasri, R., Navathe, S.B.: Fundamantals of Databases Systems. 3rd edn. Addison Wesley, Reading, Massachusetts (2000)

    Google Scholar 

  3. Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning Probabilistic Relational Models. In: Proc. IJCAI-99, Stockholm. Morgan Kaufmann (1999) 1300–1307

    Google Scholar 

  4. Getoor, L., Taskar, B., Koller, D.: Selectivity Estimation Using Probabilistic Models. In: Proc. ACM SIGMOD, Santa Barbara, California (2001) 21–24

    Google Scholar 

  5. Han, J., Fu, Y.: Attribute-Oriented Induction in Data Mining. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy R. (eds.): Advances in Kowledge Discovery and Data Mining, Chapter 16. AAAI Press / The MIT Press, Massachusetts (1996) 399–424

    Google Scholar 

  6. Koller, D., Pfeffer, A.: Object-Oriented Bayesian Networks. In: Proc. UAI-97, Providence, Rhode Island (1997) 302–313

    Google Scholar 

  7. Mannila, H.: Foreword to the Book. In: Dzeroski, S., Lavra, N. (eds.): Relational Data Mining. Springer, Berlin (2001)

    Google Scholar 

  8. McClean, S., Scotney, B., Shapcott, M.: Aggregation of Imprecise and Uncertain Information in Databases. IEEE Transactions on Knowledge and Data Engineering. Vol. 13(6) (2001) 902–912

    Article  Google Scholar 

  9. Shapcott, M., McClean, S., Scotney, B.: Using Background Knowledge with Attribute-Oriented Data Mining. In: Bramer, M.A. (eds.): Kowledge Discovery and Data Mining, IEE Professional Applications of Computing Series 1, Chapter 4. London (1999) 64–84

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Shapcott, M., McClean, S., Adamson, K. (2002). Learning with Concept Hierarchies in Probabilistic Relational Data Mining. In: Meng, X., Su, J., Wang, Y. (eds) Advances in Web-Age Information Management. WAIM 2002. Lecture Notes in Computer Science, vol 2419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45703-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45703-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44045-1

  • Online ISBN: 978-3-540-45703-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics