Conference proceeding
Efficient subspace approximation algorithms
Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, Vol.7-09-, pp.532-540
SODA '07
01/07/2007
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 the scientific methodologies we have in mind include those from data mining and statistics.
Details
- Title: Subtitle
- Efficient subspace approximation algorithms
- Creators
- Nariankadu ShyamalkumarKasturi Varadarajan
- Resource Type
- Conference proceeding
- Publication Details
- Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, Vol.7-09-, pp.532-540
- Publisher
- Society for Industrial and Applied Mathematics
- Series
- SODA '07
- Language
- English
- Date published
- 01/07/2007
- Academic Unit
- Statistics and Actuarial Science; Computer Science
- Record Identifier
- 9984257733302771
Metrics
7 Record Views