Nassara Elhadji Ille Gado

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this article, random matrix theory is used to propose a new K-means clustering algorithm via linear PCA. Our approach is devoted to linear PCA estimation when the number of the features d and the number of samples n go to infinity at the same rate. More precisely, we deal with the problem of building a consistent estimator of the eigenvectors of the(More)
  • 1