The new k-windows algorithm for improving the k-means clustering algorithm

Journal of Complexity

Volumn 18, Issue 1, 2002, Pages 375-391

  Vrahatis, M N ^a   Boutsinas, B ^b   Alevizos, P ^b   Pavlides, G ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b UOP   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036230457     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2001.0633     Document Type: Article

References (26)

1. "Cluster Analysis"
2. An algorithm for orthogonal range search in d ≥ 3 dimensions
3. An efficient k-means clustering algorithm
4. Efficient worst-case data structures for range searching
5. On distributing the clustering process
6. Refining initial points for k-means clustering
7. Scaling clustering algorithms to large databases
8. Filtering search: A new approach to query-answering
9. Fractional cascading. II. Applications
10. "Advances in Knowledge Discovery and Data Mining"
11. A general coefficient of similarity and some of its properties
12. "Theory and Applications of Correspondence Analysis"
13. Extensions to the k-means algorithm for clustering large data sets with categorical values
14. "Algorithms for Clustering Data"
15. Large-scale parallel data clustering
16. Parallel clustering algorithms
17. Halo world: Tools for parallel cluster finding in astrophysical N-body simulations
18. "Knowledge Discovery in Databases"
19. A divisive initialization method for clustering algorithms
20. "Computational Geometry"
21. Some methods for classification and analysis of multivariate observations
22. A conceptual version of the k-means algorithm
23. Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
24. A new approach to clustering
25. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications
26. k-means-type algorithms: A generalized convergence theorem and characterization of local optimality