- We will send in 10–14 business days.
/images/books/11784716/9781680831405.jpg)
- Author: Madeleine Udell
- Publisher: Now Publishers
- ISBN-10: 1680831402
- ISBN-13: 9781680831405
- Format: 15.6 x 23.4 x 0.8 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well-known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, k-means, k-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.21:59:30
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Madeleine Udell
- Publisher: Now Publishers
- ISBN-10: 1680831402
- ISBN-13: 9781680831405
- Format: 15.6 x 23.4 x 0.8 cm, softcover
- Language: English English
Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well-known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, k-means, k-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.
Reviews