Abstract

Nine hierarchical and four nonhierarchical clustering algorithms were compared on their ability to resolve 200 multivariate normal mixtures. The effects of coverage, similarity measures, and cluster overlap were studied by including different levels of coverage for the hierarchical algorithms, Euclidean distances and Pearson correlation coefficients, and truncated multivariate normal mixtures in the analysis. The results confirmed the findings of previous Monte Carlo studies on clustering procedures in that accuracy was inversely related to coverage, and that algorithms using correlation as the similarity measure were significantly more accurate than those using Euclidean distances. No evidence was found for the assumption that the positive effects of the use of correlation coefficients are confined to unconstrained mixture models.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.