检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:梁毅聪 张巍[1] 滕少华[1] LIANG Yi-cong;ZHANG Wei;TENG Shao-hua(School of Computer,Guangdong University of Technology,Guangzhou 510006,China)
出 处:《小型微型计算机系统》2023年第8期1728-1734,共7页Journal of Chinese Computer Systems
基 金:广东省重点领域研发计划项目(2020B010166006)资助;国家自然科学基金项目(61972102)资助。
摘 要:多视角聚类能够整合多个视角的信息来提高聚类效果,目前很多研究都限于关注多视角一致性,得到的统一相似度图中仍存在许多非同簇之间的关系,甚至当某些簇的噪声达到一定程度时还可能导致统一相似度图难以形成簇的块对角结构.为此,本文提出一种块对角引导的多视角统一图聚类方法,该方法先将不同视角的相似度图分解成一致性部分与不一致性部分;然后通过构造不一致性关系来获得更纯净的一致性部分;进而融合所有视角的一致性部分建立一个相似度图;最后在该相似度图中加入块对角引导和连通分量约束,学习到高质量的统一相似度图.通过在六个数据集上进行对比实验,证明了本文提出的方法的有效性.Multi-view clustering can integrate information from multiple view to promote clustering performance.Unfortunately,many studies are limited to focusing on multi-view consistency and there exist many relationships between different clusters in unified graph.What is worse,when the noise of some clusters reaches a certain level,it may lead the unified graph to be difficult to form the cluster block diagonal structure.To address issues mentioned above,a model is proposed in this paper,it firstly decomposed the similarity graphs of each view into consistent part and inconsistent part respectively.In order to obtain purer consistent parts of each view,it con-structed multi-view inconsistency.Then a similarity graph is obtained by fusing the consistent parts of all views.At the same time,the block diagonal-guided and connected component constraints are imposed on the graph.Finally,we obtain a better unified graph.Exten-sive experiments on six datasets demonstrate that the effectiveness of the proposed method.
关 键 词:多视角聚类 图学习 多视角一致性与不一致性 块对角引导 连通分量约束
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3