Mercer kernel-based clustering in feature space
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 13 (3) , 780-784
- https://doi.org/10.1109/tnn.2002.1000150
Abstract
The article presents a method for both the unsupervised partitioning of a sample of data and the estimation of the possible number of inherent clusters which generate the data. This work exploits the notion that performing a nonlinear data transformation into some high dimensional feature space increases the probability of the linear separability of the patterns within the transformed space and therefore simplifies the associated data structure. It is shown that the eigenvectors of a kernel matrix which defines the implicit mapping provides a means to estimate the number of clusters inherent within the data and a computationally simple iterative procedure is presented for the subsequent feature space partitioning of the data.Keywords
This publication has 8 references indexed in Scilit:
- An Expectation-Maximization Approach to Nonlinear Component AnalysisNeural Computation, 2001
- Maximum certainty data partitioningPattern Recognition, 2000
- ICA mixture models for unsupervised classification of non-Gaussian classes and automatic context switching in blind signal separationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- Nonlinear Component Analysis as a Kernel Eigenvalue ProblemNeural Computation, 1998
- Stochastic Algorithms for Exploratory Data Analysis: Data Clustering and Data VisualizationPublished by Springer Nature ,1998
- Feature grouping by 'relocalisation' of eigenvectors of the proximity matrixPublished by British Machine Vision Association and Society for Pattern Recognition ,1990
- An Algorithm for Euclidean Sum of Squares ClassificationBiometrics, 1977
- A Projection Pursuit Algorithm for Exploratory Data AnalysisIEEE Transactions on Computers, 1974