.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Interval data
Clustering
Self-organizing map
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W