Clustering by a genetic algorithm with biased mutation operator

@article{Auffarth2010ClusteringBA,
  title={Clustering by a genetic algorithm with biased mutation operator},
  author={Benjamin Auffarth},
  journal={IEEE Congress on Evolutionary Computation},
  year={2010},
  pages={1-8}
}
In this paper we propose a genetic algorithm that partitions data into a given number of clusters. The algorithm can use any cluster validity function as fitness function. Cluster validity is used as a criterion for cross-over operations. The cluster assignment for each point is accompanied by a temperature and points with low confidence are preferentially mutated. We present results applying this genetic algorithm to several UCI machine learning data sets and using several objective cluster… CONTINUE READING

From This Paper

Topics from this paper.
8 Citations
45 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 45 references

FCM algorithm based on unsupervised mahalanobis distances with better initial values and separable criterion

  • J. Yih, Y. Lin, H. Liu
  • Proceedings of the 8th conference on Applied…
  • 2008
1 Excerpt

UCI machine learning repository

  • A. Asuncion, D. Newman
  • 2007. [Online]. Available: http://www.ics.uci.edu…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…