Spectral clustering and its use in bioinformatics
The authors formulate a discrete optimization problem that gives a simple derivation of a widely used class of spectral clustering algorithms. These algorithms bundle objects into groups of similar objects, using the eigendecomposition of a matrix derived from the (real symmetric) matrix \(W=(w_{ij})\), where, for \(i\neq j\), \(w_{ij}\) is a measure of the similarity of the \(i\)th and \(j\)th objects, and \(w_{ii}=0\). The objects are regarded as vertices of an undirected graph. The authors' approach helps explain the difference observed between methods based on the normalized and unnormalized graph Laplacian. A numerical illustration is given using microarray datasets published by cancer researchers.
- A spectral clustering method for microarray data
- Spectral clustering of multidimensional genetic data
- scientific article; zbMATH DE number 2149595
- Spectral clustering
- A discrete-valued clustering algorithm with applications to biomolecular data
- Toward revealing protein function: identifying biologically relevant clusters with graph spectral methods
- Advances in Neural Networks – ISNN 2005
- Data clustering and self-organizing maps in biology
- A spectral algorithm for envelope reduction of sparse matrices
- An improved spectral bisection algorithm and its application to dynamic load balancing
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Analysis of the singular value decomposition as a tool for processing microarray expression data
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- Matrix Analysis
- On clusterings: good, bad and spectral
- Spectral partitioning works: planar graphs and finite element meshes
- Perturbation analysis for the normalized Laplacian matrices in the multiway spectral clustering method
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- Random walk distances in data clustering and applications
- On the eigenvectors of \(p\)-Laplacian
- Spectral clustering with physical intuition on spring-mass dynamics
- Regularity-based spectral clustering and mapping the Fiedler-carpet
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- Multilocus phylogenetic analysis with gene tree clustering
- Spectral clustering and biclustering. Learning large graphs and contingency tables
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Clustering of high throughput gene expression data
- Spectral analysis of two-signed microarray expression data
- Graph Clustering Via a Discrete Uncoupling Process
- Analysis of the singular value decomposition as a tool for processing microarray expression data
- Spectral clustering
- Graph clustering
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Constrained graph partitioning via matrix differential equations
- Learning Theory
- Spectral clustering of multidimensional genetic data
- Spectral embedding norm: looking deep into the spectrum of the graph Laplacian
- Beyond non-backtracking: non-cycling network centrality measures
- Block spectral clustering methods for multiple graphs.
- Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets
- \texttt{PQser:} a Matlab package for spectral seriation
- Spectral methods for graph clustering - a survey
- A spectral clustering method for microarray data
- A spectral graph approach to discovering genetic ancestry
This page was built for publication: Spectral clustering and its use in bioinformatics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879406)
