基于划分融合与视角加权的极大熵聚类算法

doi:10.3969/j.issn.1000-3428.2016.04.033

计算机工程

基于划分融合与视角加权的极大熵聚类算法

张丹丹,邓赵红,蒋亦樟,王士同

(江南大学数字媒体学院,江苏无锡 214122)

收稿日期:2015-02-04 出版日期:2016-04-15 发布日期:2016-04-15
作者简介:张丹丹(1992-),女,硕士研究生,主研方向为人工智能、神经模糊计算;邓赵红,副教授、博士;蒋亦樟,博士研究生;王士同,教授、博士生导师。
基金资助:
国家自然科学基金资助面上项目(61170122);江苏省杰出青年基金资助项目(BK20140001);新世纪优秀人才支持计划基金资助项目(NCET120882)。

Maximum Entropy Clustering Algorithm Based on Partition Fusion and View-weighting

ZHANG Dandan,DENG Zhaohong,JIANG Yizhang,WANG Shitong

(School of Digital Media,Jiangnan University,Wuxi,Jiangsu 214122,China)

Received:2015-02-04 Online:2016-04-15 Published:2016-04-15

摘要/Abstract

摘要： 针对极大熵聚类算法在处理多视角聚类任务时存在的局限性,引入划分融合和视角加权技术,提出一种改进的极大熵聚类算法。通过对视角分配权重体现其重要程度,在此基础上对每个视角进行单独划分,利用融合权重矩阵实现视角划分的融合,并采用新的集成策略得到全局聚类结果。在人工数据集和UCI数据集上的实验结果表明,与极大熵聚类算法、基于多任务的组合K-means算法等相比,该算法具有更好的多视角聚类性能。

关键词: 极大熵聚类, 多视角聚类, 划分融合, 视角加权, 权重矩阵

Abstract: Aiming at the limitation to effectively realize the view fusion in the multi-view clustering task for Maximum Entropy Clustering(MEC),this paper proposes an improved view-weighting MEC algorithm by introducing partition fusion and view-weighting.This method assigns a weight of each view to show the importance of each view.And it sets the partition matrix of each view,and the view-fusion in each view partition is made by a view-fusion weighting matrix.Finally,it proposes a new integration strategy to obtain the global partition result.Experimental results on synthetic datasets and UCI datasets show that the proposed algorithm outperforms MEC algorithm and CombKM algorithm in dealing with multi-view clustering task.

Key words: Maximum Entropy Clustering(MEC), multi-view clustering, partition fusion, view-weighting, weight matrix

中图分类号:

TP18

张丹丹,邓赵红,蒋亦樟,王士同. 基于划分融合与视角加权的极大熵聚类算法[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2016.04.033.

ZHANG Dandan,DENG Zhaohong,JIANG Yizhang,WANG Shitong. Maximum Entropy Clustering Algorithm Based on Partition Fusion and View-weighting[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2016.04.033.

https://www.ecice06.com/CN/Y2016/V42/I4/184

参考文献

参考文献［1］Rose K,Gurewitz E,Fox G.A Deterministic Annealing Approach to Clustering［J］.Pattern Recognition Letters,1990,11(9):589-594. ［2］Karayiannis N B.MECA:Maximum Entropy Clustering Algorithm［C］//Proceedings of IEEE International Conference on Fuzzy System.Washington D.C.,USA:IEEE Press,1994:630-635. ［3］Li R P,Mukaidono M.A Maximum Entropy Approach to Fuzzy Clustering［C］//Proceedings of IEEE International Conference on Fuzzy System.Washington D.C.,USA:IEEE Press,1995:2227-2232. ［4］张志华,郑南宁,史罡.极大熵聚类算法及其全局收敛性分析［J］.中国科学:E辑,2001,31(1):59-70. ［5］邓赵红,王士同,吴锡生,等.鲁棒的极大熵聚类算法RMEC及其例外点标识［J］.中国工程科学,2004,(9):38-45. ［6］Asur S,Ucar D,Parthasarathy S.An Ensemble Framework for Clustering Protein-protein Interaction Networks［J］.Bioinformatics,2007,23(13):29-40. ［7］Wang Hongjun,Shan Hanhuai,Banerjee A.Bayesian Cluster Ensembles［J］.Statistical Analysis and Data Mining:The ASA Data Science Journal,2011,4(1):54-70. ［8］Gu Quanquan,Zhou Jie.Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification［C］//Proceedings of the 9th IEEE International Conference on Data Mining.Washington D.C.,USA:IEEE Press,2009:159- 168. ［9］Gu Quanquan,Zhou Jie.Co-clustering on Manifolds［C］//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2009:359-368. (下转第196页) (上接第189页) ［10］Zangwill W I.Convergence Conditions for Nonlinear Programming Algorithms［J］.Management Science,1969,16(1):1-13. ［11］Luenberger D G,Ye Y.Linear and Nonlinear Pro-gramming［M］.Berlin,Germany:Springer,2008. ［12］Bache K,Lichman M.UCI Machine Learning Reposi-tory［EB/OL］.［2014-12-05］.http://archive.ics.uci.edu/ml. ［13］Liu Yi,Jin Rong,Jain A K.Boostcluster:Boosting Clustering by Pairwise Constraints［C］//Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2007:450-459. ［14］Jing Liping,Ng M K,Huang J Z.An Entropy Weighting k-means Algorithm for Subspace Clustering of High-dimensional Sparse Data［J］.IEEE Transactions on Know-ledge and Data Engineering,2007,19(8):1026-1041. ［15］Deng Zhaohong,Choi K S,Chung F L,et al.Enhanced Soft Subspace Clustering Integrating Within-cluster and Between-cluster Information［J］.Pattern Recognition,2010,43(3):767-781. 编辑陆燕菲

[1]	王丽娟, 邢津萍, 尹明, 郝志峰, 蔡瑞初, 温雯. 基于一致性图的权重自适应多视角谱聚类算法[J]. 计算机工程, 2024, 50(2): 122-131.
[2]	张文金. 一种基于权重矩阵分解的在线多任务学习算法[J]. 计算机工程, 2019, 45(8): 190-197.

选择文件类型/文献管理软件名称

选择包含的内容

基于划分融合与视角加权的极大熵聚类算法

Maximum Entropy Clustering Algorithm Based on Partition Fusion and View-weighting

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

基于划分融合与视角加权的极大熵聚类算法

Maximum Entropy Clustering Algorithm Based on Partition Fusion and View-weighting

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价