首页> 外文期刊>Neural Networks, IEEE Transactions on >Topology-Based Hierarchical Clustering of Self-Organizing Maps
【24h】

Topology-Based Hierarchical Clustering of Self-Organizing Maps

机译:自组织图的基于拓扑的层次聚类

获取原文
获取原文并翻译 | 示例
           

摘要

A powerful method in the analysis of datasets where there are many natural clusters with varying statistics such as different sizes, shapes, density distribution, overlaps, etc., is the use of self-organizing maps (SOMs). However, further processing tools, such as visualization and interactive clustering, are often necessary to capture the clusters from the learned SOM knowledge. A recent visualization scheme (CONNvis) and its interactive clustering utilize the data topology for SOM knowledge representation by using a connectivity matrix (a weighted Delaunay graph), CONN. In this paper, we propose an automated clustering method for SOMs, which is a hierarchical agglomerative clustering of CONN. We determine the number of clusters either by using cluster validity indices or by prior knowledge on the datasets. We show that, for the datasets used in this paper, data-topology-based hierarchical clustering can produce better partitioning than hierarchical clustering based solely on distance information.
机译:自组织映射表(SOM)是分析数据集的一种有效方法,在该数据集中有许多具有不同统计信息(例如不同大小,形状,密度分布,重叠等)的自然簇。但是,通常需要进一步的处理工具,例如可视化和交互式聚类,才能从学到的SOM知识中捕获聚类。最近的可视化方案(CONNvis)及其交互式群集通过使用连接矩阵CONN(加权Delaunay图)将数据拓扑用于SOM知识表示。在本文中,我们提出了一种用于SOM的自动聚类方法,它是CONN的分层聚集聚类。我们通过使用聚类有效性指标或通过对数据集的先验知识来确定聚类数量。我们证明,对于本文中使用的数据集,基于数据拓扑的分层聚类可以比仅基于距离信息的分层聚类产生更好的分区。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号