Algorithms for clustering data
Algorithms for clustering data
An efficient Particle Swarm Optimization approach to cluster short texts
Information Sciences: an International Journal
| Hi-index | 0.00 |
Clustering algorithms have been widely used in information retrieval applications. However, it is difficult to define an objective "best" result. This article analyzes some document clustering algorithms and illustrates that they are equivalent to the optimization problem of some global functions. Experiments show their good performance, but there are still counter-examples where they fail to return the optimal solution. We argue that Monte-Carlo algorithms in the global optimization framework have the potential to find better solutions than traditional clustering, and they are able to handle more complex structures.