TY - GEN
T1 - A context-sensitive crossover operator for clustering applications
AU - Banerjee, Amit
AU - Dave, Rajesh N.
PY - 2010
Y1 - 2010
N2 - In this paper we propose a new context-sensitive crossover operator for genetic search based clustering applications. The proposed crossover operator compares relevant sub-regions in partitions represented by the two parents selected for mating, passing on to the child only high fitness sub-regions in the partition space. The use of the restricted growth function as the representation for the genotype makes it easier to do a meaningful cluster-wise comparison between two partitions. Clusters are compared using a statistical basis for spatial randomness on the assumption that natural groupings in data are compact and isolated and therefore spatially random within themselves. The proposed crossover operator has good exploitation properties and is heavily biased against an exploratory genetic search because it identifies and necessarily passes good schemas to the child. Preliminary results on two datasets of varying complexity tend to prove this point - when the proposed crossover operator is used with high probability, the search quickly homogenizes and moves as a whole towards high fitness regions of the partition space. We have also presented results of simulations where we have explicitly attempted to balance the exploitation and the exploration aspects of the search by using the crossover operator sparingly during the initial generations, thereby preserving diversity and letting the search branch off towards multiple local optima in the partition space.
AB - In this paper we propose a new context-sensitive crossover operator for genetic search based clustering applications. The proposed crossover operator compares relevant sub-regions in partitions represented by the two parents selected for mating, passing on to the child only high fitness sub-regions in the partition space. The use of the restricted growth function as the representation for the genotype makes it easier to do a meaningful cluster-wise comparison between two partitions. Clusters are compared using a statistical basis for spatial randomness on the assumption that natural groupings in data are compact and isolated and therefore spatially random within themselves. The proposed crossover operator has good exploitation properties and is heavily biased against an exploratory genetic search because it identifies and necessarily passes good schemas to the child. Preliminary results on two datasets of varying complexity tend to prove this point - when the proposed crossover operator is used with high probability, the search quickly homogenizes and moves as a whole towards high fitness regions of the partition space. We have also presented results of simulations where we have explicitly attempted to balance the exploitation and the exploration aspects of the search by using the crossover operator sparingly during the initial generations, thereby preserving diversity and letting the search branch off towards multiple local optima in the partition space.
UR - http://www.scopus.com/inward/record.url?scp=79959476180&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959476180&partnerID=8YFLogxK
U2 - 10.1109/CEC.2010.5586089
DO - 10.1109/CEC.2010.5586089
M3 - Conference contribution
AN - SCOPUS:79959476180
SN - 9781424469109
T3 - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
BT - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
T2 - 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
Y2 - 18 July 2010 through 23 July 2010
ER -