.png){kind=icon}
返回
A new topological clustering algorithm for interval data
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2013.03.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering is a very powerful tool for automatic detection of relevant sub-groups in unlabeled data sets. In this paper we focus on interval data: i.e., where the objects are defined as hyper-rectangles. We propose here a new clustering algorithm for interval data, based on the learning of a Self-Organizing Map. The major advantage of our approach is that the number of clusters to find is determined automatically; no a priori hypothesis for the number of clusters is required. Experimental results confirm the effectiveness of the proposed algorithm when applied to interval data. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Interval data
Clustering
Self-organizing map
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Midpoint radius self-organizing maps for interval-valued data with telecommunications application
PREAI
分享收藏
查看更多内容