A Tutorial on Spectral Clustering

A Tutorial on Spectral Clustering. Von Luxburg, U. 17(4):395–416.

In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.

@article{vonluxburgTutorialSpectralClustering2007,
  title = {A Tutorial on Spectral Clustering},
  volume = {17},
  issn = {09603174},
  url = {http://www.springerlink.com/index/10.1007/s11222-007-9033-z},
  doi = {10.1007/s11222-007-9033-z},
  abstract = {In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.},
  number = {4},
  journaltitle = {Statistics and Computing},
  date = {2007},
  pages = {395--416},
  keywords = {Graph Laplacian,Spectral clustering},
  author = {Von Luxburg, Ulrike},
  file = {/home/dimitri/Nextcloud/Zotero/storage/274AGM44/Luxburg - 2006 - A Tutorial on Spectral Clustering A Tutorial on Spectral Clustering.pdf},
  eprinttype = {pmid},
  eprint = {19784854}
}

Downloads: 0

{"_id":"3YQWcEJMuZauuMqMZ","bibbaseid":"vonluxburg-atutorialonspectralclustering","authorIDs":[],"author_short":["Von Luxburg, U."],"bibdata":{"bibtype":"article","type":"article","title":"A Tutorial on Spectral Clustering","volume":"17","issn":"09603174","url":"http://www.springerlink.com/index/10.1007/s11222-007-9033-z","doi":"10.1007/s11222-007-9033-z","abstract":"In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.","number":"4","journaltitle":"Statistics and Computing","date":"2007","pages":"395–416","keywords":"Graph Laplacian,Spectral clustering","author":[{"propositions":[],"lastnames":["Von","Luxburg"],"firstnames":["Ulrike"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/274AGM44/Luxburg - 2006 - A Tutorial on Spectral Clustering A Tutorial on Spectral Clustering.pdf","eprinttype":"pmid","eprint":"19784854","bibtex":"@article{vonluxburgTutorialSpectralClustering2007,\n title = {A Tutorial on Spectral Clustering},\n volume = {17},\n issn = {09603174},\n url = {http://www.springerlink.com/index/10.1007/s11222-007-9033-z},\n doi = {10.1007/s11222-007-9033-z},\n abstract = {In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.},\n number = {4},\n journaltitle = {Statistics and Computing},\n date = {2007},\n pages = {395--416},\n keywords = {Graph Laplacian,Spectral clustering},\n author = {Von Luxburg, Ulrike},\n file = {/home/dimitri/Nextcloud/Zotero/storage/274AGM44/Luxburg - 2006 - A Tutorial on Spectral Clustering A Tutorial on Spectral Clustering.pdf},\n eprinttype = {pmid},\n eprint = {19784854}\n}\n\n","author_short":["Von Luxburg, U."],"key":"vonluxburgTutorialSpectralClustering2007","id":"vonluxburgTutorialSpectralClustering2007","bibbaseid":"vonluxburg-atutorialonspectralclustering","role":"author","urls":{"Paper":"http://www.springerlink.com/index/10.1007/s11222-007-9033-z"},"keyword":["Graph Laplacian","Spectral clustering"],"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.043Z","downloads":0,"keywords":["graph laplacian","spectral clustering"],"search_terms":["tutorial","spectral","clustering","von luxburg"],"title":"A Tutorial on Spectral Clustering","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}