Pith. sign in

REVIEW 3 major objections 5 minor 150 references

A Comprehensive Survey on Spectral Clustering with Graph Structure Learning

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that graph structure learning is the central and decisive stage of spectral clustering, and offers a taxonomy organizing the field around graph families, learning modes, and partitioning frameworks.

desk verdict A useful but carelessly assembled survey of spectral clustering with graph structure learning; the 'first and most extensive' claim is unsupported and the taxonomy has internal contradictions. read the letter →

arxiv 2501.13597 v2 pith:ZVXLKFEA submitted 2025-01-23 cs.LG

Kamal Berahmand , Farid Saberi-Movahed , Razieh Sheikhpour , Yuefeng Li , Mahdi Jalili This is my paper · ORCID
classification cs.LG MSC 68T1005C5062H30
keywords spectralclusteringgraphstructurelearningadaptiveneighborsanchorhypergraphmulti-viewone-stepfusion
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This survey argues that graph structure learning (GSL) is the pivotal stage in spectral clustering, and that how the similarity graph is built matters more than any later step. It claims to be the first comprehensive review devoted specifically to GSL within spectral clustering, organizing roughly sixty methods into a taxonomy with two axes: graph type (pairwise, anchor, hypergraph) and learning mode (fixed vs. adaptive). It further splits clustering pipelines by partition strategy (one-step vs. two-step) and by view count (single vs. multi-view), with multi-view fusion decomposed into consensus, complementary, and weighting mechanisms. The intended payoff is a map that lets researchers position new methods, choose graph construction strategies, and identify open problems.

What carries the argument

The load-bearing object is the GSL taxonomy: pairwise, anchor, and hypergraph graph architectures, each split into fixed and adaptive construction, crossed with one-step versus two-step partitioning and single- versus multi-view fusion. Within it, the adaptive neighbor model, the anchor-graph formulation, the hypergraph Laplacian, and the self-expressive subspace representation are the canonical exemplars that anchor each cell of the taxonomy. The survey's classification rules — for instance, whether the graph is predetermined or optimized inside a clustering objective — do the argumentative work of making GSL the organizing principle.

What would settle it

A systematic literature search for spectral clustering papers with graph structure learning published before 2025, using a defined query and inclusion criteria, would either reproduce the survey's coverage or find omissions; likewise, a benchmark comparing clustering accuracy across methods while holding data fixed would show whether graph construction indeed dominates other design choices. Any of these can be checked independently.

Watch

Extended reading notes

Core claim

The paper's central claim is that the entire spectral clustering literature can be organized around how the graph is constructed and learned. It partitions graph construction into three families — pairwise graphs, anchor graphs, and hypergraphs — each with fixed and adaptive variants, and shows that adaptive methods such as adaptive neighbors, self-expressive subspace recovery, and adaptive anchor or hypergraph learning have progressively replaced fixed protocols. A second axis separates one-step clustering, which jointly learns the spectral embedding and discrete cluster assignments, from the classical two-step relax-and-discretize pipeline. For multi-view data the survey identifies fusion as the fourth dimension: shared or consensus structure, complementary view-specific structure, and view weighting. If the taxonomy is right, it supplies the first unified terminology for a field that previously grew method-by-method.

Load-bearing premise

The survey assumes that the papers it selected are representative of the field and that its chosen categories—graph type, fixed versus adaptive, one-step versus two-step, single- versus multi-view—are the right organizing axes; if important methods are missing or misclassified, the claim of being the most extensive and accurate survey fails.

Editorial extensions

If this is right

  • New spectral clustering papers can be positioned in the taxonomy by specifying graph family, fixed or adaptive mode, partition strategy, and fusion method, making method comparison more systematic.
  • The survey's emphasis on adaptive graph learning implies that future gains in clustering accuracy will come substantially from better graph construction rather than from better partitioning alone.
  • For multi-view data, the consensus–complementary–weighting decomposition gives a checklist for designing fusion strategies and for deciding which view information to preserve.
  • The one-step versus two-step distinction clarifies a design tradeoff: joint optimization avoids information loss but restricts the objective, while two-step pipelines allow modularity at the cost of discretization errors.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the taxonomy becomes standard, the "most extensive" claim will eventually be superseded as new methods appear; the durable contribution would be the naming and ordering of the design space itself.
  • The same fixed-versus-adaptive axis could be applied to deep clustering and graph neural networks, where graph construction is often treated as a fixed preprocessing step rather than part of the learned objective.
  • A quantitative test measuring how much of the variance in clustering accuracy across surveyed methods is explained by graph construction versus partitioning would either support or weaken the paper's premise that GSL is the dominant factor.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. This survey organizes spectral clustering methods around graph structure learning (GSL), classifying graph construction into pairwise, anchor, and hypergraph approaches in both fixed and adaptive forms, and grouping algorithms into single-view versus multi-view and one-step versus two-step frameworks. It provides background on graph cuts, Laplacians, spectral embedding, and partitioning, and it offers comparative tables of methods. The stated contribution is a first-of-its-kind, most extensive survey with GSL at its center.

Significance. If the taxonomy were reliable, the survey would be a useful reference for researchers entering spectral clustering with an emphasis on GSL. The mathematical background is mostly standard and reproduced without major distortion, and the organizational tables condense a large literature. However, the centrality of GSL is asserted rather than empirically demonstrated, and the paper's 'most extensive' claim is not backed by a reproducible selection protocol. Several internal inconsistencies in the tables and prose currently undermine the utility of the taxonomy.

major comments (3)
  1. [Section IV.B.2 and Table VIII] The classification of DSC is internally contradictory. Table VIII, row 2, lists DSC (2019) with anchor selection 'K-means', anchor graph 'Fixed', and similarity matrix 'Gram'; Section IV.B.2 states that DSC 'adopts k-means for anchor selection and constructs adaptive anchor graphs' and 'generates similarity matrices via bipartite graphs.' At least one of these is wrong. Because the survey's central contribution is a classification of GSL methods, this contradiction materially reduces confidence in the taxonomy. The authors should correct the entry and add a source-level audit, or at least an explicit paper-by-paper justification, for each table row.
  2. [Table VI] Rows 6 (MVGL, 2018) and 7 (OMSC, 2019) have no citation keys and no corresponding descriptions in Section IV.B.1. Without references or text descriptions, the reader cannot verify the classification, and the completeness claim 'most extensive and detailed survey' is untestable for exactly the kind of entries that should be traceable. Add citations and short descriptions, or remove the rows.
  3. [Section I] The claim 'For the first time, we present the most extensive and detailed survey on spectral clustering, with a particular emphasis on GSL' is not supported by a methodology. The paper reports no search protocol, inclusion/exclusion criteria, time window, or coverage comparison against the acknowledged prior survey [34]. A survey's value depends on reproducible coverage; either add a methodology subsection or soften the claim to a scope statement.
