<--- Back to Details
First PageDocument Content
Machine learning / K-means clustering / Cluster analysis / K-medians clustering / Fisher–Yates shuffle / Data stream clustering / Expectation–maximization algorithm / Statistics / Computational statistics / K-means++
Date: 2012-03-24 02:44:28
Machine learning
K-means clustering
Cluster analysis
K-medians clustering
Fisher–Yates shuffle
Data stream clustering
Expectation–maximization algorithm
Statistics
Computational statistics
K-means++

Add to Reading List

Source URL: vldb.org

Download Document from Source Website

File Size: 503,52 KB

Share Document on Facebook

Similar Documents

Statistics / Computational statistics / Data analysis / Cluster analysis / Data mining / Geostatistics / K-means clustering / K-medians clustering / Approximation algorithm / Median / Data stream clustering / Single-linkage clustering

CS264: Beyond Worst-Case Analysis Lecture #6: Clustering in Approximation-Stable Instances∗ Tim Roughgarden† October 10, 2014

DocID: 1q8qV - View Document

Means / Cluster analysis / K-means clustering / Hierarchical clustering / Medoid / K-medoids / Centroid / Determining the number of clusters in a data set / K-medians clustering

Microsoft PowerPoint - GeocompCluster.ppt

DocID: 1pATd - View Document

Cluster analysis / Operations research / Data mining / Geostatistics / Hierarchical clustering / K-means clustering / K-medians clustering / K-means++ / Consensus clustering

A Clustering under Approximation Stability MARIA-FLORINA BALCAN, Georgia Institute of Technology AVRIM BLUM, Carnegie Mellon University ANUPAM GUPTA, Carnegie Mellon University

DocID: 1oTRI - View Document

K-means++ / K-means clustering / Cluster analysis / K-medians clustering / Data stream clustering

Scalable K-Means++ Bahman Bahmani Stanford University K-means Clustering —  Fundamental problem in data analysis and machine learning

DocID: 1oOJM - View Document

Operations research / Cluster analysis / Data mining / Geostatistics / K-means clustering / K-medians clustering / Minimum spanning tree / Dynamic programming / K-nearest neighbors algorithm

CS264: Beyond Worst-Case Analysis Lecture #7: Perturbation Stability and Single-Link++∗ Tim Roughgarden† October 13,

DocID: 1oMiP - View Document