Efficient Anchor Learning-based Multi-view Clustering -- A Late Fusion Method

Zhang, Tiejian; Liu, Xinwang; Zhu, En; Zhou, Sihang; Dong, Zhibin

doi:10.1145/3503161.3548124

Cited by 18 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hyper-parameter settings are summarized in Table 1 of Appendix. The clustering performance is evaluated by four metrics, i.e., ACC, NMI, ARI, and F1, which are widely used in both deep clustering (Liu et al 2022c;Xia et al 2022c;Bo et al 2020;Tu et al 2020;Liu et al 2022f) and traditional clustering (Zhou et al 2019;Zhang et al 2022bZhang et al , 2021Liu et al 2022b;Chen et al 2022b,a;Zhang et al 2022aZhang et al , 2020Sun et al 2021;Wan et al 2022;Wang et al 2022bWang et al , 2021a.…”

Section: Methodsmentioning

confidence: 99%

Hard Sample Aware Network for Contrastive Deep Graph Clustering

Liu

Yang

Zhou

et al. 2023

AAAI

View full text Add to dashboard Cite

Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample mining-based algorithms have achieved great attention for their promising performance. However, we find that the existing hard sample mining methods have two problems as follows. 1) In the hardness measurement, the important structural information is overlooked for similarity calculation, degrading the representativeness of the selected hard negative samples. 2) Previous works merely focus on the hard negative sample pairs while neglecting the hard positive sample pairs. Nevertheless, samples within the same cluster but with low similarity should also be carefully learned. To solve the problems, we propose a novel contrastive deep graph clustering method dubbed Hard Sample Aware Network (HSAN) by introducing a comprehensive similarity measure criterion and a general dynamic sample weighing strategy. Concretely, in our algorithm, the similarities between samples are calculated by considering both the attribute embeddings and the structure embeddings, better revealing sample relationships and assisting hardness measurement. Moreover, under the guidance of the carefully collected high-confidence clustering information, our proposed weight modulating function will first recognize the positive and negative samples and then dynamically up-weight the hard sample pairs while down-weighting the easy ones. In this way, our method can mine not only the hard negative samples but also the hard positive sample, thus improving the discriminative capability of the samples further. Extensive experiments and analyses demonstrate the superiority and effectiveness of our proposed method. The source code of HSAN is shared at https://github.com/yueliu1999/HSAN and a collection (papers, codes and, datasets) of deep graph clustering is shared at https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering on Github.

show abstract

Section: Methodsmentioning

confidence: 99%

Hard Sample Aware Network for Contrastive Deep Graph Clustering

Liu

Yang

Zhou

et al. 2023

AAAI

View full text Add to dashboard Cite

show abstract

“…However, the proposed method focuses mainly on the diversity of each view and lacks attention to consensus information between views. Zhou et al (2021) and Zhang et al (2022b) proposed using kernel k-means to nonlinearly map the original data and then learned the consensus matrix by minimizing kernel differences through kernel polarization (Wang et al 2009). The above works combine matrix factorization and constraints to improve the clustering performance while reducing the computational complexity.…”

Section: Algorithms Based On Matrix Factorizationmentioning

confidence: 99%

The methods for improving large-scale multi-view clustering efficiency: a survey

Yang,

Tan

2024

Artif Intell Rev

View full text Add to dashboard Cite

The diversity and large scale of multi-view data have brought more significant challenges to conventional clustering technology. Recently, multi-view clustering has received widespread attention because it can better use different views’ consensus and complementary information to improve clustering performance. Simultaneously, many researchers have proposed various algorithms to reduce the computational complexity to accommodate the demands of large-scale multi-view clustering. However, the current reviews do not summarize from the perspective of reducing the computational complexity of large-scale multi-view clustering. Therefore, this paper outlines various high-frequency methods used in recent years to reduce the computational complexity of large-scale multi-view clustering, i.e. third-order tensor t-SVD, anchors-based graph construction, matrix blocking, and matrix factorization, and compares the corresponding algorithms based on several open datasets. Finally, the strengths and weaknesses of the current algorithm and the point of improvement are analyzed.

show abstract

“…Eight benchmark datasets are used to testify the effectiveness of FCMVC-IV, including ORL 1 , proteinFold 2 , uci-digit 3 , Wiki 4 , Reuters 5 , Caltech256 6 , VGGFace2 7 and YouTube- Face10 8 . The detailed information of each dataset is summarized in Table I.…”

Section: A Experimental Settingsmentioning

confidence: 99%

“…Integrating multimodal information to make decisions play an essential role in the robot taking action. Also, in many situations, such as the recommender and decision support systems, how to uncover items' intrinsic structure and label them with multi-view data is crucial [8]- [14]. Multi-view clustering is a promising method to solve the above problems by exploring the consistent and complementary information of different data views and discovering the underlying data structure.…”

Section: Introductionmentioning

confidence: 99%

Continual Multi-view Clustering

Wan

Liu

Liang

et al. 2022

Proceedings of the 30th ACM International Conference on Multimedia

Self Cite

View full text Add to dashboard Cite

Multi-view clustering (MVC) has gained broad attention owing to its capacity to exploit consistent and complementary information across views. This paper focuses on a challenging issue in MVC called the incomplete continual data problem (ICDP). In specific, most existing algorithms assume that views are available in advance and overlook the scenarios where data observations of views are accumulated over time. Due to privacy considerations or memory limitations, previous views cannot be stored in these situations. Some works are proposed to handle it, but all fail to address incomplete views. Such an incomplete continual data problem (ICDP) in MVC is tough to solve since incomplete information with continual data increases the difficulty of extracting consistent and complementary knowledge among views. We propose Fast Continual Multi-View Clustering with Incomplete Views (FCMVC-IV) to address it. Specifically, it maintains a consensus coefficient matrix and updates knowledge with the incoming incomplete view rather than storing and recomputing all the data matrices. Considering that the views are incomplete, the newly collected view might contain samples that have yet to appear; two indicator matrices and a rotation matrix are developed to match matrices with different dimensions. Besides, we design a three-step iterative algorithm to solve the resultant problem in linear complexity with proven convergence. Comprehensive experiments on various datasets show the superiority of FCMVC-IV.

show abstract

Efficient Anchor Learning-based Multi-view Clustering -- A Late Fusion Method

Cited by 18 publications

References 28 publications

Hard Sample Aware Network for Contrastive Deep Graph Clustering

Hard Sample Aware Network for Contrastive Deep Graph Clustering

The methods for improving large-scale multi-view clustering efficiency: a survey

Continual Multi-view Clustering

Contact Info

Product

Resources

About