Skip to main content

Supervised Encoding of Graph-of-Graphs for Classification and Regression Problems

  • Conference paper
Focused Retrieval and Evaluation (INEX 2009)

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

Abstract

This paper introduces a novel approach for processing a general class of structured information, viz., a graph of graphs structure, in which each node of the graph can be described by another graph, and each node in this graph, in turn, can be described by yet another graph, up to a finite depth. This graph of graphs description may be used as an underlying model to describe a number of naturally and artificially occurring systems, e.g. nested hypertexted documents. The approach taken is a data driven method in that it learns from a set of examples how to classify the nodes in a graph of graphs. To the best of our knowledge, this is the first time that a machine learning approach is enabled to deal with such structured problem domains. Experimental results on a relatively large scale real world problem indicate that the learning is efficient. This paper presents some preliminary results which show that the classification performance is already close to those provided by the state-of-the-art ones.

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. Gori, M., Küchler, A., Soda, G.: On the implementation of frontier-to-root tree automata in recursive neural networks. IEEE Transactions on Neural Networks 10(6), 1305–1314 (1999)

    Article  Google Scholar 

  2. Frasconi, P., Francesconi, E., Gori, M., Marinai, S., Sheng, J., Soda, G.: Logo recognition by recursive neural networks. In: Kasturi, R., Tombre, K. (eds.) GREC 1997. LNCS, vol. 1389, pp. 104–117. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Sperduti, A., Majidi, D., Starita, A.: Extended cascade-correlation for syntactic and structural pattern recognition. In: Perner, P., Rosenfeld, A., Wang, P. (eds.) SSPR 1996. LNCS, vol. 1121, pp. 90–99. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Hammer, B., Micheli, A., Sperduti, A.: Universal approximation capability of cascade correlation for structures. Neural Computation 17(5), 1109–1159 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bianucci, A., Micheli, A., Sperduti, A., Starita, A.: Quantitative structure-activity relationships of benzodiazepines by recursive cascade correlation. In: IEEE Processing of IJCNN 1998- IEEE World Congress on Computational Intelligence, Anchorage, Alaska, May 1998, pp. 117–122 (1998)

    Google Scholar 

  6. Scarselli, F., Gori, M., Tsoi, A., Hagenbuchner, M., Monfardini, G.: Computational capabilities of graph neural networks. IEEE Transactions on Neural Networks 20(1), 81–102 (2009)

    Article  Google Scholar 

  7. Yong, S., Hagenbuchner, M., Tsoi, A., Scarselli, F., Gori, M.: Document mining using graph neural network. In: Fuhr, N., Lalmas, M., Trotman, A. (eds.) INEX 2006. LNCS, vol. 4518, pp. 458–472. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. KC, M., Hagenbuchner, M., Tsoi, A., Scarselli, F., Gori, M., Sperduti, S.: Xml document mining using contextual self-organizing maps for structures. LNCS. Springer, Heidelberg (2007)

    Google Scholar 

  9. Hagenbuchner, M., Sperduti, A., Tsoi, A.: A self-organizing map for adaptive processing of structured data. IEEE Transactions on Neural Networks 14(3), 491–505 (2003)

    Article  Google Scholar 

  10. Zhang, S., Hagenbuchner, M., Tsoi, A., Sperduti, A.: Self Organizing Maps for the clustering of large sets of labeled graphs. Springer, Heidelberg (2009)

    Google Scholar 

  11. Mihalcea, R., Tarau, P.: TextRank: Bringing order into texts. In: Proceedings of EMNLP-04 and the 2004 Conference on Empirical Methods in Natural Language Processing (July 2004)

    Google Scholar 

  12. The rainbow software package, http://www.cs.umass.edu/~mccallum/bow/rainbow/

  13. Chau, R., Tsoi, A.C., Hagenbuchner, M., Lee, V.: A conceptlink graph for text structure mining. In: Mans, B. (ed.) Thirty-Second Australasian Computer Science Conference (ACSC 2009), Wellington, New Zealand. CRPIT, vol. 91, pp. 129–137. ACS (2009)

    Google Scholar 

  14. Sontag, E.: Capabilities and training of feedforward nets. In: Neural networks, New Brunswick, NJ, Boston, MA. Academic Press, London (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, S.J., Hagenbuchner, M., Scarselli, F., Tsoi, A.C. (2010). Supervised Encoding of Graph-of-Graphs for Classification and Regression Problems. In: Geva, S., Kamps, J., Trotman, A. (eds) Focused Retrieval and Evaluation. INEX 2009. Lecture Notes in Computer Science, vol 6203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14556-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14556-8_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14555-1

  • Online ISBN: 978-3-642-14556-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics