B. Auffarth. Universitat Politècnica de Catalunya, Barcelona, Catalunya, Spain, (January 2007)
Abstract
Spectral clustering is a powerful technique in data analysis that has found
increasing support and application in many areas. This report is geared to
give an introduction to its methods, presenting the most common algorithms,
discussing advantages and disadvantages of each, rather than endorsing one
of them as the best, because, arguably, there is no black-box algorithm,
which performs equally well for any data. We present results from previous
studies and conclude that methods based on Ncut and multiway are most
promising for general application.
%0 Report
%1 Auffarth2007Spectral
%A Auffarth, Benjamin
%C Barcelona, Catalunya, Spain
%D 2007
%K clustering graph phd schemdesc
%T Spectral Graph Clustering
%U http://www-lehre.inf.uos.de/~bauffart/spectral.pdf
%X Spectral clustering is a powerful technique in data analysis that has found
increasing support and application in many areas. This report is geared to
give an introduction to its methods, presenting the most common algorithms,
discussing advantages and disadvantages of each, rather than endorsing one
of them as the best, because, arguably, there is no black-box algorithm,
which performs equally well for any data. We present results from previous
studies and conclude that methods based on Ncut and multiway are most
promising for general application.
@techreport{Auffarth2007Spectral,
abstract = {Spectral clustering is a powerful technique in data analysis that has found
increasing support and application in many areas. This report is geared to
give an introduction to its methods, presenting the most common algorithms,
discussing advantages and disadvantages of each, rather than endorsing one
of them as the best, because, arguably, there is no black-box algorithm,
which performs equally well for any data. We present results from previous
studies and conclude that methods based on Ncut and multiway are most
promising for general application.},
added-at = {2013-12-17T09:48:27.000+0100},
address = {Barcelona, Catalunya, Spain},
author = {Auffarth, Benjamin},
biburl = {https://www.bibsonomy.org/bibtex/2ccd604d036e63c0660122feb67406e63/jullybobble},
file = {:Users/julien.gaugaz/Dropbox/Papers/Mendeley Desktop/2007/Auffarth - 2007 - Spectral Graph Clustering.pdf:pdf},
institution = {Universitat Polit\`{e}cnica de Catalunya},
interhash = {b2dcc6aea4839729b7896d708972d57d},
intrahash = {ccd604d036e63c0660122feb67406e63},
keywords = {clustering graph phd schemdesc},
month = jan,
timestamp = {2014-07-27T15:43:19.000+0200},
title = {{Spectral Graph Clustering}},
url = {http://www-lehre.inf.uos.de/~bauffart/spectral.pdf},
year = 2007
}