Key points are not available for this paper at this time.
The problem of clustering multivariate observations is viewed as the replacement of a set of vectors with a set of labels and representative vectors. A general criterion for clustering is derived as a measure of representation error. Some special cases are derived by simplifying the general criterion. A general algorithm for finding the optimum classification with respect to a given criterion is derived. For a particular case, the algorithm reduces to a repeated application of a straightforward decision rule which behaves as a valley-seeking technique. Asymptotic properties of the procedure are developed. Numerical examples are presented for the finite sample case.
Building similarity graph...
Analyzing shared references across papers
Koontz et al. (Tue,) studied this question.
Loading...
IEEE Transactions on Computers
Purdue University West Lafayette
Add This Paper to Your Research Feed
Any time a new paper drops it will be there.