Hebbian self-organizing integrate-and-fire networks for data clustering

Authors:
Florian Landis;Thomas Ott;Ruedi Stoop
Affiliations:
-;-;-
Venue:
Neural Computation
Year:
2010

Citing 7
Cited 0

Self-organizing maps

Self-organizing maps
Data clustering using a model granular magnet

Neural Computation
Data clustering: a review

ACM Computing Surveys (CSUR)
Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Pattern Recognition and Machine Learning (Information Science and Statistics)

Pattern Recognition and Machine Learning (Information Science and Statistics)
TreeSOM: cluster analysis in the self-organizing map

Neural Networks - 2006 Special issue: Advances in self-organizing maps--WSOM'05
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

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.