QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Ng, A.Y., Jordan, M.I. & Weiss, Y. On spectral clustering: Analysis and an algorithm

    [Abstract] [BibTeX]

    		 2001 Advances in Neural Information Processing Systems 14, pp. 849-856  inproceedings  
    Abstract: Despite many empirical successes of spectral clustering methods| algorithms that cluster points using eigenvectors of matrices derived from the data|there are several unresolved issues. First, there are a wide variety of algorithms that use the eigenvectors in slightly dierent ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems. 1
    BibTeX: 
    @inproceedings{Ng01onspectral,
  author = {Ng, Andrew Y. and Jordan, Michael I. and Weiss, Yair},
  title = {On spectral clustering: Analysis and an algorithm},
  booktitle = {Advances in Neural Information Processing Systems 14},
  publisher = {MIT Press},
  year = {2001},
  pages = {849--856}
}
    Ranade, A. Some uses of spectral methods

    [BibTeX]

    		 2000   unpublished  
    BibTeX: 
    @unpublished{ranade:sus,
  author = {Ranade, A.G.},
  title = {Some uses of spectral methods},
  year = {2000}
}
    Spielman, D.A. & Teng, S. Spectral Partitioning Works: Planar Graphs and Finite Element Meshes

    [BibTeX]

    		 1996   techreport  
    BibTeX: 
    @techreport{Spielman:1996,
  author = {Spielman, Daniel A. and Teng, Shang},
  title = {Spectral Partitioning Works: Planar Graphs and Finite Element Meshes},
  publisher = {University of California at Berkeley},
  year = {1996}
}
    Pothen, A., Simon, H. & Liou, K. Partitioning Sparse Matrices with Eigenvectors of Graphs

    [BibTeX]

    		 1990 SIAM J. MATRIX ANAL. APPLIC.
    Vol. 11(3), pp. 430-452     		 article URL 
    BibTeX: 
    @article{partitioning89,
  author = {Pothen, A. and Simon, H.D. and Liou, K.P.},
  title = {Partitioning Sparse Matrices with Eigenvectors of Graphs},
  journal = {SIAM J. MATRIX ANAL. APPLIC.},
  year = {1990},
  volume = {11},
  number = {3},
  pages = {430--452},
  url = {http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19970011963_1997016998.pdf }
}
    Donath, W. & Hoffman, A. Lower bounds for the partitioning of graphs

    [BibTeX]

    		 1973 IBM Journal of Research and Development
    Vol. 17(5), pp. 420-425     		 article  
    BibTeX: 
    @article{donath1973lbp,
  author = {Donath, W.E. and Hoffman, A.J.},
  title = {Lower bounds for the partitioning of graphs},
  journal = {IBM Journal of Research and Development},
  year = {1973},
  volume = {17},
  number = {5},
  pages = {420--425}
}

    Created by JabRef on 26/04/2024.