返回
Co-Clustering Ensemble Based on Bilateral K-Means Algorithm
DOI:10.1109/ACCESS.2020.2979915.png)
摘要
En 中文
Clustering ensemble technique has been shown to be effective in improving the accuracy and stability of single clustering algorithms. With the development of information technology, the amount of data, such as image, text and video, has increased rapidly. Efficiently clustering these large-scale datasets is a challenge. Clustering ensembles usually transform clustering results to a co-association matrix, and then to a graph-partition problem. These methods may suffer from information loss when computing the similarity among samples or base clusterings. Rich information between samples and base clusterings is ignored. Moreover, the results are not discrete. They need post-processing steps to obtain the final clustering result, which will deviate greatly from the real clustering result. To address this problem, we propose a co-clustering ensemble based on bilateral k-means (CEBKM) algorithm. Our algorithm can simultaneously cluster samples and base clusterings of a dataset, to fully exploit the potential information between the samples and the base clusterings. In addition, it can directly obtain the final clustering results without using other clustering algorithms. The proposed method, outperformed several state-of-the-art clustering ensemble methods in experiments conducted on real-world and toy datasets.
Keyword:
Clustering ensemble
bilateral k-means algorithm
co-clustering
base clustering
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Prediction of Pregabalin-Mediated Pain Response by Severity of Sleep Disturbance in Patients with Painful Diabetic Neuropathy and Post-Herpetic Neuralgia疼痛性糖尿病神经病变和带状疱疹后神经痛患者睡眠障碍严重程度预测普瑞巴林介导的疼痛反应

