High-Order Anchor Graph-Based Clustering for Efficient Structured Proximity Matrix Learning
- 17 October 2025
- book chapter
- Published by Springer Nature
- p. 69-83
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Enhancing Clustering Performance With Tensorized High-Order Bipartite Graphs: A Structured Graph Learning ApproachIEEE Transactions on Circuits and Systems for Video Technology, 2024
- Multi-view clustering via high-order bipartite graph fusionInformation Fusion, 2024
- Adaptive-order proximity learning for graph-based clusteringPattern Recognition, 2022
- Considerably Improving Clustering Algorithms Using UMAP Dimensionality Reduction Technique: A Comparative Study2020
- Robust Subspace Clustering by Learning an Optimal Structured Bipartite Graph via Low-rank Representation2019
- Fast Spectral Clustering with efficient large graph construction2017
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Spectral K-way ratio-cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Graph theory in network analysisSocial Networks, 1983