首页> 外文会议>International Joint Conference on Rough Sets >Multi-view Clustering Algorithm Based on Variable Weight and MKL
【24h】

Multi-view Clustering Algorithm Based on Variable Weight and MKL

机译:基于变量和MKL的多视图聚类算法

获取原文

摘要

Compared with Single-view clustering, Multi-view clustering analysis exploits more hidden information. Multiple kernel learning (MKL) performs its superiority in heterogeneous sources and solves the problem of selection of kernel functions. Many existing multi-view literatures based on MKL consider instances in each view equally and overlook the difference among them. In this paper, a multi-view clustering algorithm based on variable weight and MKL (called MVMKC) is proposed. MVMKC improves clustering quality with more-refined analyses on data. To be specific, it uses an improved weighted Gaussian kernel rather than the traditional combined kernel function. Meanwhile, variable weights are introduced to measure the contribution of instance in different views. Experimental results on real-world datasets demonstrate the effectiveness of the proposed approach.
机译:与单视聚类相比,多视图聚类分析利用更多隐藏信息。多个内核学习(MKL)在异构源中执行其优越性,解决了内核函数的选择问题。基于MKL的许多现有的多视图文献考虑每个视图中的实例同样并忽略它们之间的差异。本文提出了一种基于可变权重和MKL(称为MVMKC)的多视距聚类算法。 MVMKC提高了聚类质量,并在数据上进行更多细化分析。具体而言,它使用改进的加权高斯内核而不是传统的内核功能。同时,引入了可变权重,以测量不同视图中的实例的贡献。现实世界数据集的实验结果证明了拟议方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号