CURE algorithm

CURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases. Compared with K-means clustering it is more robust to outliers and able to identify clusters having non-spherical shapes and size variances.

Comment
enCURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases. Compared with K-means clustering it is more robust to outliers and able to identify clusters having non-spherical shapes and size variances.
Has abstract
enCURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases. Compared with K-means clustering it is more robust to outliers and able to identify clusters having non-spherical shapes and size variances.
Is primary topic of
CURE algorithm
Label
enCURE algorithm
Link from a Wikipage to an external page
books.google.com/books%3Fid=gAGRCmp8Sp8C&pg=PA572%7Cpages=572%E2%80%93574%7Cauthor2=Koutroumbas,
www.cs.sfu.ca/CC/459/han/papers/guha98.pdf%7Ctitle=
github.com/annoviko/pyclustering
Link from a Wikipage to another Wikipage
Analysis of algorithms
BFR algorithm
BIRCH (data clustering)
Category:Articles with example pseudocode
Category:Cluster analysis algorithms
Computational complexity theory
Database
Data clustering
Data point
Hierarchical clustering
Kd-tree
K-means clustering
Outlier
Primary storage
Random sample
Robust statistics
Sample space
Sampling (statistics)
Sum of squared error
Trade-off
Wikt:middle ground
SameAs
4eZjo
Q5014717
Алгоритм CURE
Subject
Category:Articles with example pseudocode
Category:Cluster analysis algorithms
WasDerivedFrom
CURE algorithm?oldid=1085332370&ns=0
WikiPageLength
5707
Wikipage page ID
22643107
Wikipage revision ID
1085332370
WikiPageUsesTemplate
Template:Citation needed
Template:Cite book
Template:Cite journal
Template:Machine learning
Template:Short description