Generalized Clustering for Problem Localization
Fukunaga, Short · IEEE Transactions on Computers · 1978
The general procedure of conventional clustering is modified for various applications involving problem localization. This modification introduces the concept of clustering criteria which are used for partitioning a training set, and depend upon certain a priori information with regards to the training set. Also, the need of a structure or a mathematical form for the partition boundaries arises naturally from the need to process unknown samples. The general procedure is discussed in detail for applications of piecewise linear classifier design and piecewise linear density estimation. Experimental results are presented for both applications.
Cited by 11 works. doi:10.1109/tc.1978.1675056
Authors
References
- Introduction to Statistical Pattern Recognition
- On Estimation of a Probability Density Function and Mode
- Learning machines: foundations of trainable pattern-classifying systems
- Data analysis in the social sciences
- ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION
- Optimization of k nearest neighbor density estimates
- Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions
- Knowing and guessing
- Asymptotic Analysis of a Nonparametric Clustering Technique
- A Nonparametric Valley-Seeking Technique for Cluster Analysis