Fast approximated relational and kernel clustering

Schleif F-M, Zhu X, Gisbrecht A, Hammer B (2012)
In: Proceedings of ICPR 2012. IEEE: 1229-1232.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Abstract / Bemerkung
The large amount of digital data requests for scalable tools like efficient clustering algorithms. Many algorithms for large data sets request linear separability in an Euclidean space. Kernel approaches can capture the non-linear structure but do not scale well for large data sets. Alternatively, data are often represented implicitly by dissimilarities like for protein sequences, whose methods also often do not scale to large problems. We propose a single algorithm for both type of data, based on a batch approximation of relational soft competitive learning, termed fast generic soft-competitive learning. The algorithm has linear computational and memory requirements and performs favorable to traditional techniques
Erscheinungsjahr
2012
Titel des Konferenzbandes
Proceedings of ICPR 2012
Seite(n)
1229 - 1232
ISBN
978-4-990644-1-6
Page URI
https://pub.uni-bielefeld.de/record/2615750

Zitieren

Schleif F-M, Zhu X, Gisbrecht A, Hammer B. Fast approximated relational and kernel clustering. In: Proceedings of ICPR 2012. IEEE; 2012: 1229-1232.
Schleif, F. - M., Zhu, X., Gisbrecht, A., & Hammer, B. (2012). Fast approximated relational and kernel clustering. Proceedings of ICPR 2012, 1229-1232
Schleif, Frank-Michael, Zhu, Xibin, Gisbrecht, Andrej, and Hammer, Barbara. 2012. “Fast approximated relational and kernel clustering”. In Proceedings of ICPR 2012, 1229-1232. IEEE.
Schleif, F. - M., Zhu, X., Gisbrecht, A., and Hammer, B. (2012). “Fast approximated relational and kernel clustering” in Proceedings of ICPR 2012 (IEEE), 1229-1232.
Schleif, F.-M., et al., 2012. Fast approximated relational and kernel clustering. In Proceedings of ICPR 2012. IEEE, pp. 1229-1232.
F.-M. Schleif, et al., “Fast approximated relational and kernel clustering”, Proceedings of ICPR 2012, IEEE, 2012, pp.1229-1232.
Schleif, F.-M., Zhu, X., Gisbrecht, A., Hammer, B.: Fast approximated relational and kernel clustering. Proceedings of ICPR 2012. p. 1229-1232. IEEE (2012).
Schleif, Frank-Michael, Zhu, Xibin, Gisbrecht, Andrej, and Hammer, Barbara. “Fast approximated relational and kernel clustering”. Proceedings of ICPR 2012. IEEE, 2012. 1229-1232.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar
ISBN Suche