ACM Home Page
Please provide us with feedback. Feedback
An algorithm for multidimensional data clustering
Full text PdfPdf (676 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 14 ,  Issue 2  (June 1988) table of contents
Pages: 153 - 162  
Year of Publication: 1988
ISSN:0098-3500
Authors
S. J. Wan  Univ. of Regina, Regina, Sask., Canada
S. K. M. Wong  Univ. of Regina, Regina, Sask., Canada
P. Prusinkiewicz  Univ. of Regina, Regina, Sask., Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 121,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/45054.45056
What is a DOI?

ABSTRACT

A new divisive algorithm for multidimensional data clustering is suggested. Based on the minimization of the sum-of-squared-errors, the proposed method produces much smaller quantization errors than the median-cut and mean-split algorithms. It is also observed that the solutions obtained from our algorithm are close to the local optimal ones derived by the k-means iterative procedure.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
DUDA, R. O., AND HART, P.E. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
4
 
5
HALL, E.L. Computer Image Processing and Recognition. Academic Press, New York, 1979.
 
6
7
 
8
HYAFIL, L., AND RIVEST, R.L. Construction optimal binary decision trees is NP-complete. In./. Process. Lett. 5 (May 1976), 15-17.
 
9
MACQUEEN, J.B. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkley Symposium on Mathematical Statistics and Probability I (1967), 281-297,
 
10
SELIM, S, Z., AND ISMAIL, M.A. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6, 1 (1984), 81-87.
 
11
WAN, S. J., WONG, S, K. M., AND PRUSINKIEWICZ, P. Variance-based color image quantization for frame buffer display. Submitted for publication.
 
12
WON(~, S. K. M., WAN, S. J., AND PRUSINKIEWICZ, P. Monochrome image quantization. Submitted for publication.
 
13
Wu, X., AND WITTEN, }. H. A fast k-means type clustering algorithm. Dept. Computer Science, Univ. of Calgary, Canada, May 1985.

CITED BY  9


REVIEW

"Florian Petrescu : Reviewer"

The authors introduce a new and promising multivariate data clustering algorithm. They adopt a divisive strategy, that is, a procedure that partitions the input data space sequentially into a number of disjoint subregions. After revie  more...

Collaborative Colleagues:
S. J. Wan: colleagues
S. K. M. Wong: colleagues
P. Prusinkiewicz: colleagues