An Improved K-means Clustering Algorithm Applicable to Massive High-dimensional Matrix Datasets

E-ISSN： 2271-2097|11|issue|04001-04001

ISSN： 2271-2097

Source： ITM Web of conferences, Vol.11, Iss.issue, 2017-05, pp. : 04001-04001

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parallelization of K-Means Clustering Algorithm for Data Mining

ITM Web of conferences, Vol. 12, Iss. issue, 2017-09 ,pp. : 03048-03048

Edp Sciences

Access to resources Recommend Favorite

Smaller Coresets for k-Median and k-Means Clustering

By Har-Peled Sariel Kushal Akash

Discrete & Computational Geometry, Vol. 37, Iss. 1, 2007-01 ,pp. : 3-19

Springer Publishing Company

Access to resources Recommend Favorite

A parametric k -means algorithm

By Tarpey Thaddeus

Computational Statistics, Vol. 22, Iss. 1, 2007-04 ,pp. : 71-89

Springer Publishing Company

Access to resources Recommend Favorite

Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix

By Butucea Cristina Ingster Yuri I. Suslina Irina A.

ESAIM: Probability and Statistics, Vol. 19, Iss. issue, 2015-06 ,pp. : 115-134

Edp Sciences

Access to resources Recommend Favorite

Mixing in High-Dimensional Expanders

Combinatorics, Probability & Computing, Vol. 26, Iss. 5, 2017-09 ,pp. : 746-761

Cambridge University Press

Access to resources Recommend Favorite