A survey of kernel and spectral methods for clustering
From MaRDI portal
Publication:2384965
DOI10.1016/J.PATCOG.2007.05.018zbMath1122.68530OpenAlexW2155074104WikidataQ59538689 ScholiaQ59538689MaRDI QIDQ2384965
Stefano Rovetta, Francesco Camastra, Francesco Masulli, Maurizio Filippone
Publication date: 10 October 2007
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.05.018
Related Items (48)
Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries ⋮ Communicability graph and community structures in complex networks ⋮ Clustering with prim's sequential representation of minimum spanning tree ⋮ 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 ⋮ Fast spectral clustering with self-weighted features ⋮ Multiple kernel clustering based on centered kernel alignment ⋮ Towards hybrid clustering approach to data classification: multiple kernels based interval-valued fuzzy C-means algorithms ⋮ Clustering of temporal gene expression data by regularized spline regression and an energy based similarity measure ⋮ Efficient clustering of large uncertain graphs using neighborhood information ⋮ A spectral approach to clustering numerical vectors as nodes in a network ⋮ \(\mathrm{M}^4\mathrm{L}\): maximum margin multi-instance multi-cluster learning for scene modeling ⋮ Global discriminative-based nonnegative spectral clustering ⋮ One-class support vector ensembles for image segmentation and classification ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ UC-LTM: unidimensional clustering using latent tree models for discrete data ⋮ Determinantal consensus clustering ⋮ Braverman’s Spectrum and Matrix Diagonalization Versus iK-Means: A Unified Framework for Clustering ⋮ A reductive approach to hypergraph clustering: an application to image segmentation ⋮ Resampling approach for cluster model selection ⋮ 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 ⋮ Based on rough set and fuzzy clustering of MRI brain segmentation ⋮ Spectral clustering based on local linear approximations ⋮ Unnamed Item ⋮ Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data ⋮ Efficient semi-supervised learning on locally informative multiple graphs ⋮ Refined Spectral Clustering via Embedded Label Propagation ⋮ Feature selection and multi-kernel learning for sparse representation on a manifold ⋮ Unnamed Item ⋮ Analyzing the stock market based on the structure of \textit{kNN} network ⋮ Fuzzy clustering with weighted medoids for relational data ⋮ Dealing with non-metric dissimilarities in fuzzy central clustering algorithms ⋮ Spectral methods for graph clustering - a survey ⋮ A tree-structured framework for purifying ``complex clusters with structural roles of individual data ⋮ An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks ⋮ Spectral nonlinearly embedded clustering algorithm ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Cooperative and penalized competitive learning with application to kernel-based clustering ⋮ Kernel-based hard clustering methods in the feature space with automatic variable weighting ⋮ The Clustering Algorithm Based on the Most Similar Relation Diagram ⋮ Clustered Matrix Approximation ⋮ Design of interpretable fuzzy rule-based classifiers using spectral analysis with structure and parameters optimization ⋮ Fractional Gaussian kernels ⋮ Kernel fuzzy \(c\)-means with automatic variable weighting ⋮ Categorical-and-numerical-attribute data clustering based on a unified similarity metric without knowing cluster number
Uses Software
Cites Work
- Self-organized formation of topologically correct feature maps
- Fuzzy \(c\)-varieties/elliptotypes clustering in reproducing kernel Hilbert space.
- Support-vector networks
- Consistency of spectral clustering
- Theoretical foundations of the potential function method in pattern recognition learning
- Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
- Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
- On clusterings
- An Efficient Heuristic Procedure for Partitioning Graphs
- Least squares quantization in PCM
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Lower Bounds for the Partitioning of Graphs
- Theory of Reproducing Kernels
- Robust Statistics
- Self-organizing maps.
- Clustering via Hilbert space
- Graclus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey of kernel and spectral methods for clustering
