Canopy clustering algorithm
id:
canopy-clustering-algorithm-182-16168825
title:
Canopy clustering algorithm
text:
The canopy clustering algorithm is an unsupervised pre-clustering algorithm introduced by Andrew McCallum, Kamal Nigam and Lyle Ungar in 2000. It is often used as preprocessing step for the K-means algorithm or the hierarchical clustering algorithm. It is intended to speed up clustering operations on large data sets, where using another algorithm directly may be impractical due to the size of the data set.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Canopy_clustering_algorithm
date created:
2007-12-02T17:31:21Z
date modified:
2024-09-06T16:27:54Z
main entity:
{"identifier":"Q5033439","url":"https://www.wikidata.org/entity/Q5033439"}
image:
fields total:
13
integrity:
14