Skip to main content

Polynomial Clusterons Exhibit Statistical Estimation Abilities

  • Conference paper
Neural Nets WIRN Vietri-99

Part of the book series: Perspectives in Neural Computing ((PERSPECT.NEURAL))

  • 171 Accesses

Abstract

The aim of this paper is to investigate the behavior of neural clusterons that learn in an unsupervised fashion by means of an information-theoretic based rule. Particularly the aim is to investigate on the clusteron’s statistical estimation abilities that naturally emerge from their learning behaviors.

This research was financially supported by the Italian MURST.

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. M. Battisti, P. Burrascano, AND D. Pirollo, Efficient minimisation of the KL distance for the approximation of posterior conditional probabilities, Neural Processing Letters, Vol. 5, pp. 47–55, 1997

    Article  Google Scholar 

  2. A.J. Bell AND T.J. Sejnowski, An information maximisation approach to blind separation and blind deconvolution, Neural Computation, Vol. 7, No. 6, pp. 1129–1159, 1996

    Article  Google Scholar 

  3. J.L. McClelland AND D.E. Rumelhart (Eds.), Parallel distributed processing, Vol. I — Foundations, The MIT Press, 1986

    Google Scholar 

  4. J.A. Feldman AND D.H. Ballard, Connectionist models and their properties, Cognitive Science, Vol. 6, pp. 205–254, 1982

    Article  Google Scholar 

  5. S. Fiori, P. Bucciarelli, AND F. Piazza, Blind signal flatting using warping neural modules, Proc. of International Joint Conference on Neural Networks (IJCNN), pp. 2312–2317, 1998

    Google Scholar 

  6. S. Fiori, Blind Source Separation by New M-WARP Algorithm, Electronics Letters, Vol. 35, No. 4, pp. 269–270, Feb. 1999

    Article  Google Scholar 

  7. S. Fiori, Entropy Optimization by the PFANN Network: Application to Blind Source Separation, Network: Computation in Neural Systems, Vol. 10, No. 2, pp. 1–16, Apr. 1999

    Article  Google Scholar 

  8. S. Fiori, P. Baldassarre AND F. Piazza, An efficient architecture for independent component analysis, To appear on the Proc. of Int. Symposium on Circuits and Systems (ISCAS), May 30–June 2, 199, Orlando (Florida — USA)

    Google Scholar 

  9. E.B. Kosmatopoulos, A. Chassiakos, H. Boussalis, M. Mirmirani, AND P.A. Ioannou, Neural network control of unknown systems, Proc. of International Joint Conference on Neural Networks (IJCNN), pp. 943–948, 1998

    Google Scholar 

  10. P. Kulczycki AND H. Schioler, Estimating conditional distributions by neural networks, Proc. of International Joint Conference on Neural Networks (IJCNN), pp. 1344–1349, 1998

    Google Scholar 

  11. S. Laughlin, A Simple Coding Procedure Enhances a Neuron’s Information Capacity, Z. Naturforsch, Vol. 36, pp. 910–912, 1981

    Google Scholar 

  12. B.W. Mel, Information processing in dendritic trees, Neural Computation, Vol. 6, pp. 1031–1085, 1994

    Article  MATH  Google Scholar 

  13. G. Miller AND D. Horn, Probability density estimation using entropy maximization, Neural Computation, Vol. 10, pp. 1925–1938, 1998

    Article  Google Scholar 

  14. P. Moreland, Mixture of experts estimate a-posteriori probabilities, Artificial Neural Networks, pp. 499–505, Springer-Verlag, 1997

    Google Scholar 

  15. Y.-H. Pao, Adaptive Pattern Recognition and Neural Networks, Addison-Wesley Publishing Company, 1989 (Chpt. 8)

    Google Scholar 

  16. Z. Roth AND Y. Baram, Multidimensional density shaping by sigmoids, IEEE Trans. on Neural Networks, Vol. 7, No. 5, pp. 1291–1298, Sept. 1996

    Article  Google Scholar 

  17. A. Sudjianto AND M.H. Hassoun, Nonlinear Hebbian rule: a statistical interpretation, Proc. of Int. Conf. on Neural Networks (ICNN), Vol. 2, pp. 1247–1252, 1994

    Google Scholar 

  18. A. Taleb AND C. Jutten, Entropy optimization — Application to source separation, Artificial Neural Networks, pp. 529–534, Springer-Verlag, 1997

    Google Scholar 

  19. Y. Yang AND A.R. Barron, An asymptotic property of model selection criteria, IEEE Trans. on Information Theory, Vol. 44, No. 1, Jan. 1998

    Google Scholar 

  20. S.M. Zurada, Introduction to Neural Artificial Systems, West Publishing Company, 1992

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Fiori, S., Burrascano, P. (1999). Polynomial Clusterons Exhibit Statistical Estimation Abilities. In: Marinaro, M., Tagliaferri, R. (eds) Neural Nets WIRN Vietri-99. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0877-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0877-1_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-1226-6

  • Online ISBN: 978-1-4471-0877-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics