Semi-GAPS: A Semi-supervised Clustering Method Using Point Symmetry

Authors:
Sriparna Saha;Sanghamitra Bandyopadhyay
Affiliations:
Machine Intelligence Unit Indian Statistical Institute Kolkata-700108, India. E-mail: {sriparna_r,sanghami}@isical.ac.in;Machine Intelligence Unit Indian Statistical Institute Kolkata-700108, India. E-mail: {sriparna_r,sanghami}@isical.ac.in
Venue:
Fundamenta Informaticae
Year:
2009

Citing 10
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Combining labeled and unlabeled data with co-training

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry

IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained K-means Clustering with Background Knowledge

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Semi-supervised Clustering by Seeding

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Transductive Inference for Text Classification using Support Vector Machines

ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Gene functional classification by semi-supervised learning from heterogeneous data

Proceedings of the 2003 ACM symposium on Applied computing
On semi-supervised clustering via multiobjective optimization

Proceedings of the 8th annual conference on Genetic and evolutionary computation
GAPS: A clustering method using a new point symmetry-based distance measure

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an evolutionary technique for the semi-supervised clustering is proposed. The proposed technique uses a point symmetry based distance measure. Semi-supervised classification uses aspects of both unsupervised and supervised learning to improve upon the performance of traditional classification methods. In this paper the existing point symmetry based genetic clustering technique, GAPS-clustering, is extended in two different ways to handle the semi-supervised classi- fication problem. The proposed semi-GAPS clustering algorithmis able to detect any type of clusters irrespective of shape, size and convexity as long as they possess the point symmetry property. Kdtree based nearest neighbor search is used to reduce the complexity of finding the closest symmetric point. Adaptive mutation and crossover probabilities are used. Experimental results demonstrate practical performance benefits of the methodology in detecting classes having symmetrical shapes in case of semi-supervised clustering.