.png){kind=icon}
返回
k-mw-modes: An algorithm for clustering categorical matrix-object data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2017.04.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In data mining, the input of most algorithms is a set of n objects and each object is described by a feature vector. However, in many real database applications, an object is described by more than one feature vector. In this paper, we call an object described by more than one feature vector as a matrix-object and a data set consisting of matrix-objects as a matrix-object data set. We propose a k-multi-weighted-modes (abbr. k-mw-modes) algorithm for clustering categorical matrix-object data. In this algorithm, we define the distance between two categorical matrix-objects and a multi-weighted-modes representation of cluster prototypes is proposed. We give a heuristic method to choose the locally optimal multi-weighted modes in the iteration of the k-mw-modes algorithm. We validated the effectiveness and benefits of the k-mw-modes algorithm on the five real data sets from different applications. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Categorical data
Matrix-object
k -mw-modes algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
PREAI
分享收藏A weighting k-modes algorithm for subspace clustering of categorical data分类数据子空间聚类的加权k-modes算法.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏分享收藏
查看更多内容