15th International Conference on Advanced Computing and Communications - TOC

Published 1 December 2007

DOI10.1109/adcom.2007.11

Citations8

TL;DR

The proposed GA with line symmetry distance based (GALSD) clustering technique is able to detect any type of clusters, irrespective of their geometrical shape and overlapping nature, as long as they possess the characteristic of line symmetry.

Abstract

In this paper, an evolutionary clustering technique is described that uses a new line symmetry based distance measure. Kd-tree based nearest neighbor search is used to reduce the complexity of finding the closest symmetric point. Adaptive mutation and crossover probabilities are used. The proposed GA with line symmetry distance based (GALSD) clustering technique is able to detect any type of clusters, irrespective of their geometrical shape and overlapping nature, as long as they possess the characteristic of line symmetry. GALSD is compared with existing well-known K-means algorithm. Five artificially generated and two real-life data sets are used to demonstrate its superiority.

Keywords

Computer Science

The MIT Press eBooksAdaptation in Natural and Artificial Systems

35,568 Citations1992John H. Holland

Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.

ACM Computing SurveysData clustering

13,184 Citations1999Anil K. Jain, M. Narasimha Murty +1 more

An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.

View PDF

Cluster Analysis

9,195 Citations1974Barry J. Everitt, Sabine Landau +1 more

Computational Geometry: Algorithms and Applications

4,507 Citations1997Mark de Berg, Otfried Cheong +2 more

This report documents the program and the outcomes of Dagstuhl Seminar 21181 “Computational Geometry”, which was held online in a virtual manner, and 36 participants from various countries attended it.

IEEE Transactions on Systems Man and CyberneticsAdaptive probabilities of crossover and mutation in genetic algorithms

2,491 Citations1994Madana Srinivas, L.M. Patnaik

An efficient approach for multimodal function optimization using genetic algorithms (GAs) and the use of adaptive probabilities of crossover and mutation to realize the twin goals of maintaining diversity in the population and sustaining the, convergence capacity of the GA are described.

Pattern RecognitionGenetic algorithm-based clustering technique

1,447 Citations2000Ujjwal Maulik, Sanghamitra Bandyopadhyay

The superiority of the GA-clustering algorithm over the commonly used K-means algorithm is extensively demonstrated for four artificial and three real-life data sets.

IEEE Transactions on Pattern Analysis and Machine IntelligenceA modified version of the K-means algorithm with a distance based on cluster symmetry

389 Citations2001Mu‐Chun Su, Chien-Hsing Chou

A modified version of the K-means algorithm is proposed that adopts a novel nonmetric distance measure based on the idea of "point symmetry" that can be applied in data clustering and human face detection.

Pattern RecognitionGAPS: A clustering method using a new point symmetry-based distance measure

175 Citations2007Sanghamitra Bandyopadhyay, Sriparna Saha

The proposed GA with point symmetry (GAPS) distance based clustering algorithm is able to detect any type of clusters, irrespective of their geometrical shape and overlapping nature, as long as they possess the characteristic of symmetry.

Symmetry as a new measure for cluster validity

55 Citations2002Chien Hsing Chou, Mu Su +1 more