Skip to main content

NEC: A Hierarchical Agglomerative Clustering Based on Fisher and Negentropy Information

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3931))

Abstract

In this paper a hierarchical agglomerative clustering is introduced. A hierarchy of two unsupervised clustering algorithms is considered. The first algorithm is based on a competitive Neural Network or on a Probabilistic Principal Surfaces approach and the second one on an agglomerative clustering based on both Fisher and Negentropy information. Different definitions of Negentropy information are used and some tests on complex synthetic data are presented.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  2. Chang, K., Ghosh, J.: A unified Model for Probabilistic Principal Surfaces. IEEE Transactions on pattern Analysis nd Machine Intelligence 23(1)

    Google Scholar 

  3. Cook, D., Buja, A., Cabrera, J.: Projection Pursuit Indexes Based on Orthonormal Function Expansions. Journal of Computational and Graphical Statistics 2(3), 225–250 (1993)

    Article  MathSciNet  Google Scholar 

  4. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley & Sons Inc., Chichester (2001)

    MATH  Google Scholar 

  5. Hyvärinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. John Wiley & Sons, Chichester (2001)

    Book  Google Scholar 

  6. Hyvärinen, A.: New Approximations of Differential Entropy for Independent Component Analysis and Projection Pursuit. In: Advences in Neural Information Processing Systems, vol. 10, pp. 273–279. MIT Press, Cambridge (1998)

    Google Scholar 

  7. Jenssen, R., Eltoft, T., Principe, J.C.: Information Theoretic Clustering: A Unifying Review of Three Recent Algorithms. In: Proceedings of the 6th Nordic Signal Processing Symposium - NORSIG 2004, Espoo, Finland, June 9-11(2004)

    Google Scholar 

  8. de M. Martins, A., Neto, A.D.D., de Melo, J.D., Costa, J.A.F.: Clustering Using Neural Networks and Kullback-leibler Divergency. In: International Joint Conference on Neural Networks - IJCNN 2004, pp. 1–6 (2004)

    Google Scholar 

  9. Staiano, A., De Vinco, L., Ciaramella, A., Raiconi, G., Tagliaferri, R., Longo, G., Miele, G., Amato, R., Del Mondo, C., Donalek, C., Mangano, G., Di Bernardo, D.: Probabilistic Principal Surfaces for Yeast Gene Microarray Data-Mining. In: ICDM 2004 - Fourth IEEE International Conference on Data Mining, Brighton (UK), pp. 202–209 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciaramella, A., Longo, G., Staiano, A., Tagliaferri, R. (2006). NEC: A Hierarchical Agglomerative Clustering Based on Fisher and Negentropy Information. In: Apolloni, B., Marinaro, M., Nicosia, G., Tagliaferri, R. (eds) Neural Nets. WIRN NAIS 2005 2005. Lecture Notes in Computer Science, vol 3931. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731177_8

Download citation

  • DOI: https://doi.org/10.1007/11731177_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33183-4

  • Online ISBN: 978-3-540-33184-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics