Загрузка...
Reducing the Time Requirement of k-Means Algorithm
Traditional k-means and most k-means variants are still computationally expensive for large datasets, such as microarray data, which have large datasets with large dimension size d. In k-means clustering, we are given a set of n data points in d-dimensional space R(d) and an integer k. The problem i...
Сохранить в:
| Главные авторы: | , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Public Library of Science
2012
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3519838/ https://ncbi.nlm.nih.gov/pubmed/23239974 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0049946 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|