Semi-supervised graph clustering: a kernel approach
From MaRDI portal
Recommendations
Cites work
- An introduction to support vector machines and other kernel-based learning methods.
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- Clustering based on conditional distributions in an auxiliary space
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering with partial information
- Efficiently learning the metric with side-information
- scientific article; zbMATH DE number 5957283 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- Kernels and regularization on graphs.
Cited in
(49)- A semi-supervised heat kernel pagerank MBO algorithm for data classification
- Incremental multi-class semi-supervised clustering regularized by Kalman filtering
- SELP: semi-supervised evidential label propagation algorithm for graph data clustering
- Weakly supervised nonnegative matrix factorization for user-driven clustering
- Semi-supervised concept factorization for document clustering
- On the eigenvectors of \(p\)-Laplacian
- Link-aware semi-supervised hypergraph
- Semi-supervised classification using multiple clustering and low-rank matrix operations
- Learning a metric when clustering data points in the presence of constraints
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization
- On using supervised clustering analysis to improve classification performance
- A unified view of density-based methods for semi-supervised clustering and classification
- Hierarchical graph embedding in vector space by graph pyramid
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Semi-supervised learning with nuclear norm regularization
- Local search for constrained graph clustering in biological networks
- scientific article; zbMATH DE number 1699993 (Why is no real title available?)
- Semi-supervised clustering via two-level random walk
- Joint harmonic functions and their supervised connections
- On the choice of kernel and labelled data in semi-supervised learning methods
- Group approach to solving the tasks of recognition
- A semi-supervised K-means clustering algorithm for multi-type relational data
- Semi-supervised clustering with user feedback
- Gaussian processes classification combined with semi-supervised kernels
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- Fast semi-supervised clustering with enhanced spectral embedding
- Semi-supervised clustering with discriminative random fields
- Semi-supervised clustering
- MST-based semi-supervised clustering using M-labeled objects
- An approximation algorithm for a semi-supervised graph clustering problem
- Graph-based semi-supervised learning by mixed label propagation with a soft constraint
- On a semi-supervised graph clustering problem
- Approximate algorithms for graph clustering problem
- Semi-supervised learning with local and global consistency
- Semi-supervised eigenvectors for large-scale locally-biased learning
- Semisupervised Learning for Computational Linguistics
- ELECTRIC NETWORK CLASSIFIERS FOR SEMI-SUPERVISED LEARNING ON GRAPHS
- A spectral approach to clustering numerical vectors as nodes in a network
- Multi-task clustering via domain adaptation
- Efficient semi-supervised learning on locally informative multiple graphs
- Network-based semisupervised clustering
- Constrained clustering: current and new trends
- Semi-supervised clustering methods
- Constrained clustering and multiple kernel learning without pairwise constraint relaxation
- Supervised neighborhood graph construction for semi-supervised classification
- Approximating Dasgupta cost in sublinear time from a few random seeds
- Semi-supervised information-maximization clustering
- Semi-supervised clustering via multi-level random walk
- Semi-supervised clustering with metric learning: an adaptive kernel method
This page was built for publication: Semi-supervised graph clustering: a kernel approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009309)
