Deterministic Feature Selection for $k$-means Clustering

Details Deterministic Feature Selection for $k$-means Clustering Deterministic Feature Selection for $k$-means Clustering

2011-09-26

arxiv.org/abs/1109.5664v2

Computer Science

Learning

Scientific paper

We study feature selection for $k$-means clustering. Although the literature contains many methods with good empirical performance, algorithms with provable theoretical behavior have only recently been developed. Unfortunately, these algorithms are randomized and fail with, say, a constant probability. We address this issue by presenting a \emph{deterministic} feature selection algorithm for $k$-means with theoretical guarantees. At the heart of our algorithm lies a deterministic method for decompositions of the identity.

Affiliated with

Also associated with

No associations

Rating

Deterministic Feature Selection for $k$-means Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Feature Selection for $k$-means Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Feature Selection for $k$-means Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690137