Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1326-5158-7 |
Объём: | 64 страниц |
Масса: | 117 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles!Determining the number of clusters in a data set, a quantity often labeled k as in the K-means algorithm, is a frequent problem in data clustering, and is a distinct issue from the process of actually solving the clustering problem. For a certain class of clustering algorithms (in particular k-means, K-medoids and Expectation-maximization algorithm), there is a parameter commonly referred to as k that specifies the number of clusters to detect. Other algorithms such as DBSCAN and OPTICS algorithm do not require the specification of this parameter.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.