Combining K-means and Particle Swarm Optimization for Dynamic Data Clustering Problems
碩士 === 大同大學 === 資訊經營學系(所) === 96 === This paper presents a dynamic data clustering algorithm named K-means with Combinatorial Particle Swarm Optimization (KCPSO). Unlike the K-means method, KCPSO does not need a specific number of clusters before clustering is performed and is able to find the prope...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/92588567584481842868 |