Spectral clustering and its use in bioinformatics
From MaRDI portal
Publication:879406
DOI10.1016/j.cam.2006.04.026zbMath1123.65024OpenAlexW2039934205MaRDI QIDQ879406
Desmond J. Higham, Milla Kibble, Gabriela Kalna
Publication date: 11 May 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.04.026
partitioningnumerical examplesdiscrete optimization problemscalingrandom graphFiedler vectorgene expressiongraph Laplacianeigendecompositionbalancing thresholdspectral clustering algorithms
Related Items
Clustering of high throughput gene expression data ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ Random walk distances in data clustering and applications ⋮ Constrained Graph Partitioning via Matrix Differential Equations ⋮ Graph clustering ⋮ \texttt{PQser:} a Matlab package for spectral seriation ⋮ Beyond non-backtracking: non-cycling network centrality measures ⋮ An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration ⋮ Spectral clustering with physical intuition on spring-mass dynamics ⋮ TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector ⋮ Multilocus phylogenetic analysis with gene tree clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An improved spectral bisection algorithm and its application to dynamic load balancing
- Spectral partitioning works: planar graphs and finite element meshes
- On clusterings
- Matrix Analysis
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- A spectral algorithm for envelope reduction of sparse matrices