Abstract

A family of nonparametric clustering criteria has been previously proposed by the authors. One particular member of this family was subjected to analysis and experimentation. This criterion was shown by heuristic argument, experimentation, and approximate asymptotic analysis to exhibit ``valley-seeking'' behavior. In this paper, we consider a more general class of valley-seeking criteria. The results bear a close resemblance to Parzen's theory of probability density estimation. This similarity is exploited to develop sufficient conditions for a criterion to be valley seeking in the asymptotic sense.

Keywords

Nonparametric statisticsCluster analysisMathematicsClass (philosophy)HeuristicSimilarity (geometry)Asymptotic analysisArgument (complex analysis)Kernel density estimationApplied mathematicsMathematical optimizationComputer scienceStatisticsArtificial intelligenceMathematical analysis

Affiliated Institutions

Related Publications

On clusterings

We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is sh...

2004 Journal of the ACM 842 citations

Publication Info

Year
1972
Type
article
Volume
C-21
Issue
9
Pages
967-974
Citations
30
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

30
OpenAlex

Cite This

Warren Koontz, Keinosuke Fukunaga (1972). Asymptotic Analysis of a Nonparametric Clustering Technique. IEEE Transactions on Computers , C-21 (9) , 967-974. https://doi.org/10.1109/tc.1972.5009073

Identifiers

DOI
10.1109/tc.1972.5009073