Accelerating Relational Clustering Algorithms With Sparse Prototype Representation

Rossi F, Hasenfuß A, Hammer B (2007)
In: Proceedings of 6th International Workshop on Self-Organizing Maps. Bielefeld: Bielefeld University.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Rossi, Fabrice; Hasenfuß, Alexander; Hammer, BarbaraUniBi
Abstract / Bemerkung
In some application contexts, data are better described by a matrix of pairwise dissimilarities rather than by a vector representation. Clustering and topographic mapping algorithms have been adapted to this type of data, either via the generalized Median principle, or more recently with the so called relational approach, in which prototypes are represented by virtual linear combinations of the original observations. One drawback of those methods is their complexity, which scales as the square of the number of observations, mainly because they use dense prototype representations: each prototype is obtained as a virtual combination of all the elements of its cluster (at least). We propose in this paper to use a sparse representation of the prototypes to obtain relational algorithms with sub-quadratic complexity.
Erscheinungsjahr
2007
Titel des Konferenzbandes
Proceedings of 6th International Workshop on Self-Organizing Maps
Konferenz
WSOM 2007
Konferenzort
Bielefeld, Germany
Konferenzdatum
2007-09-03 – 2007-09-06
ISBN
978-3-00-022473-7
Page URI
https://pub.uni-bielefeld.de/record/1993848

Zitieren

Rossi F, Hasenfuß A, Hammer B. Accelerating Relational Clustering Algorithms With Sparse Prototype Representation. In: Proceedings of 6th International Workshop on Self-Organizing Maps. Bielefeld: Bielefeld University; 2007.
Rossi, F., Hasenfuß, A., & Hammer, B. (2007). Accelerating Relational Clustering Algorithms With Sparse Prototype Representation. Proceedings of 6th International Workshop on Self-Organizing Maps Bielefeld: Bielefeld University. doi:10.2390/biecoll-wsom2007-144
Rossi, F., Hasenfuß, A., and Hammer, B. (2007). “Accelerating Relational Clustering Algorithms With Sparse Prototype Representation” in Proceedings of 6th International Workshop on Self-Organizing Maps (Bielefeld: Bielefeld University).
Rossi, F., Hasenfuß, A., & Hammer, B., 2007. Accelerating Relational Clustering Algorithms With Sparse Prototype Representation. In Proceedings of 6th International Workshop on Self-Organizing Maps. Bielefeld: Bielefeld University.
F. Rossi, A. Hasenfuß, and B. Hammer, “Accelerating Relational Clustering Algorithms With Sparse Prototype Representation”, Proceedings of 6th International Workshop on Self-Organizing Maps, Bielefeld: Bielefeld University, 2007.
Rossi, F., Hasenfuß, A., Hammer, B.: Accelerating Relational Clustering Algorithms With Sparse Prototype Representation. Proceedings of 6th International Workshop on Self-Organizing Maps. Bielefeld University, Bielefeld (2007).
Rossi, Fabrice, Hasenfuß, Alexander, and Hammer, Barbara. “Accelerating Relational Clustering Algorithms With Sparse Prototype Representation”. Proceedings of 6th International Workshop on Self-Organizing Maps. Bielefeld: Bielefeld University, 2007.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar
ISBN Suche