Skip to main content
Log in

Associative Clustering for Clusters of Arbitrary Distribution Shapes

  • Volume Contents
  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

A novel neural network, named Associative Clustering Neural Network (ACNN), is developed for clustering data whose underlying distribution shapes are arbitrary. ACNN is a dynamic model that collectively measures and updates the similarity of any two patterns through the interaction of a group of patterns. Such a new measure of similarity helps to achieve more robust clustering performance than using the existing measures that are staticly and individually based on the distances among the isolated pairwise data. The efficience of ACNN has been verified through the performance study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Duda, R. and Hart, P.: Pattern Classification and Scene Analysis, New York: Interscience, 1973.

    Google Scholar 

  2. Bezdek, J. Z.: Pattern Recognition with Fuzzy Objective Function Algorithms, New York: Plenum, 1981.

    Google Scholar 

  3. Krishnapuram, R. and Keller, J. M.: A Possibilistic Approach to Clustering, IEEE Trans. Fuzzy Syst. 1(2) (1993), 98–110.

    Google Scholar 

  4. Karayiannis, N. B. and Bezdek, J. C.: An Integrated Approach to Fuzzy Learning Vector Quantization and Fuzzy c-means Clustering, IEEE Trans. Fuzzy Syst. 5(4) (1997), 622–628.

    Google Scholar 

  5. Dave, R. N. and Krishnapuram, R.: Robust Clustering Methods: A Unified View, IEEE Trans. Fuzzy Syst. 5(2) (1997), 270–293.

    Google Scholar 

  6. Krishnapuram, R., Frigui, H. and Nasraoui, O.: Fuzzy and Possibilistic Shell Clustering Algorithms and Their Application to Boundary Detection and Surface Approximation, IEEE Trans. Fuzzy Syst. 3(1) (1995), 29–60.

    Google Scholar 

  7. Urquhart, R.: Graph Theoretic Clustering Based on Limited Neighborhood Sets, Pattern Recog. 15 (1982), 173–187.

    Google Scholar 

  8. Wu, Z. and Leahy, R.: An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation, IEEE Trans. Pattern Anal.Machine Intel. 15(11) (1993), 1101–1113.

    Google Scholar 

  9. Eltoft, T. and deFigueiredo, R. J. P.: A New Neural Network for Cluster-Detection and-Labeling, IEEE Trans. Neural Networks 9(5) (1998), 1021–1035.

    Google Scholar 

  10. Wang, J.: A Linear Assignment Clustering Algorithm Based on the Least Similar Cluster Representatives, IEEE Trans. Syst. Man. and Cyber. (Part A) 29(1) (1999), 100–104.

    Google Scholar 

  11. Hofmann, T. and Buhmann, J. M.: Pairwise Data Clustering by Deterministic Annealing, IEEE Trans. Pattern Anala. Machine Intel. 19(1) (1997), 1–14.

    Google Scholar 

  12. Hopfield, J. J.: Neural Network and Physical Systems with Emergent Collective Computational Abilities, Proc. Acad. Sci. U.S.A. 79 (1982), 2554–2558.

    Google Scholar 

  13. Kosko, B.: Adaptive Bidirectional Associative Memories, Appl. Opt. 26(23) (1987), 4947–4960.

    Google Scholar 

  14. Kawamura, M., Okada, M. and Hirai, Y.: Dynamics of Selective Recall in an Associative Memory Model with One-to-Many Associations, IEEE Trans. Neural Networks 10(3) (1999), 704–713.

    Google Scholar 

  15. Hinton, G. E. and Anderson, J. A.: ParallelModels of AssociativeMemory, New Jersey: Hillsidale, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lihui Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yao, Y., Chen, L. & Chen, Y.Q. Associative Clustering for Clusters of Arbitrary Distribution Shapes. Neural Processing Letters 14, 169–177 (2001). https://doi.org/10.1023/A:1012759532608

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012759532608

Navigation