.png){kind=icon}
返回
Patch clustering for massive data sets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2008.12.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The presence of huge data sets poses new problems to popular clustering and visualization algorithms such as neural gas (NG) and the self-organising-map (SOM) due to memory and time constraints. In such situations, it is no longer possible to store all data points in the main memory at once and only a few, ideally only one run over the whole data set is still affordable to achieve a feasible training time. In this contribution we propose single pass extensions of the classical clustering algorithms NG and SOM which are based on a simple patch decomposition of the data set and fast batch optimization schemes of the underlying cost function. The algorithms only require a fixed memory space. They maintain the benefits of the original ones including easy implementation and interpretation as well as large flexibility and adaptability. We demonstrate that parallelization of the methods becomes easily possible and we show the efficiency of the approach in a variety of experiments. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Neural gas
Clustering streaming data
Parallelization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
How to make large self-organizing maps for nonvectorial data如何为非矢量数据制作大型自组织图.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
Motif-Directed Oxidative Folding to Design and Discover Multicyclic Peptides for Protein RecognitionMotif-导向氧化折叠法设计与发现用于蛋白质识别的多环肽
PREAI
分享收藏Decision templates for multiple classifier fusion: an experimental comparisonPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容