Projects that are tagged with graph partitioning.


Logo 1SpectralClustering 1.2

by tbuehler - May 1, 2018, 19:26:07 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 14952 views, 2931 downloads, 2 subscriptions

About: A fast and scalable graph-based clustering algorithm based on the eigenvectors of the nonlinear 1-Laplacian.

Changes:
  • improved optimization of ncut and rcut criterion
  • optimized eigenvector initialization
  • changed default values for number of runs
  • several internal optimizations
  • made console output more informative

Logo pSpectralClustering 1.2

by tbuehler - July 30, 2017, 20:07:52 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 13202 views, 2810 downloads, 2 subscriptions

About: A generalized version of spectral clustering using the graph p-Laplacian.

Changes:

various internal optimizations