Skip to main content

Optimizing a Neural Tree Using Subtree Retraining

  • Conference paper
  • First Online:
Knowledge-Based Intelligent Information and Engineering Systems (KES 2004)

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

  • 1082 Accesses

Abstract

Subtree retraining applied to a Stochastic Competitive Evolutionary Neural Tree model (SCENT) is introduced. This subtree retraining process is designed to improve the performance of the original model which provides a hierarchical classification of unlabelled data. The effect of subtree retraining on the network produces stable classificatory structures by repeatedly restructuring the weakest branch of the classification tree based on internal relation between members. An experimental comparison using well-known real world data sets, chosen to provide a variety of clustering scenarios, showed the new approach produced more reliable performances.

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. Adams, R.G., Butchart, K., Davey, N.: Classification with a Competitive Evolutionary Neural Tree. Neural Networks Journal 12, 541–551 (1999)

    Article  Google Scholar 

  2. Davey, N., Adams, R.G., George, S.G.: The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree. Journal of Applied Intelligence 12(1/2), 75–93 (2000)

    Article  Google Scholar 

  3. Gordon, A.D.: Classification. Chapman & Hall, London (1999)

    MATH  Google Scholar 

  4. Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, USA (1975)

    MATH  Google Scholar 

  5. Milligan, G.W., Cooper, M.C.: An Examination of Procedures for Determining the Number of Clusters in a Data Set. Psychometrika Journal 50(2), 159–179 (1985)

    Article  Google Scholar 

  6. Hertz, J., Krogh, A., Palmer, R.G.: An Introduction to the Theory of Neural Computation. Addision Wesley, USA (1991)

    Book  Google Scholar 

  7. Pensuwon, W., Adams, R.G., Davey, N.: Comparative Performances of Stochastic Competitive Evolutionary Neural Tree (SCENT) with Neural Classifiers. In: Proceedings of the 8th International Conference on Neural Information Processing - ICONIP 2001, pp. 121–126 (2001)

    Google Scholar 

  8. Pensuwon, W., Adams, R.G., Davey, N.: The Analysis of the Addition of Stochasticity to a Neural Tree Classifier. Journal of Applied Soft Computing 1(3), 189–200 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pensuwon, W., Adams, R., Davey, N. (2004). Optimizing a Neural Tree Using Subtree Retraining. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30134-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30134-9_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics