A COMPUTER ORIENTED ITERATIVE ALGORITHM FOR CLUSTERING

Article Sidebar

View Abstract PDF Download PDF
Published: Nov 25, 1996
DOI: https://doi.org/.
Dimensions Badge

Keywords:
Mahalanobis D2, clustering, iterative algorithm.

Main Article Content

K. M. SURESH
Department of Agricultural Statistics, College of Horticulture Kerala Agricultural University, Trichur
V. K. G. UNNITHAN
Department of Agricultural Statistics, College of Horticulture Kerala Agricultural University, Trichur

Abstract

A new computer oriented iterative algorithm for formation of clusters using Mahalanobis D2 values is proposed. The procedure is free from the drawbacks of Tocher's method of clustering using D2 values, viz., i) the stopping rule for formation of any cluster is arbitrary, and ii) often a genotype belonging to a cluster has on the average a smaller D2 value with the genotypes of a different cluster than the one it belongs to.

Article Details

How to Cite
SURESH, K. M., & UNNITHAN, V. K. G. (1996). A COMPUTER ORIENTED ITERATIVE ALGORITHM FOR CLUSTERING. INDIAN JOURNAL OF GENETICS AND PLANT BREEDING, 56(04), 412–424. https://doi.org/.
Issue
Vol. 56 No. 04 (1996): Indian Journal of Genetics and Plant Breeding
Section
Research Article
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.