Daniel Aloise
, Amit Deshpande, Pierre Hansen and Preyas Popat
Article (2009)
An external link is available for this item
| Department: | Department of Computer Engineering and Software Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/52230/ |
| Journal Title: | Machine Learning (vol. 75, no. 2) |
| Publisher: | Springer |
| DOI: | 10.1007/s10994-009-5103-0 |
| Official URL: | https://doi.org/10.1007/s10994-009-5103-0 |
| Date Deposited: | 18 Apr 2023 15:14 |
| Last Modified: | 25 Sep 2024 16:43 |
| Cite in APA 7: | Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2), 245-248. https://doi.org/10.1007/s10994-009-5103-0 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
