Moseley, B, and Wang, J. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. Retrieved from https://par.nsf.gov/biblio/10200220. Journal of machine learning research .
Moseley, B, & Wang, J. Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. Journal of machine learning research, (). Retrieved from https://par.nsf.gov/biblio/10200220.
Moseley, B, and Wang, J.
"Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search". Journal of machine learning research (). Country unknown/Code not available. https://par.nsf.gov/biblio/10200220.
@article{osti_10200220,
place = {Country unknown/Code not available},
title = {Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search},
url = {https://par.nsf.gov/biblio/10200220},
abstractNote = {},
journal = {Journal of machine learning research},
author = {Moseley, B and Wang, J},
editor = {null}
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.