Unsupervised connectionist algorithms for clustering an environmental data set: A comparison

Neurocomputing

Volumn 28, Issue 1-3, 1999, Pages 177-189

  Bougrain, Laurent ^a   Alexandre, Frédéric ^a  

^a LORIA   (France)

Author keywords

Neural networks; Radiocommunication; Unsupervised learning; Vector quantization

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; COMPARATIVE STUDY; ELECTRONICS; ENVIRONMENTAL FACTOR; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; RADIOFREQUENCY RADIATION; TELECOMMUNICATION;

EID: 0032857943     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-2312(98)00123-4     Document Type: Article

References (8)

1. J. Buhmann, H. Kühnel, Complexity optimized vector quantization: a neural network approach, in: James A. Storer, M. Cohn (Eds.), Proceedings of Data Compression Conference, IEEE Computer Society Press, Snowbird, 1992, pp. 12-21.
2. D. DeSieno, Adding a conscience to competitive learning, Proceedings of International Conference on Neural Networks, vol. 1, IEEE Press, New York, 1988, pp. 117-124.
3. B. Fritzke, A growing neural gas network learns topologies, in: G. Tesauro, D.S. Touretzky, T.K. Leen (Eds.), Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995, pp. 625-632.
4. T. Kohonen, Self-Organization and Associative Memory, Third ed., Springer, Berlin, 1989.
5. T.M. Martinetz, Competitive Hebbian learning rule forms perfectly topology preserving maps, ICANN'93: International Conference on Artificial Neural Networks, Springer, Amsterdam, 1993, pp. 427-434.
6. D.E. Rumelhart, D. Zipser, Feature discovery by competitive learning, Cognitive Sci. 9 (1985) 75-112.
7. J.W. Sammon Jr., A nonlinear mapping for data structure analysis, IEEE Trans. Comp. c-18 (5) (1969) 401-409.
8. K.S. Younis, Weighted Mahalanobis distance for hyper-ellipsoidal clustering, Ph. D. Thesis, Air Force Institute of Technology, 1996.