Timezone: »

Unsupervised Feature Selection for the $k$-means Clustering Problem
Christos Boutsidis · Michael W Mahoney · Petros Drineas

Mon Dec 07 07:00 PM -- 11:59 PM (PST) @
We present a novel feature selection algorithm for the $k$-means clustering problem. Our algorithm is randomized and, assuming an accuracy parameter $\epsilon \in (0,1)$, selects and appropriately rescales in an unsupervised manner $\Theta(k \log(k / \epsilon) / \epsilon^2)$ features from a dataset of arbitrary dimensions. We prove that, if we run any $\gamma$-approximate $k$-means algorithm ($\gamma \geq 1$) on the features selected using our method, we can find a $(1+(1+\epsilon)\gamma)$-approximate partition with high probability.

Author Information

Christos Boutsidis (IBM T.J. Watson Research)
Michael W Mahoney (UC Berkeley)
Petros Drineas (Rensselaer Polytechnic Institute)

More from the Same Authors