Quick Search:

uzh logo
Browse by:
bullet
bullet
bullet
bullet

Zurich Open Repository and Archive

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-32022

Landis, F; Ott, T; Stoop, R (2010). Hebbian self-organizing integrate-and-fire networks for data clustering. Neural Computation, 22(1):273-288.

[img]
Preview
PDF (Supplementary material)
1MB

View at publisher

Abstract

We propose a Hebbian learning-based data clustering algorithm using spiking neurons. The algorithm is capable of distinguishing between clusters and noisy background data and finds an arbitrary number of clusters of arbitrary shape. These properties render the approach particularly useful for visual scene segmentation into arbitrarily shaped homogeneous regions. We present several application examples, and in order to highlight the advantages and the weaknesses of our method, we systematically compare the results with those from standard methods such as the k-means and Ward's linkage clustering. The analysis demonstrates that not only the clustering ability of the proposed algorithm is more powerful than those of the two concurrent methods, the time complexity of the method is also more modest than that of its generally used strongest competitor.

Citations

3 citations in Web of Science®
4 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

22 downloads since deposited on 28 Feb 2010
3 downloads since 12 months

Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Neuroinformatics
DDC:570 Life sciences; biology
Language:English
Date:2010
Deposited On:28 Feb 2010 10:00
Last Modified:27 Nov 2013 23:05
Publisher:MIT Press
ISSN:0899-7667
Additional Information:Copyright: MIT Press
Publisher DOI:10.1162/neco.2009.12-08-926
Related URLs:http://www.ini.uzh.ch/node/22238 (Organisation)
PubMed ID:19764879

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page