Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2010

ACM

2010

ACM

We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each point of P to this subspace. More generally, the Fq( p)-subspace approximation problem asks for a j-subspace that minimizes the sum of qth powers of p-distances to this subspace, up to a multiplicative factor of (1 + ). We develop techniques for subspace approximation, regression, and matrix approximation that can be used to deal with massive data sets in high dimensional spaces. In particular, we develop coresets and sketches, i.e. small space representations that approximate the input point set P with respect to the subspace approximation problem. Our results are: ? A dimensionality reduction method that can be applied to Fq( p)-clustering and shape fitting problems, such as those in [8, 15]. ? The first strong coreset for F1( 2)-subspace approximation in high-dimensional spaces, i.e. of size polynomial in t...

Related Content

Added |
01 Mar 2010 |

Updated |
02 Mar 2010 |

Type |
Conference |

Year |
2010 |

Where |
SODA |

Authors |
Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff |

Comments (0)