direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Machine Learning

All Publications

Incremental pairwise clustering for large proximity matrices
Citation key Seo2015
Author Seo, S. and Mohr, J. and Ningfei, L. and Horn, A. and Obermayer, K.
Title of Book 2015 International Joint Conference on Neural Networks (IJCNN)
Pages 1-8
Year 2015
ISSN 2161-4393
DOI 10.1109/IJCNN.2015.7280637
Month July
Abstract Pairwise clustering methods are able to handle relational data, in which a set of objects is described via a matrix of pairwise (dis)similarities. Using the framework of source coding, it has been shown that pairwise clustering can be considered as entropy maximization problem under the constraint of keeping the distortion at a small value. This can be optimized via deterministic annealing. For the purpose of improving this optimization procedure, we have previously suggested two incremental pairwise clustering methods. However, they either only allow an even number of clusters, or cannot be applied to large proximity matrices. In this paper, we propose an incremental pairwise clustering method that resolves these issues. We compare the computational efficiency of the proposed algorithm to the previous incremental methods using simulations. Moreover, we apply the method to identify functionally connected brain networks by clustering a high-dimensional connectivity matrix obtained from resting state functional magnetic resonance imaging data.
Link to original publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions