Jie Mu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jie Mu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Linlin Zong
School of Software, Dalian University of Technology, Dalian, China
2 shared publications - Xianchao Zhang
Dalian University of Technology
2 shared publications - Guanglu Wang
School of Software, Dalian University of Technology, Dalian 116024, China
1 shared publication - Han Liu
Dalian University of Technology
1 shared publication - Mengyan Chen
Dalian University of Technology
1 shared publication - Xiaotong Zhang
Dalian University of Technology
1 shared publication
Latest Publications
- 27 May 2023
- Published by Springer Nature
- p. 223-235
Adaptive View-Aligned and Feature Augmentation Network for Partially View-Aligned Clustering
- 27 May 2023
- Published by Springer Nature
- p. 223-235
Adaptive View-Aligned and Feature Augmentation Network for Partially View-Aligned Clustering
- 15 April 2022
- Published by MIT Press in Neural Computation
- Vol. 34 (5) , 1256-1287
Graph Clustering With Graph Capsule Network
Graph clustering, which aims to partition a set of graphs into groups with similar structures, is a fundamental task in data analysis. With the great advances made by deep learning, deep graph clustering methods have achieved success. However, these methods have two limitations: (1) they learn graph embeddings by a neural language model that fails to effectively express graph properties, and (2) they treat embedding learning and clustering as two isolated processes, so the learned embeddings are unsuitable for the subsequent clustering. To overcome these limitations, we propose a novel capsule-based graph clustering (CGC) algorithm to cluster graphs. First, we construct a graph clustering capsule network (GCCN) that introduces capsules to capture graph properties. Second, we design an iterative optimization strategy to alternately update the GCCN parameters and clustering assignment parameters. This strategy leads GCCN to learn cluster-oriented graph embeddings. Experimental results show that our algorithm achieves performance superior to that of existing graph clustering algorithms in terms of three standard evaluation metrics: ACC, NMI, and ARI. Moreover, we use visualization results to analyze the effectiveness of the capsules and demonstrate that GCCN can learn cluster-oriented embeddings.
- 15 April 2022
- Published by MIT Press in Neural Computation
- Vol. 34 (5) , 1256-1287
Graph Clustering With Graph Capsule Network
Graph clustering, which aims to partition a set of graphs into groups with similar structures, is a fundamental task in data analysis. With the great advances made by deep learning, deep graph clustering methods have achieved success. However, these methods have two limitations: (1) they learn graph embeddings by a neural language model that fails to effectively express graph properties, and (2) they treat embedding learning and clustering as two isolated processes, so the learned embeddings are unsuitable for the subsequent clustering. To overcome these limitations, we propose a novel capsule-based graph clustering (CGC) algorithm to cluster graphs. First, we construct a graph clustering capsule network (GCCN) that introduces capsules to capture graph properties. Second, we design an iterative optimization strategy to alternately update the GCCN parameters and clustering assignment parameters. This strategy leads GCCN to learn cluster-oriented graph embeddings. Experimental results show that our algorithm achieves performance superior to that of existing graph clustering algorithms in terms of three standard evaluation metrics: ACC, NMI, and ARI. Moreover, we use visualization results to analyze the effectiveness of the capsules and demonstrate that GCCN can learn cluster-oriented embeddings.