In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
M. Emre Celebi, Y. Alp Aslandogan, Paul R. Bergstr...
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...