Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs

François Bavaud. Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs. In José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag, editors, Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part I. Volume 6321 of Lecture Notes in Computer Science, pages 103-118, Springer, 2010. [doi]

@inproceedings{Bavaud10,
  title = {Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs},
  author = {François Bavaud},
  year = {2010},
  doi = {10.1007/978-3-642-15880-3_13},
  url = {http://dx.doi.org/10.1007/978-3-642-15880-3_13},
  researchr = {https://researchr.org/publication/Bavaud10},
  cites = {0},
  citedby = {0},
  pages = {103-118},
  booktitle = {Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part I},
  editor = {José L. Balcázar and Francesco Bonchi and Aristides Gionis and Michèle Sebag},
  volume = {6321},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-15879-7},
}