An efficient algorithm for parallel distributed unsupervised learning

Authors:
Giuseppe Campobello;Giuseppe Patané;Marco Russo
Affiliations:
Department of Matter Physics and Advanced Physical Technologies, University of Messina, Contrada Papardo, Salita Sperone 31, 98166 Messina, Italy;ClearSpeed Technology Plc 3110 Great Western Court, Hunts Ground Road, Stoke Gifford, Bristol BS34 8HP, UK;Department of Physics and Astronomy, University of Catania, V.le A.Doria 6, 95125 Catania, Italy and National Institute of Nuclear Physics (INFN), Section of Catania, V.le A.Doria 6, 95125 Catania ...
Venue:
Neurocomputing
Year:
2008

Citing 27
Cited 0

Parallel Algorithms for Hierarchical Clustering and Cluster Validity

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Clustering with Applications in Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Vector quantization and signal compression

Vector quantization and signal compression
Unsupervised texture segmentation using Gabor filters

Pattern Recognition
A lattice conceptual clustering system and its application to browsing retrieval

Machine Learning
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
Large-Scale Parallel Data Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
A Robust Competitive Clustering Algorithm With Applications in Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Statistical Pattern Recognition: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Data clustering: a review

ACM Computing Surveys (CSUR)
A comparison of cluster validity criteria for a mixture of normal distributed data

Pattern Recognition Letters
Learning from Data: Concepts, Theory, and Methods

Learning from Data: Concepts, Theory, and Methods
S-TREE: self-organizing trees for data clustering and online vector quantization

Neural Networks
The enhanced LBG algorithm

Neural Networks
The LBG-U Method for Vector Quantization – an Improvement over LBGInspired from Neural Networks

Neural Processing Letters
Clustering on a Hypercube Multicomputer

IEEE Transactions on Parallel and Distributed Systems
Improving the LBG Algorithm

IWANN '99 Proceedings of the International Work-Conference on Artificial and Natural Neural Networks: Foundations and Tools for Neural Modeling
Parallel Clustering on a Commodity Supercomputer

IJCNN '00 Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3 - Volume 3
A gradient procedure for determining clusters of relatively high point density

Pattern Recognition
A VLSI Systolic Architecture for Pattern Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Competitive learning algorithms for robust vector quantization

IEEE Transactions on Signal Processing
Conceptual clustering in information retrieval

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Vector quantization of image subbands: a survey

IEEE Transactions on Image Processing
A successive approximation vector quantizer for wavelet transform image coding

IEEE Transactions on Image Processing
Constructive feedforward ART clustering networks. II

IEEE Transactions on Neural Networks
Fully automatic clustering system

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new technique for parallel and distributed unsupervised learning. It arises from a detailed analysis of the weaknesses of several, existing algorithms, the most important of which is the presence of intrinsically serial operations. The basic idea of this work, therefore, is the substitution of this latter with new operations, as similar as possible to the original ones, but better suited to a parallel implementation. The result is a notable increase in speed-up; the price to be paid is a slight deterioration in the precision of the clustering process. The ideal applications for the new algorithm are very complex problems with a high number of patterns and classes.