Skip to main content

Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering

  • Conference paper

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

Abstract

We propose a new genetic programming approach to extraction of multiple tree structured patterns from tree-structured data using clustering. As a combined pattern we use a set of tree structured patterns, called tag tree patterns. A structured variable in a tag tree pattern can be substituted by an arbitrary tree. A set of tag tree patterns matches a tree, if at least one of the set of patterns matches the tree. By clustering positive data and running GP subprocesses on each cluster with negative data, we make a combined pattern which consists of best individuals in GP subprocesses. The experiments on some glycan data show that our proposed method has a higher support of about 0.8 while the previous method for evolving single patterns has a lower support of about 0.5.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arimura, H., Shinohara, T., Otsuki, S.: Polynomial time algorithm for finding finite unions of tree pattern languages. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds.) NIL 1991. LNCS(LNAI), vol. 659, pp. 118–131. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  2. Doubet, S., Albersheim, P.: Clycobiology. Data Mining and Knowledge Discovery 2(6), 505 (1992)

    Google Scholar 

  3. Yao, X. (ed.): Evolutionary Computation: Theory and Applications. World Scientific, Singapore (1999)

    Google Scholar 

  4. Folino, G., Pizzuti, C., Spezzano, G.: Ensemble techniques for parallel genetic programming based classifiers. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS(LNAI), vol. 2610, pp. 59–69. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Hashimoto, K., Goto, S., Kawano, S., Aoki-Kinoshita, K.F., Ueda, N., Hamajima, M., Kawasaki, T., Kanehisa, M.: KEGG as a glycome informatics resource. Glycobiology 16, 63R–70R (2006)

    Article  Google Scholar 

  6. Hizukuri, Y., Yamanishi, Y., Nakamura, O., Yagi, F., Goto, S., Kanehisa, M.: Extraction of leukemia specific glycan motifs in humans by computational glycomics. Carbohydrate Research 340, 2270–2278 (2005)

    Article  Google Scholar 

  7. Inata, K., Miyahara, T., Ueda, H., Takahashi, K.: Evolution of characteristic tree structured patterns from semistructured documents. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 1201–1207. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Kuboyama, T., Hirata, K., Aoki-Kinoshita, K.F., Kashima, H., Yasuda, H.: A gram distribution kernel applied to glycan classification and motifextraction. Genome Informatics 17(2), 25–34 (2006)

    Google Scholar 

  9. 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, pp. 341–355. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Nagamine, M., Miyahara, T., Kuboyama, T., Ueda, H., Takahashi, K.: A genetic programming approach to extraction of glycan motifs using tree structured patterns. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 150–159. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Tan, K.C., Lim, M.H., Yao, X., Wang, L.: Recent Advances in Simulated Evolution and Learning. World Scientific, Singapore (2004)

    Book  Google Scholar 

  12. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput 18(6), 1245–1262 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagamine, M., Miyahara, T., Kuboyama, T., Ueda, H., Takahashi, K. (2008). Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering. In: Wobcke, W., Zhang, M. (eds) AI 2008: Advances in Artificial Intelligence. AI 2008. Lecture Notes in Computer Science(), vol 5360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89378-3_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89378-3_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89377-6

  • Online ISBN: 978-3-540-89378-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics