.png){kind=icon}
.png){kind=icon}
Return
An efficient algorithm for parallel distributed unsupervised learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2007.07.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
clustering
vector quantization
unsupervised learning
PAUL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
View more organizations