@article{newman2006fcs,
  author = {Newman, MEJ},
  interhash = {5003bcb34d28e1e4bc301fafb9a12c72},
  intrahash = {090a24e34da3d0ab3d14d61dd3ad3285},
  journal = {Physical Review E},
  number = 3,
  pages = 36104,
  publisher = {APS},
  title = {{Finding community structure in networks using the eigenvectors of matrices}},
  volume = 74,
  year = 2006
}

@book{Chung:1997,
  author = {Chung, F. R. K.},
  interhash = {0f0fd754924d4dd54bc185bd1c71d00b},
  intrahash = {95ef10b5a69a03d8507240b6cf410f8a},
  publisher = {American Mathematical Society},
  title = {Spectral Graph Theory},
  year = 1997
}

@misc{Monien_onspectral,
  author = {Monien, B.},
  interhash = {aa800b59576cd3b65d76650dde88313f},
  intrahash = {6ae2643d830d183886ee56d87dc4482d},
  title = {On Spectral Bounds for the k-Partitioning of Graphs},
  year = 2001
}

@article{journals/tcad/ChanSZ94,
  author = {Chan, Pak K. and Schlag, Martine D. F. and Zien, Jason Y.},
  date = {2006-05-31},
  ee = {http://doi.ieeecomputersociety.org/10.1109/43.310898},
  interhash = {f6aa8b385e7b3c62384596f70e7de423},
  intrahash = {9aabfb2ef97763db1ae308576b8c0258},
  journal = {IEEE Trans. on CAD of Integrated Circuits and Systems},
  number = 9,
  pages = {1088-1096},
  title = {Spectral K-way ratio-cut partitioning and clustering.},
  url = {http://dblp.uni-trier.de/db/journals/tcad/tcad13.html#ChanSZ94},
  volume = 13,
  year = 1994
}

@inproceedings{yu2003multiclass,
  address = {Nice, France},
  author = {Yu, Stella X. and Shi, Jianbo},
  booktitle = {Proc. International Conference on Computer Vision (ICCV 03)},
  interhash = {5ab7b4161bb7cf197db80fe14787e8ac},
  intrahash = {d73e1ffedf586cdbaf076277e7c1add6},
  month = oct,
  title = {Multiclass Spectral Clustering},
  year = 2003
}

@article{journals/tcad/HagenK92,
  author = {Hagen, Lars W. and Kahng, Andrew B.},
  date = {2006-06-19},
  ee = {http://doi.ieeecomputersociety.org/10.1109/43.159993},
  interhash = {18e3392d9ead65ea9a4c0d7a6062b8eb},
  intrahash = {74b87fbffdbc96f4b8ff54c92dc45485},
  journal = {IEEE Trans. on CAD of Integrated Circuits and Systems},
  number = 9,
  pages = {1074-1085},
  title = {New spectral methods for ratio cut partitioning and clustering.},
  url = {http://dblp.uni-trier.de/db/journals/tcad/tcad11.html#HagenK92},
  volume = 11,
  year = 1992
}

@inproceedings{1454017,
  address = {New York, NY, USA},
  author = {Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis},
  booktitle = {RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems},
  doi = {http://doi.acm.org/10.1145/1454008.1454017},
  interhash = {8ee38f4ffc05845fcb98f121fb265d48},
  intrahash = {e93afe409833a632af02290bbe134cba},
  isbn = {978-1-60558-093-7},
  location = {Lausanne, Switzerland},
  pages = {43--50},
  publisher = {ACM},
  title = {Tag recommendations based on tensor dimensionality reduction},
  url = {http://portal.acm.org/citation.cfm?id=1454017},
  year = 2008
}

@unpublished{ranade:sus,
  author = {Ranade, A.G.},
  interhash = {473e92f688426631dd9ccc7639a5e861},
  intrahash = {9f7f1562631792a85f2dd5f5eefbcf4d},
  title = {{Some uses of spectral methods}},
  year = 2000
}

@article{white2005sca,
  author = {White, S. and Smyth, P.},
  booktitle = {SIAM Data Mining},
  interhash = {180d37026ab6ea4f4c3f6aba9c405929},
  intrahash = {310763d5fe7195d89883c91c90681e03},
  title = {{A spectral clustering approach to finding communities in graph}},
  year = 2005
}

@article{newman2006mac,
  author = {Newman, MEJ},
  interhash = {e664336d414a1e21d89f30cc56f5e739},
  intrahash = {9104cb1678a39c96b06ed838a8aa3a63},
  journal = {Proceedings of the National Academy of Sciences},
  number = 23,
  pages = {8577--8582},
  publisher = {National Acad Sciences},
  title = {{Modularity and community structure in networks}},
  volume = 103,
  year = 2006
}

@inproceedings{Alpert95spectralpartitioning:,
  author = {Alpert, Charles J. and Kahng, Andrew B. and zen Yao, So},
  booktitle = {Proc. ACM/IEEE Design Automation Conf},
  interhash = {8384ccbb6b91c08c6ce73b2bde86bfd9},
  intrahash = {13da262902e2a4425f7799a519163b99},
  pages = {195--200},
  title = {Spectral partitioning: The more eigenvectors, the better},
  year = 1995
}

@article{filippone2008ska,
  author = {Filippone, M. and Camastra, F. and Masulli, F. and Rovetta, S.},
  interhash = {3f9fe20110b6e183530cd675bb0ba3e6},
  intrahash = {30fe8946a31d33d0fa81c16ec04287aa},
  journal = {Pattern recognition},
  number = 1,
  pages = {176--190},
  publisher = {Elsevier},
  title = {{A survey of kernel and spectral methods for clustering}},
  volume = 41,
  year = 2008
}

@article{verma2003csc,
  author = {Verma, D. and Meila, M.},
  interhash = {dbf30d8faf00e7187c8e6b620c455b9a},
  intrahash = {829d5543415a8d8cd6c0db75c025c9d3},
  journal = {University of Washington, Tech. Rep. UW-CSE-03-05-01},
  title = {{A comparison of spectral clustering algorithms}},
  year = 2003
}

@article{butler:cgb,
  author = {Butler, S.},
  interhash = {f16d0b8f861076987ebb425f10d86702},
  intrahash = {0e4bb8ea8af8a8bf2a02aadddfaa24cd},
  title = {{Cospectral graphs for both the adjacency and normalized Laplacian matrices}},
  year = 2000
}

@unpublished{butler2006-3,
  author = {Butler, Steve},
  interhash = {852cf90cdc865cd9c7985875bcde2160},
  intrahash = {08749179a19f8bc991ed31a5cd75d386},
  title = {Spectral Graph Theory: Cheeger constants and discrepancy},
  year = 2006
}

@unpublished{butler2006,
  author = {Butler, Steve},
  interhash = {21702760185fe285dc7417c3c6710e03},
  intrahash = {cf17d1411eec30ade5414de1342a46d9},
  title = {Spectral Graph Theory: Applications of Courant Fischer},
  year = 2006
}

@unpublished{butler2006-1,
  author = {Butler, Steve},
  interhash = {115d301ff774f0b990c66b354c06f139},
  intrahash = {ed2937203a56179d580680c7bdf9fd9a},
  title = {Spectral Graph Theory: Three common spectra},
  year = 2006
}

@article{guattery1998qss,
  author = {Guattery, S. and Miller, G.L.},
  interhash = {a02ade746e7a052d1162d327c9db1cff},
  intrahash = {2802accf4ca63399a4af7d748f3e3c53},
  journal = {SIAM Journal on Matrix Analysis and Applications},
  number = 3,
  pages = {701--719},
  publisher = {[Philadelphia, Pa.: The Society, c1988-},
  title = {{On the quality of spectral separators}},
  volume = 19,
  year = 1998
}

@article{donath1973lbp,
  author = {Donath, W.E. and Hoffman, A.J.},
  interhash = {ff38bdeb46caa114a3efad739319973f},
  intrahash = {7cb789bd22dfa8ccdd2abdd30121dfc9},
  journal = {IBM Journal of Research and Development},
  number = 5,
  pages = {420--425},
  title = {{Lower bounds for the partitioning of graphs}},
  volume = 17,
  year = 1973
}

@inproceedings{Ng01onspectral,
  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},
  author = {Ng, Andrew Y. and Jordan, Michael I. and Weiss, Yair},
  booktitle = {Advances in Neural Information Processing Systems 14},
  interhash = {b72c97e659127fc653a0d51143d85b0c},
  intrahash = {7485849e42418ee5ceefb45dc6eb603c},
  pages = {849--856},
  publisher = {MIT Press},
  title = {On spectral clustering: Analysis and an algorithm},
  year = 2001
}