Istituto di Scienza e Tecnologie dell'Informazione     
Nanni M. Speeding-up hierarchical agglomerative clustering in presence of expensive metrics. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining (Hanoi, Vietnam, May 2005). Proceedings, vol. 3518 pp. 378 - 387. Tu Bao Ho, David Cheung, Huan Liu (eds.). (Lecture Notes in Computer Science). Springer-Verlag GmbH, 2005.
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets which can be handled. In some contexts, in particular, computing distances between objects is the most expensive task. In this paper we propose a pruning heuristics aimed at improving performances in these cases, which is well integrated in all the phases of the HAC process and can be applied to two HAC variants: single-linkage and complete-linkage. After describing the method, we provide some theoretical evidence of its pruning power, followed by an empirical study of its effectiveness over different data domains, with a special focus on dimensionality issues.
URL: http://ercolino.isti.cnr.it/mirco/papers.html
Subject Data Mining
I.5.3 Clustering

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional