The K-means clustering algorithm based on density and ant colony

@article{Yuqing2003TheKC,
  title={The K-means clustering algorithm based on density and ant colony},
  author={Peng Yuqing and Hou Xiangdan and Liu Shang},
  journal={International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003},
  year={2003},
  volume={1},
  pages={457-460 Vol.1}
}
The ant algorithm is a new evolutional method, k-means and the density-cluster are familiar cluster analysis. In this paper, we proposed a new K-means algorithm based on density and ant theory, which resolved the problem of local minimal by the random of ants and handled the initial parameter sensitivity of k-means. In addition it combined idea of density and made the ants searching selectable. With the experiments it was proved that the algorithm we proposed improved the efficiency and… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

A Multilevel kway Partitioning Algorithm for Finite Element Meshes Using Competing Ant Colonies ”

  • P. W. Grant
  • 1999

Similar Papers

Loading similar papers…