Generalized Clustering for Problem Localization
- 1 February 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (2) , 176-181
- https://doi.org/10.1109/tc.1978.1675056
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Optimization of k nearest neighbor density estimatesIEEE Transactions on Information Theory, 1973
- Asymptotic Analysis of a Nonparametric Clustering TechniqueIEEE Transactions on Computers, 1972
- A Nonparametric Valley-Seeking Technique for Cluster AnalysisIEEE Transactions on Computers, 1972
- A Criterion and an Algorithm for Grouping DataIEEE Transactions on Computers, 1970
- Multisurface method of pattern separationIEEE Transactions on Information Theory, 1968
- Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant FunctionsIEEE Transactions on Electronic Computers, 1966
- On Estimation of a Probability Density Function and ModeThe Annals of Mathematical Statistics, 1962