Spectral clustering and its use in bioinformatics (Q879406): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:29, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spectral clustering and its use in bioinformatics |
scientific article |
Statements
Spectral clustering and its use in bioinformatics (English)
0 references
11 May 2007
0 references
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.
0 references
partitioning
0 references
scaling
0 references
balancing threshold
0 references
gene expression
0 references
Fiedler vector
0 references
graph Laplacian
0 references
random graph
0 references
numerical examples
0 references
discrete optimization problem
0 references
spectral clustering algorithms
0 references
eigendecomposition
0 references