Abstract
A new nonhierarchical clustering procedure for symbolic objects is presented wherein during the first stage of the algorithm, the initial seed points are selected using the concept of farthest neighbours, and in suceeding stages the seed points are computed iteratively until the seed points get stabilised.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Diday and J.C. Simon, Clustering Analysis:Communication and Cybernetics, Vol 10, NewYork, Springer Verlag, 1976, pp. 47–92.
E. Diday, C. Hayashi, M. Jambu and N. Ohsumi, Eds, Recent developments in clustering and data analysis, NewYork: Academic, 1987.
H.H. Bock, Ed, Classification and related methods of data analysis, Amsterdam: NorthHolland, 1987.
A.K. Jain and R.C. Dubes, Algorithms for clustering data, Englewood Cliffs, NJ: Prentice Hall, 1988.
E. Diday, Ed., Data analysis, learning symbolic and numeric knowledge, Antibes, France: Nova Science Publishers, 1989.
R.O. Duda and P.E. Hart, Pattern classification and scene analysis, NewYork: Wiley Interscience, 1973.
K.C. Gowda and E. Diday, “Symbolic clustering using a new dissimilarity measure”, Pattern Recognition, Vol 24, No. 6, pp. 567–578, 1991.
M. Ichino, “General metrics for mixed features-The cartesian space theory for pattern recognition”, in proc. IEEE Conf. Systems, Man and Cybernetics, Atlanta, GA, pp. 14–17, 1988.
M. Ichino and H. Yaguchi, “General Minkowsky metric for mixed feature type”, IEEE transactions on Systems, Man and Cybernetics, Vol 24, pp. 698–708, 1994.
K.C. Gowda and E. Diday, “Symbolic clustering using a new similarity measure”, IEEE transactions on Systems, Man and Cybernetics, Vol 22, No. 2, pp. 368–378, 1992.
K.C. Gowda and T.V. Ravi,“Agglomerative clustering of symbolic objects using the concepts of both similarity and dissimilarity”, Pattern Recognition Letters 16 (1995), pp. 647–652.
K.C. Gowda and T.V. Ravi, “Divisive clustering of symbolic objects using the concepts of both similarity and dissimilarity”, Pattern Recognition, Vol 28, No. 8, pp. 1277–1282, 1995.
E. Diday, The symbolic approach in clustering, classification and related methods of vdata analysis, H.H. Bock, Ed. Amsterdam, The Netherlands: Elsevier, 1988.
D.H. Fisher and P. Langley, “Approaches to conceptual clustering”, in Proc. 9 th International Joint Conference on Artificial Intelligence, Los Angeles, CA, 1985, pp. 691–697.
R. Michalski, R.E. Stepp and E.Diday, “ A recent advance in data analysis: clustering objects into classes characterized by conjuctive concepts,” Progress in Pattern Recognition, Vol 1, L. Kanal and A. Rosenfeld, eds (1981).
R. Michalski and R.E. Stepp, “Automated construction of classifications: Conceptual clustering versus numerical taxonomy”, IEEE transactions Pattern Analysis and Machine Intelligence, PAMI-5, pp. 396–410, 1983
Y. Cheng and K.S. Fu, “Conceptual clustering in knowledge organisation”, IEEE transactions Pattern Analysis and Machine Intelligence, PAMI-7, pp. 592–598, 1985.
D.H. Fisher, “Knowledge acquisition via incremental conceputal clustering”, Machine Learning, No. 2, pp. 103–138, 1987.
K.C. Gowda, “ A feature reduction and unsupervised classification algorithm for multispectral data”, Pattern Recognition, Vol 17, No. 6, pp 667–676, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ravi, T., Gowda, K.C. (2000). A NEW NONHIERARCHICAL CLUSTERING PROCEDURE FOR SYMBOLIC OBJECTS. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-44491-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41450-6
Online ISBN: 978-3-540-44491-6
eBook Packages: Springer Book Archive