Dink-net: Neural clustering on large graphs
Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with
deep neural networks, has achieved promising progress in recent years. However, the …
deep neural networks, has achieved promising progress in recent years. However, the …
Sparse low-rank multi-view subspace clustering with consensus anchors and unified bipartite graph
Anchor technology is popularly employed in multi-view subspace clustering (MVSC) to
reduce the complexity cost. However, due to the sampling operation being performed on …
reduce the complexity cost. However, due to the sampling operation being performed on …
Fuzzy-based deep attributed graph clustering
Attributed graph (AG) clustering is a fundamental, yet challenging, task for studying
underlying network structures. Recently, a variety of graph representation learning models …
underlying network structures. Recently, a variety of graph representation learning models …
Reinforcement graph clustering with unknown cluster number
Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks
in an unsupervised manner, has attracted great attention in recent years. Although the …
in an unsupervised manner, has attracted great attention in recent years. Although the …
Contrastive and attentive graph learning for multi-view clustering
Graph-based multi-view clustering aims to take advantage of multiple view graph
information to provide clustering solutions. The consistency constraint of multiple views is …
information to provide clustering solutions. The consistency constraint of multiple views is …
Iterative deep structural graph contrast clustering for multiview raw data
Z Dong, J Jin, Y Xiao, S Wang, X Zhu… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Multiview clustering has attracted increasing attention to automatically divide instances into
various groups without manual annotations. Traditional shadow methods discover the …
various groups without manual annotations. Traditional shadow methods discover the …
Deep multi-view spectral clustering via ensemble
Graph-based methods have achieved great success in multi-view clustering. However,
existing graph-based models generally utilize shallow and linear embedding functions to …
existing graph-based models generally utilize shallow and linear embedding functions to …
Embedding graph auto-encoder for graph clustering
Graph clustering, aiming to partition nodes of a graph into various groups via an
unsupervised approach, is an attractive topic in recent years. To improve the representative …
unsupervised approach, is an attractive topic in recent years. To improve the representative …
Soft-orthogonal constrained dual-stream encoder with self-supervised clustering network for brain functional connectivity data
In many brain network studies, brain functional connectivity data is extracted from
neuroimaging data and then used for disease prediction. For now, brain disease data not …
neuroimaging data and then used for disease prediction. For now, brain disease data not …
QGRL: quaternion graph representation learning for heterogeneous feature data clustering
Clustering is one of the most commonly used techniques for unsupervised data analysis. As
real data sets are usually composed of numerical and categorical features that are …
real data sets are usually composed of numerical and categorical features that are …