Skip to main content

Multi-relational Data Mining in Medical Databases

  • Conference paper
Artificial Intelligence in Medicine (AIME 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2780))

Included in the following conference series:

Abstract

This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepatitis. Our approach may be used on any kind of multirelational database and aims at extracting probabilistic tree patterns from a database using Grammatical Inference techniques. We propose to use a representation of the database by trees in order to extract these patterns. Trees provide a natural way to represent structured information taking into account the statistical distribution of the data. In this work we try to show how they can be useful for interpreting knowledge in the medical domain.

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. Abe, N., Mamitsuka, H.: Predicting protein secondary structure using stochastic tree grammars. Machine Learning 29, 275–301 (1997)

    Article  MATH  Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th Int. Conf. Very Large Data Bases, VLDB, September 12–15, pp. 487–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  3. Amoth, T.R., Cull, P., Tadepalli, P.: On exact learning of unordered tree patterns. Machine Learning 44(3), 211 (2001)

    Article  MATH  Google Scholar 

  4. Arimura, H., Sakamoto, H., Arikawa, S.: Efficient learning of semi-structured data from queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 315–331. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Carrasco, R.C., Oncina, J., Calera, J.: Stochastic Inference of Regular Tree Languages. Machine Learning 44(1/2), 185–197 (2001)

    Article  MATH  Google Scholar 

  6. Cios, K.J., Moore, G.W.: Uniqueness of medical data mining. Artificial Intelligence in Medicine 26, 1–24 (2002)

    Article  Google Scholar 

  7. Crestana-Jensen, V., Soparkar, N.: Frequent itemset counting across multiple tables. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 49–61. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. De Raedt, L.: Data mining in multi-relational databases. In: 4th European Conference on Principles and Practice of Knowledge, (2000) (invited talk)

    Google Scholar 

  9. Dehaspe, L., Toivonen, H.: Discovery of frequent DATALOG patterns. Data Mining and Knowledge Discovery 3(1), 7–36 (1999)

    Article  Google Scholar 

  10. Ganascia, J.: Extraction of recurrent patterns from stratified ordered trees. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol. 2167, pp. 167–178. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. García, P., Oncína, J.: Inference of recognizable tree sets. Research Report DSIC - II/47/93, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia (1993)

    Google Scholar 

  12. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)

    MATH  Google Scholar 

  13. Goldman, S.A., Kwek, S.S.: On learning unions of pattern languages and tree patterns. In: Watanabe, O., Yokomori, T. (eds.) ALT 1999. LNCS (LNAI), vol. 1720, pp. 347–363. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Habrard, A., Bernard, M., Jacquenet, F.: Generalized stochastic tree automata for multi-relational data mining. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 120–133. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Knuutila, T., Steinby, M.: Inference of tree languages from a finite sample: an algebraic approach. Theoretical Computer Science 129, 337–367 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kosala, R., Bussche, J., Bruynooghe, M., Blockeel, H.: Information extraction in structured documents using tree automata induction. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 299–310. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of frequent tag tree patterns in semistructured web documents. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, p. 341. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Zaki, M.: Efficiently mining frequent trees in a forest. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Edmonton,Alberta, Canada (July 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Habrard, A., Bernard, M., Jacquenet, F. (2003). Multi-relational Data Mining in Medical Databases. In: Dojat, M., Keravnou, E.T., Barahona, P. (eds) Artificial Intelligence in Medicine. AIME 2003. Lecture Notes in Computer Science(), vol 2780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39907-0_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39907-0_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20129-8

  • Online ISBN: 978-3-540-39907-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics