Abstract
This paper presents another necessary condition about the optimum partition on a finite set of samples. From this condition, a correspondinggeneralized sequential hard k-means (GSHKM) clustering algorithm is built and many well-known clustering algorithms are found to be included in it. Under some assumptions the well-known MacQueen’s SHKM (Sequential Hard K-Means) algorithm, FSCL (Frequency Sensitive Competitive Learning) algorithm and RPCL (Rival Penalized Competitive Learning) algorithm are derived. It is shown that FSCL in fact still belongs to the kind of GSHKM clustering algorithm and is more suitable for producing means of K-partition of sample data, which is illustrated by numerical experiment. Meanwhile, some improvements on these algorithms are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
MacQueen J. Some methods for classification and analysis of multivariate observations. InProc. 5th Berkeley Symp. on Mathematics, Statistics, and Probability, LeCam L M, Neyman J (Eds.), 1967, pp. 281–297.
Dudo Richard O, Hart Peter E. Pattern Classification and Scene Analysis. Library of Congress Cataloging in Publication Data, John Wiley & Sons, Inc., 1973.
Linde Y, Bauzo A, Gray R M. An algorithm for vector quantizer design.IEEE Trans. Commun., 1988, COM-28: 84–95.
Gray R M, Kieffer J C, Linde Y. Locally optimal block quantizer design.Inform. Contr., 1980, 45: 178–198.
Ahalt S C, Krishnamurty A K, Chen P, Melton D E. Competitive learning algorithms for vector quantization.Neural Networks, 1990, 3: 277–291.
Desieno D. Adding a conscience to competitve learning. InProc. Int. Conf. on Neural Networks, Vol. I, pp. 117–124, IEEE Press, New York, July, 1988.
Xu Lei, Krzyzak Adam, Oja Erkki. Rival penalized competitive learning analysis, RBF net, and curve detection.IEEE Trans. on Neural Networks, 1993, 4(4): 636–649.
Author information
Authors and Affiliations
Additional information
Ye Shiwei is a Ph.D. candidate at Institute of Computing Technology. His research interests include artificial neural networks, wavelets analysis and image processing.
Shi Zhongzhi is a Professor at Institute of Computing Technology. His research interests include artificial neural networks and artificial life.
Rights and permissions
About this article
Cite this article
Ye, S., Shi, Z. A necessary condition about the optimum partition on a finite set of samples and its application to clustering analysis. J. of Comput. Sci. & Technol. 10, 545–556 (1995). https://doi.org/10.1007/BF02943512
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943512