A modified version of the K-means algorithm with a distance based on cluster symmetry
Authors:
- 1 June 2001
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 23 (6) , 674-680
Abstract
We propose a modified version of the K-means algorithm to cluster data. The proposed algorithm adopts a novel nonmetric distance measure based on the idea of "point symmetry". This kind of "point symmetry distance" can be applied in data clustering and human face detection. Several data sets are used to illustrate its effectiveness.Keywords
This publication has 16 references indexed in Scilit:
- Application of neural networks using quadratic junctions in cluster analysisNeurocomputing, 2001
- Self-Organizing Neural Networks for Data ProjectionLecture Notes in Computer Science, 1999
- A self-organizing network for hyperellipsoidal clustering (HEC)IEEE Transactions on Neural Networks, 1996
- Symmetry as a continuous featureIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- Context-free attentional operators: The generalized symmetry transformInternational Journal of Computer Vision, 1995
- Shape from texture: integrating texture-element extraction and surface estimationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- ART 2: self-organization of stable category recognition codes for analog input patternsApplied Optics, 1987
- A massively parallel architecture for a self-organizing neural pattern recognition machineComputer Vision, Graphics, and Image Processing, 1987
- Pattern Recognition with Fuzzy Objective Function Algorithms1981
- A new approach to clusteringInformation and Control, 1969