arrow
返回

Data clustering using proximity matrices with missing values

delete2019-07-01
delete13
delete
OA
AI
S
Sigurður Ólafsson *
DOI:10.1016/j.eswa.2019.02.022delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In most applications of data clustering the input data includes vectors describing the location of each data point, from which distances between data points can be calculated and a proximity matrix constructed. In some applications, however, the only available input is the proximity matrix, that is, the distances between each pair of data point. Several clustering algorithms can still be applied, but if the proximity matrix has missing values no standard method is directly applicable. Imputation can be done to replace missing values, but most imputation methods do not apply when only the proximity matrix is available. As a partial solution to fill this gap, we propose the Proximity Matrix Completion (PMC) algorithm. This algorithm assumes that data is missing due to one of two reasons: complete dissimilarity or incomplete observations; and imputes values accordingly. To determine which case applies the data is modeled as a graph and a set of maximum cliques in the graph is found. Overlap between cliques then determines the case and hence the method of imputation for each missing data point. This approach is motivated by an application in plant breeding, where what is needed is to cluster new experimental seed varieties into sets of varieties that interact similarly to the environment, and this application is presented as a case study in the paper. The applicability, limitations and performance of the new algorithm versus other methods of imputation are further studied by applying it to datasets derived from three well-known test datasets. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Clustering
Imputation
Missing values
Proximity matrix
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

I
Iowa State University
学者数:
2.1W
论文数: 1.8W
被引数: 2.5W
引用论文

引用论文

err分享
err收藏
学者 查看更多内容