TU Berlin

Neuronale InformationsverarbeitungBuchkapitel

Neuronale Informationsverarbeitung

Inhalt

zur Navigation

Analyse neuronaler Daten

Buchkapitel

Elkan’s k-Means Algorithm for Graphs
Zitatschlüssel Jain2010b
Autor Jain, B. and Obermayer, K.
Buchtitel Advances in Soft Computing
Seiten 22-32
Jahr 2010
ISBN 978-3-642-16772-0, 978-3-642-16773-7
ISSN 0302-9743
DOI 10.1007/978-3-642-16773-7_2
Jahrgang 6438
Notiz 9th Mexican International Conference on Artificial Intelligence, MICAI 2010, Pachuca, Mexico, November 8-13, 2010, Proceedings, Part II
Herausgeber Sidorov, Grigori and Hernández Aguirre, Arturo and Reyes García, CarlosAlberto
Verlag Springer Berlin Heidelberg
Serie Lecture Notes in Computer Science
Zusammenfassung This paper proposes a fast k-means algorithm for graphs based on Elkan’s k-means for vectors. To accelerate the k-means algorithm for graphs without trading computational time against solution quality, we avoid unnecessary graph distance calculations by exploiting the triangle inequality of the underlying distance metric. In experiments we show that the accelerated k-means for graphs is faster than k-means for graphs provided there is a cluster structure in the data.
Link zur Publikation Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe