Efficient subspace approximation algorithms
Published in Symposium on Discrete Algorithms • Jan 7, 2007
NobleIDNI7P63W23R20S49
Authors:,
Nariankadu D. Shyamalkumar
Kasturi Varadarajan
Abstract
Confronted with high-dimensional data arising from either word-document count, global climate patterns or any one of the myriad other sources, most scientific approaches extract a good low-dimensional summary. This desire to reduce dimensionality may be seen as a consequence of Occam's Razor, and th...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!