minor comments (5)
  1. [Section III.A.2.b, Eq. (13)] The constraint in Eq. (13) is written as \sum_{j=1}^n w_{ij}=1 while w_{ij} is defined over the m anchors; this should be \sum_{j=1}^m w_{ij}=1.
  2. [Section IV.A.1 and Table II] The heading 'Adaptive Neighbor Methods:' is repeated twice, and the text says 'PTAG [73]' while Table II row 12 lists 'CTAG (2023) [73]'. Unify the name and citation.
  3. [Section I] There is a typo 'Thye previous survey' that should read 'The previous survey'.
  4. [Section IV.B.1] In the paragraph on IMVSC, 'alternating optimizationoptimization' contains a duplicated word.
  5. [Section III.C.2.b and Table VIII] Reference [66] is used for two different methods: in Section III.C.2.b it is cited as 'Discrete Spectral Clustering (DSC)' for Eq. (29), while in Table VIII it is used for the multi-view anchor-graph method 'DSC (2019)'. The reference list identifies [66] as Luo et al., 'Discrete multi-graph clustering' (TIP 2019), a multi-view method; one of these usages is likely a misattribution. Clarify which method Eq. (29) is taken from.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the survey's classifications and background material are reported from the cited literature, with no derivation that reduces to its own inputs.

full rationale

This is a survey paper, not a derivation or prediction paper. Its content consists of background definitions (graph cuts, Laplacians, spectral embedding), a taxonomy of spectral clustering methods, and tables categorizing external works by graph construction and partitioning strategy. No parameter is fitted, no quantity is predicted from data, and no central claim is obtained by assuming its own conclusion. The only self-citation in the reference list, [18] (Berahmand et al. on graph regularized NMF for community detection), is used as a general citation for NMF in the introduction and is not load-bearing for any taxonomical or scientific claim in the survey. The paper does invoke its own novelty claim ('For the first time, we present the most extensive and detailed survey...'), but that is an assertion of scope and completeness, not a circular derivation; even if the absence of a documented search protocol makes the claim hard to verify, that is a correctness/rigor limitation, not circularity. The apparent internal inconsistency in Table VIII vs. Section IV.B.2 regarding the classification of DSC [66] (fixed Gram vs. adaptive bipartite) is a factual/taxonomic error risk, not an instance of a result being equivalent to its inputs by construction. Under the hard rules, circularity requires quoting a specific reduction or a fitted parameter renamed as a prediction; no such step exists here. The honest finding is therefore no significant circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

Because the paper is a survey, it introduces no free parameters and no invented entities. The central framing assumptions and the standard mathematical tools it relies on are listed as axioms.

assumptions (4)
  • domain assumption The similarity graph construction is the factor that most determines spectral clustering performance.
    This is the organizing premise of the survey, stated in the introduction: the graph 'significantly influences the spectral embedding and, consequently, the clustering results.' The paper does not quantify this claim with experiments.
  • standard math Ky Fan's theorem and the multiplicity of the zero eigenvalue characterize the number of connected components of a graph Laplacian.
    Invoked in Section III.C (one-step continuous methods, Eq. (25)) to justify learning a similarity matrix whose Laplacian has exactly k zero eigenvalues.
  • standard math Relaxing discrete cluster indicators to real-valued matrices preserves enough cluster structure for useful spectral clustering solutions.
    Standard relaxation of the NP-hard graph-cut problem, used in Section II.B and attributed to von Luxburg [19]; the survey does not reprove it.
  • domain assumption Self-expressive methods assume data points lie near a union of low-dimensional subspaces.
    This assumption underlies the SSC, LRR, and related families reviewed in Section III.A.1.b and the tables; it limits applicability when the subspace model is not satisfied.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Comprehensive Survey on Spectral Clustering with Graph Structure Learning." pith.science (2026). https://pith.science/paper/ZVXLKFEA

@misc{pith2026250113597,
  author       = {Pith},
  title        = {Pith review of: A Comprehensive Survey on Spectral Clustering with Graph Structure Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZVXLKFEA}},
  note         = {Machine review of arXiv:2501.13597}
}
read the original abstract

Spectral clustering is a powerful technique for clustering high-dimensional data, utilizing graph-based representations to detect complex, non-linear structures and non-convex clusters. The construction of a similarity graph is essential for ensuring accurate and effective clustering, making graph structure learning (GSL) central for enhancing spectral clustering performance in response to the growing demand for scalable solutions. Despite advancements in GSL, there is a lack of comprehensive surveys specifically addressing its role within spectral clustering. To bridge this gap, this survey presents a comprehensive review of spectral clustering methods, emphasizing on the critical role of GSL. We explore various graph construction techniques, including pairwise, anchor, and hypergraph-based methods, in both fixed and adaptive settings. Additionally, we categorize spectral clustering approaches into single-view and multi-view frameworks, examining their applications within one-step and two-step clustering processes. We also discuss multi-view information fusion techniques and their impact on clustering data. By addressing current challenges and proposing future research directions, this survey provides valuable insights for advancing spectral clustering methodologies and highlights the pivotal role of GSL in tackling large-scale and high-dimensional data clustering tasks.

Figures

Figures reproduced from arXiv: 2501.13597 by the authors.

