A survey of kernel and spectral methods for clustering
From MaRDI portal
Publication:2384965
Recommendations
- Kernel spectral clustering of large dimensional data
- The geometry of kernelized spectral clustering
- Overview on kernels for least-squares support-vector-machine-based clustering: explaining kernel spectral clustering
- KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
- Spectral methods for graph clustering - a survey
- A note on spectral clustering
- Concentration of kernel matrices with application to kernel spectral clustering
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Clustering via Hilbert space
- Consistency of spectral clustering
- Fuzzy c-varieties/elliptotypes clustering in reproducing kernel Hilbert space.
- Graclus
- scientific article; zbMATH DE number 1810276 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 193745 (Why is no real title available?)
- scientific article; zbMATH DE number 1333614 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 928746 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
- Least squares quantization in PCM
- Lower Bounds for the Partitioning of Graphs
- Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
- On clusterings: good, bad and spectral
- Robust Statistics
- Self-organized formation of topologically correct feature maps
- Self-organizing maps.
- Support-vector networks
- Theoretical foundations of the potential function method in pattern recognition learning
- Theory of Reproducing Kernels
Cited in
(74)- Design of interpretable fuzzy rule-based classifiers using spectral analysis with structure and parameters optimization
- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
- A distributed framework for trimmed kernel \(k\)-means clustering
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach
- Multiple kernel clustering based on centered kernel alignment
- Towards hybrid clustering approach to data classification: multiple kernels based interval-valued fuzzy C-means algorithms
- Efficient clustering of large uncertain graphs using neighborhood information
- UC-LTM: unidimensional clustering using latent tree models for discrete data
- Analyzing the stock market based on the structure of \textit{kNN} network
- Spectral nonlinearly embedded clustering algorithm
- One-class support vector ensembles for image segmentation and classification
- Hierarchical kernel spectral clustering
- Spectral clustering based on local linear approximations
- Multi-view kernel construction
- Spectral clustering with physical intuition on spring-mass dynamics
- Convex programming based spectral clustering
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization
- Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data
- A review and proposal of (fuzzy) clustering for nonlinearly separable data
- Kernel fuzzy \(c\)-means with automatic variable weighting
- Categorical-and-numerical-attribute data clustering based on a unified similarity metric without knowing cluster number
- Global discriminative-based nonnegative spectral clustering
- Mean shift spectral clustering
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries
- Clustered matrix approximation
- Fractional Gaussian kernels
- Based on rough set and fuzzy clustering of MRI brain segmentation
- Clustering with prim's sequential representation of minimum spanning tree
- Recursive kernel trick for network segmentation
- The clustering algorithm based on the most similar relation diagram
- A clustering algorithm for two classes on the unit hypersphere
- Computational intelligence in clustering algorithms, with applications
- Application of WMD Gaussian kernel in spectral partitioning
- A reductive approach to hypergraph clustering: an application to image segmentation
- Resampling approach for cluster model selection
- Spectral clustering with mixed Euclidean and Kendall tau metrics
- Spectral clustering
- Feature selection and multi-kernel learning for sparse representation on a manifold
- Data exploration by representative region selection: axioms and convergence
- Overview on kernels for least-squares support-vector-machine-based clustering: explaining kernel spectral clustering
- scientific article; zbMATH DE number 7625171 (Why is no real title available?)
- Fast spectral clustering with self-weighted features
- Kernel treelets
- A kernel based clustering algorithm using particle swarm optimization
- On Bezdek-type possibilistic clustering for spherical data, its kernelization, and spectral clustering approach
- Refined spectral clustering via embedded label propagation
- KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
- scientific article; zbMATH DE number 7687809 (Why is no real title available?)
- Determinantal consensus clustering
- Clustering of temporal gene expression data by regularized spline regression and an energy based similarity measure
- Braverman’s Spectrum and Matrix Diagonalization Versus iK-Means: A Unified Framework for Clustering
- A spectral approach to clustering numerical vectors as nodes in a network
- Efficient semi-supervised learning on locally informative multiple graphs
- On the uniform concentration bounds and large sample properties of clustering with Bregman divergences
- An estimation method for switching points of multimode spatiotemporal data based on SFSTAR
- Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection
- Sparse kernel k -means clustering
- Spectral methods for graph clustering - a survey
- Deep clustering using the soft silhouette score: towards compact and well-separated clusters
- An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
- Power spectrum signatures of graphs
- Mixtures of Gaussian process experts with \(\mathrm{SMC}^2\)
- Cooperative and penalized competitive learning with application to kernel-based clustering
- Kernel-based hard clustering methods in the feature space with automatic variable weighting
- Communicability graph and community structures in complex networks
- \(\mathrm{M}^4\mathrm{L}\): maximum margin multi-instance multi-cluster learning for scene modeling
- Clustering and outlier detection using isoperimetric number of trees
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Semi-supervised clustering via multi-level random walk
- KPCA for semantic object extraction in images
- Fuzzy clustering with weighted medoids for relational data
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- A tree-structured framework for purifying ``complex clusters with structural roles of individual data
This page was built for publication: A survey of kernel and spectral methods for clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384965)
