.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
We present the first framework for comparing subspace clusterings. We propose several distance measures for subspace clusterings, including generalizations of well-known distance measures for ordinary clusterings. We describe a set of important properties for any measure for comparing subspace clusterings and give a systematic comparison of our proposed measures in terms of these properties. We validate the usefulness of our subspace clustering distance measures by comparing clusterings produced by the algorithms FastDOC, HARP, PROCLUS, ORCLUS, and SSPC. We show that our distance measures can be also used to compare partial clusterings, overlapping clusterings, and patterns in binary data matrices.
Keyword:
subspace clustering
projected clustering
distance
feature selection
cluster validation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Demonstration of an Improved Total Partitioning Process for High Level Liquid Waste Using Annular Centrifugal Contactors演示使用环形离心接触器改进的高级液体废物总分配过程.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏
查看更多内容