Graclus

swMATH42904MaRDI QIDQ5972950FDOQ5972950

Author name not available (Why is that?)

Cited In (38)

• 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
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• Language games in investigation of social networks: finding communities and influential agents
• Graph coarsening: from scientific computing to machine learning
• Dense and sparse graph partition
• Probably certifiably correct \(k\)-means clustering
• Dense community detection in multi-valued attributed networks
• Multiway \(p\)-spectral graph cuts on Grassmann manifolds
• Dual-domain graph convolutional networks for skeleton-based action recognition
• A Tailored Convolutional Neural Network for Nonlinear Manifold Learning of Computational Physics Data Using Unstructured Spatial Discretizations
• An Improved Kernel K-means Clustering Algorithm
• Automatically finding clusters in normalized cuts
• Approximate kernel competitive learning
• A spectral approach to clustering numerical vectors as nodes in a network
• Evaluating performance of image segmentation criteria and techniques
• Semi-supervised graph clustering: a kernel approach
• 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
• Approximating Spectral Clustering via Sampling: A Review
• 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
• Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
• Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes
• Co-clustering documents and words by minimizing the normalized cut objective function
• Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Beyond good partition shapes: an analysis of diffusive graph partitioning
• 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