苏科华

Supervisor of Doctorate Candidates  
Supervisor of Master's Candidates

E-Mail:

Date of Employment:2008-11-02

School/Department:计算机学院

Education Level:研究生毕业

Business Address:D203

Gender:Male

Contact Information:13517299596

Status:Employed

Discipline:Computer Applications Technology
Communications and Information Systems
Other specialties in Software Engineering
Cyberspace Security


Paper Publications

Dual Mutual Information Constraints for Discriminative Clustering

Hits:

Affiliation of Author(s):AAAI Press

Journal:Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023

Abstract:Deep clustering is a fundamental task in machine learning and data mining that aims at learning clustering-oriented feature representations. In previous studies, most of deep clustering methods follow the idea of self-supervised representation learning by maximizing the consistency of all similar instance pairs while ignoring the effect of feature redundancy on clustering performance. In this paper, to address the above issue, we design a dual mutual information constrained clustering method named DMICC which is based on deep contrastive clustering architecture, in which the dual mutual information constraints are particularly employed with solid theoretical guarantees and experimental validations. Specifically, at the feature level, we reduce the redundancy among features by minimizing the mutual information across all the dimensionalities to encourage the neural network to extract more discriminative features. At the instance level, we maximize the mutual information of the similar instance pairs to obtain more unbiased and robust representations. The dual mutual information constraints happen simultaneously and thus complement each other to jointly optimize better features that are suitable for the clustering task. We also prove that our adopted mutual information constraints are superior in feature extraction, and the proposed dual mutual information constraints are clearly bounded and thus solvable. Extensive experiments on five benchmark datasets show that our proposed approach outperforms most other clustering algorithms. The code is available at https://github.com/Li-Hyn/DMICC.

Co-author:Zhang Lefei

First Author:Li Hongyu

Indexed by:Journal paper

Correspondence Author:Su Kehua

Document Type:J

Volume:37

Page Number:8571-8579

Translation or Not:no

Date of Publication:2023-06-27

Included Journals:EI

Profile

苏科华,男,武汉大学计算机学院教授、博导;武汉大学科技成果转化中心(技术转移中心)副主任。研究主要集中在最优传输(Optimal Transport)领域,它是研究概率测度间最优变换的一类优化问题。在计算机图形学、机器视觉、人工智能、医学图像处理等领域有着广泛的应用。本人主要研究最优传输的几何计算理论和高效算法,并将其应用于网格保测参数化、三维场景优化、智能烧伤评估和卫星互联网任务优化中。主持包括国家自然科学基金、中央军科委、航天5院、华为公司等20多个项目支持,发表论文50余篇,获批发明专利10余项。为CCF计算机辅助设计与图形学(CAD/CG)和虚拟现实与可视化(TCVRV)专委会执行委员。