Cited in
(65)- A multilevel approach for learning from labeled and unlabeled data on graphs
- A novel index method for K nearest object query over time-dependent road networks
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization
- Graph dual regularization non-negative matrix factorization for co-clustering
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Language games in investigation of social networks: finding communities and influential agents
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Graph coarsening: from scientific computing to machine learning
- Reward maximization under uncertainty: leveraging side-observations on networks
- Dense and sparse graph partition
- Graph reduction with spectral and cut guarantees
- Probably certifiably correct k-means clustering
- Dense community detection in multi-valued attributed networks
- Multiway \(p\)-spectral graph cuts on Grassmann manifolds
- Approximating spectral clustering via sampling: a review
- Dual-domain graph convolutional networks for skeleton-based action recognition
- Automatically finding clusters in normalized cuts
- Approximate kernel competitive learning
- A spectral approach to clustering numerical vectors as nodes in a network
- J-MEANS
- JAFFE
- AFGen
- KaFFPa
- Bubble-FOS/C
- FOS/C
- FASTCLIME
- jshi
- MatlabBGL
- Evaluating performance of image segmentation criteria and techniques
- GraphScope
- PARTY
- KaHyPar
- Algorithm 457
- SpectralNet
- NCut
- ProTraS
- improved_spectral_community_detection
- spectralGraphTopology
- BSPedupack
- Kernel Cut
- Semi-supervised graph clustering: a kernel approach
- BRENDA
- Non-negative and sparse spectral clustering
- Multiway spectral clustering: a margin-based perspective
- A distributed framework for trimmed kernel \(k\)-means clustering
- Iterative ensemble normalized cuts
- A survey of kernel and spectral methods for clustering
- A gentle introduction to deep learning for graphs
- Kernel spectral clustering with memory effect
- Clustered matrix approximation
- Approximate normalized cuts without eigen-decomposition
- Pose2Mesh
- NTU RGB+D
- KPlexPool
- FeaStNet
- Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
- An improved kernel K-means clustering algorithm
- Co-clustering documents and words by minimizing the normalized cut objective function
- A tailored convolutional neural network for nonlinear manifold learning of computational physics data using unstructured spatial discretizations
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- FP2VEC
- GraphVAE
- K-plex cover pooling for graph neural networks
- A graph clustering algorithm based on a clustering coefficient for weighted graphs
This page was built for software: Graclus
