4.7 Article

Multi-view spectral clustering for uncertain objects

期刊

INFORMATION SCIENCES
卷 547, 期 -, 页码 723-745

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2020.08.080

关键词

Spectral clustering; Co-regularization; Multi-view clustering; Uncertain; Similarity measure

向作者/读者索取更多资源

Uncertain data clustering is a crucial task in machine learning and pattern recognition. Multi-view clustering has gained attention for producing good results compared to single-view clustering, with the introduction of a self-adaptive mixture similarity measure (SAM) to address limitations of existing similarity measures. Experimental results show that SAM outperforms state-of-the-art methods in grouping uncertain data.
In the machine learning and pattern recognition fraternity, uncertain data clustering is an essential job because uncertainty in data makes the clustering process more difficult. Recently, multi-view clustering is gaining more attention towards data miners for certain data because it produces good results compared to grouping based on a single viewpoint. In uncertain data clustering, similarity measure plays an imperative role. However, state-of-the-art similarity measures suffer from several limitations. For example, when two distributions of two uncertain data are heavily overlapped in locations, then Geometric similarity measure alone is not sufficient. On the other hand, similarity measure based on probability distribution is not enough when two uncertain data are not closed to each other or completely separated. In this study, induced kernel distance and Jeffrey-divergence are fused by the degree of overlap concerning each view of a dataset to construct a self-adaptive mixture similarity measure (SAM). The SAM is further used with pairwise co-regularization in multi-view spectral clustering for grouping uncertain data. The proof of convergence of the objective function of the proposed clustering algorithm is also presented in this study. All the experiments are carried out on nine real-world deterministic datasets, three real-life and one synthetic uncertain datasets. Nine real-world deterministic datasets are further converted into uncertain datasets before executing all the clustering algorithms. Experimental results illustrate that the proposed algorithm outperforms nine state-of-the-art methods. The comparison is made using five clustering evaluation metrics. The proposed method is also tested using null hypothesis significance tests. (C) 2020 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据