.png){kind=icon}
返回
Partial Clustering Ensemble
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2023.3321913.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering ensemble often provides robust and stable results without accessing original features of data, and thus has been widely studied. The conventional clustering ensemble methods often take the full multiple base partitions as inputs and provide a consensus clustering result. However, in many real-world applications, full base partitions are hard to obtain because some data may be missing in some base partitions. To tackle this problem, in this paper, we propose a novel partial clustering ensemble method, which takes the partial multiple base partitions as inputs. In this method, we simultaneously fill the missing values in the base partitions and ensemble them by fully considering the consensus and diversity. Moreover, to address the unreliability issue in the partial data scenario, we seamlessly plug it into a self-paced learning framework. The extensive experiments on benchmark data sets demonstrate the effectiveness and efficiency of the proposed method when handling incomplete data.
Keyword:
Ensemble learning
Reliability
Clustering methods
Task analysis
Data privacy
Computer science
Urban areas
Clustering ensemble
incomplete data
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Ability of troponin I to predict cardiac events in patients admitted from the emergency department
PREAI
分享收藏
分享收藏Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance共识锚引导的无参数多视图子空间快速聚类
PREAI
分享收藏A multiple k -means clustering ensemble algorithm to find nonlinearly separable clusters.png)
INFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
分享收藏
查看更多内容