activity
20152025
most citedRobust Graph Learning from Noisy Data

305 citations · 1k across the 30 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

cs.SI2021

Multilayer Graph Contrastive Clustering Network

Liang Liu, Zhao Kang, Ling Tian +2

Multilayer graph has garnered plenty of research attention in many areas due to their high utility in modeling interdependent systems. However, clustering of multilayer graph, whic…

cs.LG2021★ 2 cited

Multi-view Contrastive Graph Clustering

Erlin Pan, Zhao Kang

With the explosive growth of information technology, multi-view graph data have become increasingly prevalent and valuable. Most existing multi-view clustering techniques either fo…

cs.LG2021★ 1 cited

Self-paced Principal Component Analysis

Zhao Kang, Hongfei Liu, Jiangxin Li +2

Principal Component Analysis (PCA) has been widely used for dimensionality reduction and feature extraction. Robust PCA (RPCA), under different robust distance metrics, such as l1-…

cs.CV2021★ 1 cited

Smoothed Multi-View Subspace Clustering

Peng Chen, Liang Liu, Zhengrui Ma +1

In recent years, multi-view subspace clustering has achieved impressive performance due to the exploitation of complementary imformation across multiple views. However, multi-view…

cs.CV2021★ 7 cited

Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering

Zhengrui Ma, Zhao Kang, Guangchun Luo +1

Finding a suitable data representation for a specific task has been shown to be crucial in many applications. The success of subspace clustering depends on the assumption that the…

cs.CV2021★ 146 cited

Pseudo-supervised Deep Subspace Clustering

Juncheng Lv, Zhao Kang, Xiao Lu +1

Auto-Encoder (AE)-based deep subspace clustering (DSC) methods have achieved impressive performance due to the powerful representation extracted using deep neural networks while pr…