Figure 1
Figure 1. Exploring Clustering Methods: From Traditional to [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 3
Figure 3. Graph Structure Learning Methods. among the data points, meaning that points within the same cluster should exhibit strong connections with high similarity values, unlike points belonging to different clusters. When constructing pairwise graphs from a dataset with the pairwise similarities, the primary objective is to capture either the local neighborhood relationships between data points or the broader, global stru… view at source ↗
Figure 4
Figure 4. Multi-view Spectral Clustering Framework. [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

150 extracted references · 75 canonical work pages

  1. [34]

    Survey of spectral clustering based on graph theory,

    L. Ding, C. Li, D. Jin, and S. Ding, “Survey of spectral clustering based on graph theory,” Pattern Recognition, p. 110366, 2024

    2024

  2. [1]

    A comprehensive survey of fast graph clustering,

    J. Xue, L. Xing, Y . Wang, X. Fan, L. Kong, Q. Zhang, F. Nie, and X. Li, “A comprehensive survey of fast graph clustering,”Vicinagearth, vol. 1, no. 1, pp. 1–22, 2024

    2024

  3. [2]

    An efficient spectral clustering algorithm based on granular-ball,

    J. Xie, W. Kong, S. Xia, G. Wang, and X. Gao, “An efficient spectral clustering algorithm based on granular-ball,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 9, pp. 9743–9753, 2023

    2023

  4. [3]

    A comprehensive review of clustering tech- niques in artificial intelligence for knowledge discovery: Taxonomy, challenges, applications and future prospects,

    J. Singh and D. Singh, “A comprehensive review of clustering tech- niques in artificial intelligence for knowledge discovery: Taxonomy, challenges, applications and future prospects,” Advanced Engineering Informatics, vol. 62, p. 102799, 2024

    2024

  5. [4]

    A review of convex clustering from multiple perspectives: models, optimizations, statistical properties, applications, and connections,

    Q. Feng, C. P. Chen, and L. Liu, “A review of convex clustering from multiple perspectives: models, optimizations, statistical properties, applications, and connections,” IEEE Transactions on Neural Networks and Learning Systems , 2023

    2023

  6. [5]

    Clustering of social media data and marketing decisions,

    T. Benslama and R. Jallouli, “Clustering of social media data and marketing decisions,” in Digital Economy. Emerging Technologies and Business Innovation: 5th International Conference on Digital Economy, ICDEc 2020, Bucharest, Romania, June 11–13, 2020, Proceedings 5 . Springer, 2020, pp. 53–65

    2020

  7. [6]

    Learning distilled graph for large-scale social network data clustering,

    W. Liu, D. Gong, M. Tan, J. Q. Shi, Y . Yang, and A. G. Hauptmann, “Learning distilled graph for large-scale social network data clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 32, no. 7, pp. 1393–1404, 2019

    2019

  8. [7]

    Image co-segmentation via locally biased discriminative clustering,

    X. Liang, D. Wu, and D.-S. Huang, “Image co-segmentation via locally biased discriminative clustering,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 11, pp. 2228–2233, 2019

    2019

Show all 150 references
  1. [8]

    Spectral clustering and its use in bioinformatics,

    D. J. Higham, G. Kalna, and M. Kibble, “Spectral clustering and its use in bioinformatics,” Journal of computational and applied mathematics , vol. 204, no. 1, pp. 25–37, 2007

    2007

  2. [9]

    Clustering-based anomaly detection in multivariate time series data,

    J. Li, H. Izakian, W. Pedrycz, and I. Jamal, “Clustering-based anomaly detection in multivariate time series data,” Applied Soft Computing , vol. 100, p. 106919, 2021

    2021

  3. [10]

    Document clustering using locality preserving indexing,

    D. Cai, X. He, and J. Han, “Document clustering using locality preserving indexing,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 12, pp. 1624–1637, 2005

    2005

  4. [11]

    From partition-based clustering to density-based clustering: Fast find clusters with diverse shapes and densities in spatial databases,

    J. Wang, C. Zhu, Y . Zhou, X. Zhu, Y . Wang, and W. Zhang, “From partition-based clustering to density-based clustering: Fast find clusters with diverse shapes and densities in spatial databases,” IEEE access , vol. 6, pp. 1718–1729, 2017

    2017

  5. [12]

    Synchronization- inspired partitioning and hierarchical clustering,

    J. Shao, X. He, C. B ¨ohm, Q. Yang, and C. Plant, “Synchronization- inspired partitioning and hierarchical clustering,” IEEE Transactions on Knowledge and Data Engineering , vol. 25, no. 4, pp. 893–905, 2012

    2012

  6. [13]

    Density-based clustering by means of bridge point identification,

    L. Colomba, L. Cagliero, and P. Garza, “Density-based clustering by means of bridge point identification,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 11, pp. 11 274–11 287, 2022

    2022

  7. [14]

    Probabilistic models for clustering,

    H. Deng and J. Han, “Probabilistic models for clustering,” in Data Clustering. Chapman and Hall/CRC, 2018, pp. 61–86

    2018

  8. [15]

    Algorithms for hierarchical clustering: an overview, ii,

    F. Murtagh and P. Contreras, “Algorithms for hierarchical clustering: an overview, ii,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 7, no. 6, p. e1219, 2017

    2017

  9. [16]

    Hierarchical latent context representation for context-aware recommendations,

    M. Unger and A. Tuzhilin, “Hierarchical latent context representation for context-aware recommendations,” IEEE Transactions on Knowl- edge and Data Engineering , vol. 34, no. 7, pp. 3322–3334, 2020

    2020

  10. [17]

    dbscan: Fast density- based clustering with r,

    M. Hahsler, M. Piekenbrock, and D. Doran, “dbscan: Fast density- based clustering with r,” Journal of Statistical Software , vol. 91, pp. 1–30, 2019

    2019

  11. [18]

    Graph regularized nonnegative matrix factorization for community detection in attributed networks,

    K. Berahmand, M. Mohammadi, F. Saberi-Movahed, Y . Li, and Y . Xu, “Graph regularized nonnegative matrix factorization for community detection in attributed networks,” IEEE Transactions on Network Science and Engineering , vol. 10, no. 1, pp. 372–385, 2022

    2022

  12. [19]

    A tutorial on spectral clustering,

    U. V on Luxburg, “A tutorial on spectral clustering,” Statistics and computing, vol. 17, pp. 395–416, 2007

    2007

  13. [20]

    Multi-view spectral clustering with high-order optimal neighborhood laplacian matrix,

    W. Liang, S. Zhou, J. Xiong, X. Liu, S. Wang, E. Zhu, Z. Cai, and X. Xu, “Multi-view spectral clustering with high-order optimal neighborhood laplacian matrix,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 7, pp. 3418–3430, 2020

    2020

  14. [21]

    A survey of kernel and spectral methods for clustering,

    M. Filippone, F. Camastra, F. Masulli, and S. Rovetta, “A survey of kernel and spectral methods for clustering,” Pattern recognition, vol. 41, no. 1, pp. 176–190, 2008

    2008

  15. [22]

    Deep clustering: A comprehensive survey,

    Y . Ren, J. Pu, Z. Yang, J. Xu, G. Li, X. Pu, S. Y . Philip, and L. He, “Deep clustering: A comprehensive survey,” IEEE Transactions on Neural Networks and Learning Systems , 2024

    2024

  16. [23]

    New spectral methods for ratio cut partitioning and clustering,

    L. Hagen and A. B. Kahng, “New spectral methods for ratio cut partitioning and clustering,” IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems , vol. 11, no. 9, pp. 1074– 1085, 1992

    1992

  17. [24]

    Normalized cuts and image segmentation,

    J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 22, no. 8, pp. 888–905, 2000

    2000

  18. [25]

    Discrete nonnegative spectral clustering,

    Y . Yang, F. Shen, Z. Huang, H. T. Shen, and X. Li, “Discrete nonnegative spectral clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 9, pp. 1834–1845, 2017

    2017

  19. [26]

    Effective clustering via structured graph learning,

    D. Wu, F. Nie, J. Lu, R. Wang, and X. Li, “Effective clustering via structured graph learning,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 8, pp. 7909–7920, 2022

    2022

  20. [27]

    Fast multi-view discrete clustering with anchor graphs,

    Q. Qiang, B. Zhang, F. Wang, and F. Nie, “Fast multi-view discrete clustering with anchor graphs,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 11, 2021, pp. 9360–9367

    2021

  21. [28]

    Efficient and robust multiview clustering with anchor graph regularization,

    B. Yang, X. Zhang, Z. Lin, F. Nie, B. Chen, and F. Wang, “Efficient and robust multiview clustering with anchor graph regularization,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 32, no. 9, pp. 6200–6213, 2022

    2022

  22. [29]

    Hypergraph spectral clustering for point cloud segmentation,

    S. Zhang, S. Cui, and Z. Ding, “Hypergraph spectral clustering for point cloud segmentation,” IEEE Signal Processing Letters , vol. 27, pp. 1655–1659, 2020

    2020

  23. [30]

    Hypergraph spectral clustering in the weighted stochastic block model,

    K. Ahn, K. Lee, and C. Suh, “Hypergraph spectral clustering in the weighted stochastic block model,” IEEE Journal of Selected Topics in Signal Processing, vol. 12, no. 5, pp. 959–974, 2018

    2018

  24. [31]

    Image segmentation based on multiscale fast spectral clustering,

    C. Zhang, G. Zhu, B. Lian, M. Chen, H. Chen, and C. Wu, “Image segmentation based on multiscale fast spectral clustering,” Multimedia Tools and Applications, vol. 80, pp. 24 969–24 994, 2021

    2021

  25. [32]

    Text document clustering using spectral clustering algorithm with particle swarm optimization,

    R. Janani and S. Vijayarani, “Text document clustering using spectral clustering algorithm with particle swarm optimization,” Expert Systems with Applications, vol. 134, pp. 192–200, 2019

    2019

  26. [33]

    Ls-svm based spectral clustering and regression for predicting maintenance of industrial machines,

    R. Langone, C. Alzate, B. De Ketelaere, J. Vlasselaer, W. Meert, and J. A. Suykens, “Ls-svm based spectral clustering and regression for predicting maintenance of industrial machines,” Engineering Applica- tions of Artificial Intelligence , vol. 37, pp. 268–278, 2015

    2015

  27. [35]

    Spectral clustering by joint spectral embedding and spectral rotation,

    Y . Pang, J. Xie, F. Nie, and X. Li, “Spectral clustering by joint spectral embedding and spectral rotation,” IEEE transactions on cybernetics , vol. 50, no. 1, pp. 247–258, 2018

    2018

  28. [36]

    Spectral rotation versus k-means in spectral clustering,

    J. Huang, F. Nie, and H. Huang, “Spectral rotation versus k-means in spectral clustering,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 27, no. 1, 2013, pp. 431–437

    2013

  29. [37]

    Structured graph learning for scalable subspace clustering: From single view to multiview,

    Z. Kang, Z. Lin, X. Zhu, and W. Xu, “Structured graph learning for scalable subspace clustering: From single view to multiview,” IEEE Transactions on Cybernetics , vol. 52, no. 9, pp. 8976–8986, 2021

    2021

  30. [38]

    Deep graph structure learning for robust representations: A survey,

    Y . Zhu, W. Xu, J. Zhang, Q. Liu, S. Wu, and L. Wang, “Deep graph structure learning for robust representations: A survey,” arXiv preprint arXiv:2103.03036, vol. 14, pp. 1–1, 2021

    2021 arXiv

  31. [39]

    A survey on laplacian eigenmaps based manifold learning methods,

    B. Li, Y .-R. Li, and X.-L. Zhang, “A survey on laplacian eigenmaps based manifold learning methods,” Neurocomputing, vol. 335, pp. 336– 351, 2019

    2019

  32. [40]

    Graph-based semi-supervised learning: A review,

    Y . Chong, Y . Ding, Q. Yan, and S. Pan, “Graph-based semi-supervised learning: A review,” Neurocomputing, vol. 408, pp. 216–230, 2020. 19

    2020

  33. [41]

    On spectral clustering: Analysis and an algorithm,

    A. Ng, M. Jordan, and Y . Weiss, “On spectral clustering: Analysis and an algorithm,” Advances in Neural Information Processing Systems , vol. 14, 2001

    2001

  34. [42]

    Clustering and projected clustering with adaptive neighbors,

    F. Nie, X. Wang, and H. Huang, “Clustering and projected clustering with adaptive neighbors,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 977–986

    2014

  35. [43]

    One-step spectral clustering via dynamically learning affinity matrix and subspace,

    X. Zhu, W. He, Y . Li, Y . Yang, S. Zhang, R. Hu, and Y . Zhu, “One-step spectral clustering via dynamically learning affinity matrix and subspace,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31, no. 1, 2017

    2017

  36. [44]

    The constrained Laplacian rank algorithm for graph-based clustering,

    F. Nie, X. Wang, M. Jordan, and H. Huang, “The constrained Laplacian rank algorithm for graph-based clustering,” in Proceedings of the AAAI conference on artificial intelligence , vol. 30, no. 1, 2016

    2016

  37. [45]

    Sparse subspace clustering: Algorithm, theory, and applications,

    E. Elhamifar and R. Vidal, “Sparse subspace clustering: Algorithm, theory, and applications,” IEEE transactions on pattern analysis and machine intelligence, vol. 35, no. 11, pp. 2765–2781, 2013

    2013

  38. [46]

    Fast clustering with anchor guidance,

    F. Nie, J. Xue, W. Yu, and X. Li, “Fast clustering with anchor guidance,” IEEE Transactions on Pattern Analysis and Machine In- telligence, 2023

    2023

  39. [47]

    Unsupervised large graph embedding based on balanced and hierarchical K-means,

    F. Nie, W. Zhu, and X. Li, “Unsupervised large graph embedding based on balanced and hierarchical K-means,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 4, pp. 2008–2019, 2020

    2008

  40. [48]

    Efficient discrete clustering with anchor graph,

    J. Wang, Z. Ma, F. Nie, and X. Li, “Efficient discrete clustering with anchor graph,” IEEE Transactions on Neural Networks and Learning Systems, 2023

    2023

  41. [49]

    Large scale spectral clustering via landmark- based sparse representation,

    D. Cai and X. Chen, “Large scale spectral clustering via landmark- based sparse representation,” IEEE Transactions on Cybernetics , vol. 45, no. 8, pp. 1669–1680, 2015

    2015

  42. [50]

    Unsupervised optimized bipar- tite graph embedding,

    J. Zhu, L. Tao, H. Yang, and F. Nie, “Unsupervised optimized bipar- tite graph embedding,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 3, pp. 3224–3238, 2021

    2021

  43. [51]

    Fast spectral clustering with self-adapted bipartite graph learning,

    X. Yang, M. Zhu, Y . Cai, Z. Wang, and F. Nie, “Fast spectral clustering with self-adapted bipartite graph learning,” Information Sciences, vol. 644, p. 118810, 2023

    2023

  44. [52]

    Learning with hypergraphs: Clustering, classification, and embedding,

    D. Zhou, J. Huang, and B. Sch ¨olkopf, “Learning with hypergraphs: Clustering, classification, and embedding,” Advances in Neural Infor- mation Processing Systems , vol. 19, 2006

    2006

  45. [53]

    Hypergraph learning: Methods and practices,

    Y . Gao, Z. Zhang, H. Lin, X. Zhao, S. Du, and C. Zou, “Hypergraph learning: Methods and practices,” IEEE Transactions on Pattern Anal- ysis and Machine Intelligence , vol. 44, no. 5, pp. 2548–2566, 2020

    2020

  46. [54]

    A survey on hypergraph representation learning,

    A. Antelmi, G. Cordasco, M. Polato, V . Scarano, C. Spagnuolo, and D. Yang, “A survey on hypergraph representation learning,” ACM Computing Surveys, vol. 56, no. 1, pp. 1–38, 2023

    2023

  47. [55]

    Unsupervised spectral feature selection with dynamic hyper-graph learning,

    X. Zhu, S. Zhang, Y . Zhu, P. Zhu, and Y . Gao, “Unsupervised spectral feature selection with dynamic hyper-graph learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 34, no. 6, pp. 3016–3028, 2020

    2020

  48. [56]

    Video object segmentation by hypergraph cut,

    Y . Huang, Q. Liu, and D. Metaxas, “Video object segmentation by hypergraph cut,” in 2009 IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2009, pp. 1738–1745

    2009

  49. [57]

    3-D object retrieval and recognition with hypergraph analysis,

    Y . Gao, M. Wang, D. Tao, R. Ji, and Q. Dai, “3-D object retrieval and recognition with hypergraph analysis,” IEEE Transactions on Image Processing, vol. 21, no. 9, pp. 4290–4303, 2012

    2012

  50. [58]

    Visual classification by ℓ1-hypergraph modeling,

    M. Wang, X. Liu, and X. Wu, “Visual classification by ℓ1-hypergraph modeling,” IEEE Transactions on Knowledge and Data Engineering , vol. 27, no. 9, pp. 2564–2574, 2015

    2015

  51. [59]

    Robust ℓ2- hypergraph and its applications,

    T. Jin, Z. Yu, Y . Gao, S. Gao, X. Sun, and C. Li, “Robust ℓ2- hypergraph and its applications,” Information Sciences , vol. 501, pp. 708–723, 2019

    2019

  52. [60]

    Elastic net hypergraph learning for image clustering and semi-supervised classification,

    Q. Liu, Y . Sun, C. Wang, T. Liu, and D. Tao, “Elastic net hypergraph learning for image clustering and semi-supervised classification,” IEEE Transactions on Image Processing , vol. 26, no. 1, pp. 452–463, 2016

    2016

  53. [61]

    Adaptive hypergraph learning for unsupervised feature selection,

    X. Zhu, Y . Zhu, S. Zhang, R. Hu, and W. He, “Adaptive hypergraph learning for unsupervised feature selection,” in Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, 2017, pp. 3581–3587

    2017

  54. [62]

    Ghojogh, M

    B. Ghojogh, M. Crowley, F. Karray, and A. Ghodsi, Elements of dimensionality reduction and manifold learning . Springer, 2023

    2023

  55. [63]

    Low-rank discrete multi- view spectral clustering,

    Y . Yun, J. Li, Q. Gao, M. Yang, and X. Gao, “Low-rank discrete multi- view spectral clustering,” Neural Networks , vol. 166, pp. 137–147, 2023

    2023

  56. [64]

    Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding,

    Z. Hu, F. Nie, R. Wang, and X. Li, “Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding,” Informa- tion Fusion, vol. 55, pp. 251–259, 2020

    2020

  57. [65]

    SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering,

    D. Kuang, S. Yun, and H. Park, “SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering,” Journal of Global Optimization, vol. 62, no. 3, pp. 545–574, 2015

    2015

  58. [66]

    Dis- crete multi-graph clustering,

    M. Luo, C. Yan, Q. Zheng, X. Chang, L. Chen, and F. Nie, “Dis- crete multi-graph clustering,” IEEE Transactions on Image Processing, vol. 28, no. 9, pp. 4701–4712, 2019

    2019

  59. [67]

    Orthogonal and nonnegative graph reconstruction for large scale clustering,

    J. Han, K. Xiong, and F. Nie, “Orthogonal and nonnegative graph reconstruction for large scale clustering,” in Proceedings of the Twenty- Sixth International Joint Conference on Artificial Intelligence, IJCAI- 17, 2017, pp. 1809–1815

    2017

  60. [68]

    Knn-sc: novel spectral clustering algorithm using k-nearest neigh- bors,

    J.-H. Kim, J.-H. Choi, Y .-H. Park, C. K.-S. Leung, and A. Nasridinov, “Knn-sc: novel spectral clustering algorithm using k-nearest neigh- bors,” IEEE Access, vol. 9, pp. 152 616–152 627, 2021

    2021

  61. [69]

    Self-weighted clustering with adaptive neighbors,

    F. Nie, D. Wu, R. Wang, and X. Li, “Self-weighted clustering with adaptive neighbors,” IEEE transactions on neural networks and learn- ing systems, vol. 31, no. 9, pp. 3428–3441, 2020

    2020

  62. [70]

    Entropy regularization for unsupervised clustering with adaptive neighbors,

    J. Wang, Z. Ma, F. Nie, and X. Li, “Entropy regularization for unsupervised clustering with adaptive neighbors,” Pattern Recognition, vol. 125, p. 108517, 2022

    2022

  63. [71]

    Spectral rotation for deep one-step clustering,

    X. Zhu, Y . Zhu, and W. Zheng, “Spectral rotation for deep one-step clustering,” Pattern Recognition, vol. 105, p. 107175, 2020

    2020

  64. [72]

    Spectral clustering with adaptive neighbors for deep learning,

    Y . Zhao and X. Li, “Spectral clustering with adaptive neighbors for deep learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 4, pp. 2068–2078, 2021

    2021

  65. [73]

    Typicality- aware adaptive similarity matrix for unsupervised learning,

    J. Zhou, C. Gao, X. Wang, Z. Lai, J. Wan, and X. Yue, “Typicality- aware adaptive similarity matrix for unsupervised learning,” IEEE Transactions on Neural Networks and Learning Systems , 2023

    2023

  66. [74]

    Rank- constrained spectral clustering with flexible embedding,

    Z. Li, F. Nie, X. Chang, L. Nie, H. Zhang, and Y . Yang, “Rank- constrained spectral clustering with flexible embedding,” IEEE trans- actions on neural networks and learning systems , vol. 29, no. 12, pp. 6073–6082, 2018

    2018

  67. [75]

    Spectral clustering in heteroge- neous information networks,

    X. Li, B. Kao, Z. Ren, and D. Yin, “Spectral clustering in heteroge- neous information networks,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 33, no. 01, 2019, pp. 4221–4228

    2019

  68. [76]

    New approach for learning structured graph with laplacian rank constraint,

    Y . Duan, F. Nie, R. Wang, and X. Li, “New approach for learning structured graph with laplacian rank constraint,” Neurocomputing, p. 128065, 2024

    2024

  69. [77]

    Spectral embedded adaptive neighbors clustering,

    Q. Wang, Z. Qin, F. Nie, and X. Li, “Spectral embedded adaptive neighbors clustering,” IEEE transactions on neural networks and learning systems, vol. 30, no. 4, pp. 1265–1271, 2018

    2018

  70. [78]

    Robust recovery of subspace structures by low-rank representation,

    G. Liu, Z. Lin, S. Yan, J. Sun, Y . Yu, and Y . Ma, “Robust recovery of subspace structures by low-rank representation,” IEEE transactions on pattern analysis and machine intelligence , vol. 35, no. 1, pp. 171–184, 2012

    2012

  71. [79]

    Robust and efficient subspace segmentation via least squares regres- sion,

    C.-Y . Lu, H. Min, Z.-Q. Zhao, L. Zhu, D.-S. Huang, and S. Yan, “Robust and efficient subspace segmentation via least squares regres- sion,” in Computer Vision–ECCV 2012: 12th European Conference on Computer Vision, Florence, Italy, October 7-13, 2012, Proceedings, Part VII 12...

    2012

  72. [80]

    Smooth representation clustering,

    H. Hu, Z. Lin, J. Feng, and J. Zhou, “Smooth representation clustering,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2014, pp. 3834–3841

    2014

  73. [81]

    Enhancing low-rank subspace clustering by manifold regularization,

    J. Liu, Y . Chen, J. Zhang, and Z. Xu, “Enhancing low-rank subspace clustering by manifold regularization,” IEEE Transactions on Image Processing, vol. 23, no. 9, pp. 4022–4030, 2014

    2014

  74. [82]

    Dual graph regularized latent low-rank representation for subspace clustering,

    M. Yin, J. Gao, Z. Lin, Q. Shi, and Y . Guo, “Dual graph regularized latent low-rank representation for subspace clustering,” IEEE Transac- tions on Image Processing , vol. 24, no. 12, pp. 4918–4933, 2015

    2015

  75. [83]

    Graph regularized compact low rank representation for subspace clustering,

    S. Du, Y . Ma, and Y . Ma, “Graph regularized compact low rank representation for subspace clustering,” Knowledge-Based Systems, vol. 118, pp. 56–69, 2017

    2017

  76. [84]

    Deep subspace clus- tering networks,

    P. Ji, T. Zhang, H. Li, M. Salzmann, and I. Reid, “Deep subspace clus- tering networks,” Advances in neural information processing systems , vol. 30, 2017

    2017

  77. [85]

    Structured autoencoders for subspace clustering,

    X. Peng, J. Feng, S. Xiao, W.-Y . Yau, J. T. Zhou, and S. Yang, “Structured autoencoders for subspace clustering,” IEEE Transactions on Image Processing , vol. 27, no. 10, pp. 5076–5086, 2018

    2018

  78. [86]

    Low-rank representation with adaptive graph regularization,

    J. Wen, X. Fang, Y . Xu, C. Tian, and L. Fei, “Low-rank representation with adaptive graph regularization,” Neural Networks , vol. 108, pp. 83–96, 2018

    2018

  79. [87]

    Low- rank sparse subspace for spectral clustering,

    X. Zhu, S. Zhang, Y . Li, J. Zhang, L. Yang, and Y . Fang, “Low- rank sparse subspace for spectral clustering,” IEEE Transactions on knowledge and data engineering , vol. 31, no. 8, pp. 1532–1543, 2018

    2018

  80. [88]

    One-step spectral clustering based on self-paced learning,

    T. Tong, J. Gan, G. Wen, and Y . Li, “One-step spectral clustering based on self-paced learning,” Pattern Recognition Letters, vol. 135, pp. 8–14, 2020. 20

    2020

  81. [89]

    Subspace clustering via joint ℓ1,2 and ℓ2,1 norms,

    W. Dong, X.-J. Wu, and J. Kittler, “Subspace clustering via joint ℓ1,2 and ℓ2,1 norms,” Information Sciences, vol. 612, pp. 675–686, 2022

    2022

  82. [90]

    Fast spectral clustering with efficient large graph construction,

    W. Zhu, F. Nie, and X. Li, “Fast spectral clustering with efficient large graph construction,” in 2017 IEEE international conference on acoustics, speech and signal processing (ICASSP) . IEEE, 2017, pp. 2492–2496

    2017

  83. [91]

    Fast spectral clustering with anchor graph for large hyperspectral images,

    R. Wang, F. Nie, and W. Yu, “Fast spectral clustering with anchor graph for large hyperspectral images,” IEEE Geoscience and Remote Sensing Letters, vol. 14, no. 11, pp. 2003–2007, 2017

    2003

  84. [92]

    Scalable graph-based clustering with nonnegative relaxation for large hyperspectral image,

    R. Wang, F. Nie, Z. Wang, F. He, and X. Li, “Scalable graph-based clustering with nonnegative relaxation for large hyperspectral image,” IEEE Transactions on Geoscience and Remote Sensing, vol. 57, no. 10, pp. 7352–7364, 2019

    2019

  85. [93]

    Robust landmark graph-based clustering for high-dimensional data,

    B. Yang, J. Wu, A. Sun, N. Gao, and X. Zhang, “Robust landmark graph-based clustering for high-dimensional data,” Neurocomputing, vol. 496, pp. 72–84, 2022

    2022

  86. [94]

    FGC SS: Fast graph clustering method by joint spectral embedding and improved spectral rotation,

    J. Chen, J. Zhu, S. Xie, H. Yang, and F. Nie, “FGC SS: Fast graph clustering method by joint spectral embedding and improved spectral rotation,” Information Sciences, vol. 613, pp. 853–870, 2022

    2022

  87. [95]

    Reskm: a general framework to accelerate large-scale spectral clustering,

    G. Yang, S. Deng, X. Chen, C. Chen, Y . Yang, Z. Gong, and Z. Hao, “Reskm: a general framework to accelerate large-scale spectral clustering,” Pattern Recognition, vol. 137, p. 109275, 2023

    2023

  88. [96]

    Fast opti- mization of spectral embedding and improved spectral rotation,

    Z. Wang, X. Dai, P. Zhu, R. Wang, X. Li, and F. Nie, “Fast opti- mization of spectral embedding and improved spectral rotation,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 2, pp. 1515–1527, 2021

    2021

  89. [97]

    Spectral clustering with linear embedding: A discrete clustering method for large-scale data,

    C. Gao, W. Chen, F. Nie, W. Yu, and Z. Wang, “Spectral clustering with linear embedding: A discrete clustering method for large-scale data,” Pattern Recognition, vol. 151, p. 110396, 2024

    2024

  90. [98]

    On the effect of hyperedge weights on hypergraph learning,

    S. Huang, A. Elgammal, and D. Yang, “On the effect of hyperedge weights on hypergraph learning,” Image and Vision Computing, vol. 57, pp. 89–101, 2017

    2017

  91. [99]

    A provable generalized tensor spectral method for uniform hypergraph partitioning,

    D. Ghoshdastidar and A. Dukkipati, “A provable generalized tensor spectral method for uniform hypergraph partitioning,” in International Conference on Machine Learning . PMLR, 2015, pp. 400–409

    2015

  92. [100]

    Hypergraph learning with hyperedge ex- pansion,

    L. Pu and B. Faltings, “Hypergraph learning with hyperedge ex- pansion,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2012, pp. 410–425

    2012

  93. [101]

    Hypergraph p-laplacian: A differential geometry view,

    S. Saito, D. Mandic, and H. Suzuki, “Hypergraph p-laplacian: A differential geometry view,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 32, no. 1, 2018

    2018

  94. [102]

    Hypergraph learning with line expansion,

    C. Yang, R. Wang, S. Yao, and T. Abdelzaher, “Hypergraph learning with line expansion,” arXiv preprint arXiv:2005.04843 , 2020

    2005 arXiv

  95. [103]

    Unsupervised image categorization by hypergraph partition,

    Y . Huang, Q. Liu, F. Lv, Y . Gong, and D. N. Metaxas, “Unsupervised image categorization by hypergraph partition,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 33, no. 6, pp. 1266– 1273, 2011

    2011

  96. [104]

    Context-aware hyper- graph construction for robust spectral clustering,

    X. Li, W. Hu, C. Shen, A. Dick, and Z. Zhang, “Context-aware hyper- graph construction for robust spectral clustering,” IEEE Transactions on Knowledge and Data Engineering , vol. 26, no. 10, pp. 2588–2597, 2013

    2013

  97. [105]

    Graphlshc: towards large scale spectral hypergraph clustering,

    Y . Yang, S. Deng, J. Lu, Y . Li, Z. Gong, Z. Hao et al. , “Graphlshc: towards large scale spectral hypergraph clustering,” Information Sci- ences, vol. 544, pp. 117–134, 2021

    2021

  98. [106]

    Regression-based hyper- graph learning for image clustering and classification arxiv,

    S. Huang, D. Yang, B. Liu, and X. Zhang, “Regression-based hyper- graph learning for image clustering and classification arxiv,” inComput. Vis. Pattern Recognit., 2016

    2016

  99. [107]

    Correntropy- induced robust low-rank hypergraph,

    T. Jin, R. Ji, Y . Gao, X. Sun, X. Zhao, and D. Tao, “Correntropy- induced robust low-rank hypergraph,” IEEE Transactions on Image Processing, vol. 28, no. 6, pp. 2755–2769, 2018

    2018

  100. [108]

    Link-aware semi-supervised hyper- graph,

    T. Jin, L. Cao, F. Jie, and R. Ji, “Link-aware semi-supervised hyper- graph,” Information Sciences, vol. 507, pp. 339–355, 2020

    2020

  101. [109]

    Hessian non-negative hypergraph,

    L. Li, Z. Li, M. Wang, T. Jin, and J. Liu, “Hessian non-negative hypergraph,” in International Conference on Intelligent Computing . Springer, 2023, pp. 691–704

    2023

  102. [110]

    A comprehensive survey on multi-view clustering,

    U. Fang, M. Li, J. Li, L. Gao, T. Jia, and Y . Zhang, “A comprehensive survey on multi-view clustering,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 12, pp. 12 350–12 368, 2023

    2023

  103. [111]

    A survey of multi-view representation learning,

    Y . Li, M. Yang, and Z. Zhang, “A survey of multi-view representation learning,” IEEE transactions on knowledge and data engineering , vol. 31, no. 10, pp. 1863–1883, 2018

    2018

  104. [112]

    A survey and an empirical evaluation of multi-view clustering approaches,

    L. Zhou, G. Du, K. L ¨u, L. Wang, and J. Du, “A survey and an empirical evaluation of multi-view clustering approaches,” ACM Computing Surveys, vol. 56, no. 7, pp. 1–38, 2024

    2024

  105. [113]

    Multi-view spectral clustering via sparse graph learning,

    Z. Hu, F. Nie, W. Chang, S. Hao, R. Wang, and X. Li, “Multi-view spectral clustering via sparse graph learning,” Neurocomputing, vol. 384, pp. 1–10, 2020

    2020

  106. [114]

    Parameter-free auto-weighted multiple graph learning: A framework for multiview clustering and semi-supervised classification

    F. Nie, J. Li, X. Li et al., “Parameter-free auto-weighted multiple graph learning: A framework for multiview clustering and semi-supervised classification.” in IJCAI, vol. 9, 2016, pp. 1881–1887

    2016

  107. [115]

    Self-weighted multiview clustering with multiple graphs

    ——, “Self-weighted multiview clustering with multiple graphs.” in IJCAI, 2017, pp. 2564–2570

    2017

  108. [116]

    Auto-weighted multi-view learning for image clustering and semi-supervised classification,

    F. Nie, G. Cai, J. Li, and X. Li, “Auto-weighted multi-view learning for image clustering and semi-supervised classification,” IEEE Trans- actions on Image Processing , vol. 27, no. 3, pp. 1501–1511, 2017

    2017

  109. [117]

    Late fusion incomplete multi-view clustering,

    X. Liu, X. Zhu, M. Li, L. Wang, C. Tang, J. Yin, D. Shen, H. Wang, and W. Gao, “Late fusion incomplete multi-view clustering,” IEEE transactions on pattern analysis and machine intelligence , vol. 41, no. 10, pp. 2410–2423, 2018

    2018

  110. [118]

    Unsupervised multi- view clustering by squeezing hybrid knowledge from cross view and each view,

    J. Tan, Y . Shi, Z. Yang, C. Wen, and L. Lin, “Unsupervised multi- view clustering by squeezing hybrid knowledge from cross view and each view,” IEEE Transactions on Multimedia, vol. 23, pp. 2943–2956, 2020

    2020

  111. [119]

    Performance evaluation of score level fusion in multimodal biometric systems,

    M. He, S.-J. Horng, P. Fan, R.-S. Run, R.-J. Chen, J.-L. Lai, M. K. Khan, and K. O. Sentosa, “Performance evaluation of score level fusion in multimodal biometric systems,” Pattern Recognition, vol. 43, no. 5, pp. 1789–1800, 2010

    2010

  112. [120]

    A structural con- sensus representation learning framework for multi-view clustering,

    R. Bai, R. Huang, Y . Qin, Y . Chen, and Y . Xu, “A structural con- sensus representation learning framework for multi-view clustering,” Knowledge-Based Systems, vol. 283, p. 111132, 2024

    2024

  113. [121]

    Learning enhanced specific representations for multi-view feature learning,

    Y . Hao, X.-Y . Jing, R. Chen, and W. Liu, “Learning enhanced specific representations for multi-view feature learning,” Knowledge-Based Systems, vol. 272, p. 110590, 2023

    2023

  114. [122]

    Weighted multi-view spectral clustering based on spectral perturbation,

    L. Zong, X. Zhang, X. Liu, and H. Yu, “Weighted multi-view spectral clustering based on spectral perturbation,” in Proceedings of the AAAI conference on artificial intelligence , vol. 32, no. 1, 2018

    2018

  115. [123]

    Auto-weighted multi-view clustering via spectral embedding,

    S. Shi, F. Nie, R. Wang, and X. Li, “Auto-weighted multi-view clustering via spectral embedding,” Neurocomputing, vol. 399, pp. 369– 379, 2020

    2020

  116. [124]

    A study of graph-based system for multi-view clustering,

    H. Wang, Y . Yang, B. Liu, and H. Fujita, “A study of graph-based system for multi-view clustering,” Knowledge-Based Systems, vol. 163, pp. 1009–1019, 2019

    2019

  117. [125]

    Gmc: Graph-based multi-view cluster- ing,

    H. Wang, Y . Yang, and B. Liu, “Gmc: Graph-based multi-view cluster- ing,” IEEE Transactions on Knowledge and Data Engineering, vol. 32, no. 6, pp. 1116–1129, 2019

    2019

  118. [126]

    Consensus graph and spectral representation for one-step multi-view kernel based clustering,

    S. El Hajjar, F. Dornaika, F. Abdallah, and N. Barrena, “Consensus graph and spectral representation for one-step multi-view kernel based clustering,” Knowledge-Based Systems, vol. 241, p. 108250, 2022

    2022

  119. [127]

    Multi-view spectral clus- tering by simultaneous consensus graph learning and discretization,

    G. Zhong, T. Shu, G. Huang, and X. Yan, “Multi-view spectral clus- tering by simultaneous consensus graph learning and discretization,” Knowledge-Based Systems, vol. 235, p. 107632, 2022

    2022

  120. [128]

    Multiview clustering by consensus spectral rotation fusion,

    J. Chen, H. Mao, D. Peng, C. Zhang, and X. Peng, “Multiview clustering by consensus spectral rotation fusion,” IEEE Transactions on Image Processing , 2023

    2023

  121. [129]

    One-step multiview clustering via adaptive graph learning and spectral rotation,

    C. Tang, M. Wang, and K. Sun, “One-step multiview clustering via adaptive graph learning and spectral rotation,” IEEE Transactions on Neural Networks and Learning Systems , 2024

    2024

  122. [130]

    Diversity-induced multi-view subspace clustering,

    X. Cao, C. Zhang, H. Fu, S. Liu, and H. Zhang, “Diversity-induced multi-view subspace clustering,” inProceedings of the IEEE conference on computer vision and pattern recognition , 2015, pp. 586–594

    2015

  123. [131]

    Iter- ative views agreement: An iterative low-rank based structured op- timization method to multi-view spectral clustering,

    Y . Wang, W. Zhang, L. Wu, X. Lin, M. Fang, and S. Pan, “Iter- ative views agreement: An iterative low-rank based structured op- timization method to multi-view spectral clustering,” arXiv preprint arXiv:1608.05560, 2016

    2016 arXiv

  124. [132]

    Exclusivity- consistency regularized multi-view subspace clustering,

    X. Wang, X. Guo, Z. Lei, C. Zhang, and S. Z. Li, “Exclusivity- consistency regularized multi-view subspace clustering,” in Proceed- ings of the IEEE conference on computer vision and pattern recogni- tion, 2017, pp. 923–931

    2017

  125. [133]

    Multi-view low-rank sparse subspace clus- tering,

    M. Brbi ´c and I. Kopriva, “Multi-view low-rank sparse subspace clus- tering,” Pattern recognition, vol. 73, pp. 247–258, 2018

    2018

  126. [134]

    Consistent and specific multi-view subspace clustering,

    S. Luo, C. Zhang, W. Zhang, and X. Cao, “Consistent and specific multi-view subspace clustering,” inProceedings of the AAAI conference on artificial intelligence , vol. 32, no. 1, 2018

    2018

  127. [135]

    Flexible multi-view representation learning for subspace clustering

    R. Li, C. Zhang, Q. Hu, P. Zhu, and Z. Wang, “Flexible multi-view representation learning for subspace clustering.” in IJCAI, vol. 2019, 2019, pp. 2916–2922

    2019

  128. [136]

    Multi-graph fusion for multi-view spectral clustering,

    Z. Kang, G. Shi, S. Huang, W. Chen, X. Pu, J. T. Zhou, and Z. Xu, “Multi-graph fusion for multi-view spectral clustering,” Knowledge- Based Systems, vol. 189, p. 105102, 2020

    2020

  129. [137]

    Multi-view spectral clustering via common structure maximization of local and global representations,

    W. Hao, S. Pang, and Z. Chen, “Multi-view spectral clustering via common structure maximization of local and global representations,” Neural Networks, vol. 143, pp. 595–606, 2021. 21

    2021

  130. [138]

    Deep multi-view subspace clustering with unified and discriminative learning,

    Q. Wang, J. Cheng, Q. Gao, G. Zhao, and L. Jiao, “Deep multi-view subspace clustering with unified and discriminative learning,” IEEE Transactions on Multimedia , vol. 23, pp. 3483–3493, 2020

    2020

  131. [139]

    Consensus one-step multi-view subspace clustering,

    P. Zhang, X. Liu, J. Xiong, S. Zhou, W. Zhao, E. Zhu, and Z. Cai, “Consensus one-step multi-view subspace clustering,” IEEE Transac- tions on Knowledge and Data Engineering , vol. 34, no. 10, pp. 4676– 4689, 2020

    2020

  132. [140]

    Mul- tiview subspace clustering with grouping effect,

    M.-S. Chen, L. Huang, C.-D. Wang, D. Huang, and S. Y . Philip, “Mul- tiview subspace clustering with grouping effect,” IEEE Transactions on Cybernetics, vol. 52, no. 8, pp. 7655–7668, 2020

    2020

  133. [141]

    Multi-view attributed graph clustering,

    Z. Lin, Z. Kang, L. Zhang, and L. Tian, “Multi-view attributed graph clustering,” IEEE Transactions on knowledge and data engineering , vol. 35, no. 2, pp. 1872–1880, 2021

    2021

  134. [142]

    Large-scale multi-view spectral clustering via bipartite graph,

    Y . Li, F. Nie, H. Huang, and J. Huang, “Large-scale multi-view spectral clustering via bipartite graph,” in Proceedings of the AAAI conference on artificial intelligence , vol. 29, no. 1, 2015

    2015

  135. [143]

    Multiview clustering: A scalable and parameter-free bipartite graph fusion method,

    X. Li, H. Zhang, R. Wang, and F. Nie, “Multiview clustering: A scalable and parameter-free bipartite graph fusion method,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 44, no. 1, pp. 330–344, 2020

    2020

  136. [144]

    Bipartite graph based multi-view clustering,

    L. Li and H. He, “Bipartite graph based multi-view clustering,” IEEE transactions on knowledge and data engineering , vol. 34, no. 7, pp. 3111–3125, 2020

    2020

  137. [145]

    Fast multiview clustering with spectral embedding,

    B. Yang, X. Zhang, F. Nie, and F. Wang, “Fast multiview clustering with spectral embedding,” IEEE Transactions on Image Processing , vol. 31, pp. 3884–3895, 2022

    2022

  138. [146]

    Fast multiview anchor-graph clustering,

    B. Yang, X. Zhang, J. Wu, F. Nie, Z. Lin, F. Wang, and B. Chen, “Fast multiview anchor-graph clustering,”IEEE Transactions on Neural Networks and Learning Systems , 2024

    2024

  139. [147]

    Self-weighting and hypergraph regularization for multi-view spectral clustering,

    W. Hao, S. Pang, J. Zhu, and Y . Li, “Self-weighting and hypergraph regularization for multi-view spectral clustering,” IEEE Signal Process- ing Letters, vol. 27, pp. 1325–1329, 2020

    2020

  140. [148]

    Hypergraph learning-based semi-supervised multi-view spectral clustering,

    G. Yang, Q. Li, Y . Yun, Y . Lei, and J. You, “Hypergraph learning-based semi-supervised multi-view spectral clustering,” Electronics, vol. 12, no. 19, p. 4083, 2023

    2023

  141. [149]

    Incomplete multi- view clustering based on hypergraph,

    J. Chen, H. Xu, J. Xue, Q. Gao, C. Deng, and Z. Lv, “Incomplete multi- view clustering based on hypergraph,” Information Fusion, p. 102804, 2024. Kamal Berahmand received his Ph.D. in 2024 from the School of Computer Science, Queensland University of Technology (QUT), Australi...

    2024

  142. [2017]

    Her research interests include machine learning, semi-supervised feature selection and bioinformatics

    Currently, she is an Associate Professor at the department of Computer Engineering at Ardakan University, Ardakan, Iran. Her research interests include machine learning, semi-supervised feature selection and bioinformatics. Yuefeng Li is currently a professor and the HDR Direc...

    2001

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.