Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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 present the first deterministic feature selection algorithm for k-means clustering with relative error guarantees. At the heart of our algorithm lies a deterministic method for decompositions of the identity and a structural result which quantifies some of the tradeoffs in dimensionality reduction. © 1963-2012 IEEE.
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007