Skip to main content

Generalised RBF Networks Trained Using an IBL Algorithm for Mining Symbolic Data

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2001)

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

Included in the following conference series:

  • 1313 Accesses

Abstract

The application of neural networks to domains involving prediction and classification of symbolic data requires a reconsideration and a careful definition of the concept of distance between patterns. Traditional distances are inadequate to access the differences between the symbolic patterns. This work proposes the utilization of a statistically extracted distance measure in the context of Generalized Radial Basis Function (GRBF) networks. The main properties of the GRBF networks are retained in the new metric space. The regularization potential of these networks can be realized with this type of distance. Furthermore, the recent engineering of neural networks offers effective solutions for learning smooth functionals that lie on high dimensional spaces.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Simon Haykin, Neural Networks, MacMillan College Publishing Company, Second Edition,1999.

    Google Scholar 

  2. T. Poggio and F. Girosi. Regularization algorithms for learning that are equivalent to multilayer perceptrons, Science 247 (1990):978–982.

    Article  MathSciNet  Google Scholar 

  3. Pierre Baldi, Soren Brunak, Bioinformatics, MIT Press, 1998.

    Google Scholar 

  4. Federico Girosi, “An Equivalence Between Sparse Approximation and Support Vector Machines”, Neural Computation, 10:6, (1998), pp. 1455–1480.

    Article  Google Scholar 

  5. C. Stanfill, D. Waltz, “Toward memory-based reasoning”, Communications of the ACM, 29:12 (1986), pp.1213–1228.

    Article  Google Scholar 

  6. G. Towell, J. Shavlik, M. Noordewier, “Refinement of aproximate domain theories by knowledge-based neural networks”, Proceedings Eight National Conference on Artificial Intelligence, pp. 861–866, Menlo Park, CA: AAAI Press.

    Google Scholar 

  7. Justin C.W. Debuse and Victor Jayward-Smith, “Discretisation of Continuous Commercial Database Features for a Simulated Annealing Data Mining Algorithm” Applied Intelligence 11, pp. 285–295 (1999).

    Article  Google Scholar 

  8. D. Randall Wilson, Tony R. Martinez, “Improved Heterogenous Distance Functions”, Journal of Artificial Intelligence Research 6 (1997), p. 1–34.

    MATH  MathSciNet  Google Scholar 

  9. Christopher M. Bishop, Neural Networks for Pattern Recognition Clarendon Press-Oxford, 1996).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vladutu, L., Papadimitriou, S., Mavroudi, S., Bezerianos, A. (2001). Generalised RBF Networks Trained Using an IBL Algorithm for Mining Symbolic Data. In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-45357-1_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41910-5

  • Online ISBN: 978-3-540-45357-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics