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.
Author supplied keywords
Cite
CITATION STYLE
APA
Ravi, T. V., & Chidananda Gowda, K. (2000). A new nonhierarchical clustering procedure for symbolic objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1983, pp. 35–41). Springer Verlag. https://doi.org/10.1007/3-540-44491-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free