Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Clark, Jessica | - |
dc.contributor.author | Provost, Foster | - |
dc.date.accessioned | 2015-05-27T13:52:05Z | - |
dc.date.available | 2015-05-27T13:52:05Z | - |
dc.date.issued | 2015-05-27 | - |
dc.identifier.uri | http://hdl.handle.net/2451/33970 | - |
dc.description.abstract | Matrix factorization is a popular technique for engineering features for use in predictive models; it is viewed as a key part of the predictive analytics process and is used in many different domain areas. The purpose of this paper is to investigate matrix-factorization-based dimensionality reduction as a design artifact in predictive analytics. With the rise in availability of large amounts of sparse behavioral data, this investigation comes at a time when traditional techniques must be reevaluated. Our contribution is based on two lines of inquiry: we survey the literature on dimensionality reduction in predictive analytics, and we undertake an experimental evaluation comparing using dimensionality reduction versus not using dimensionality reduction for predictive modeling from large, sparse behavioral data. Our survey of the dimensionality reduction literature reveals that, despite mixed empirical evidence as to the benefit of computing dimensionality reduction, it is frequently applied in predictive modeling research and application without either comparing to a model built using the full feature set or utilizing state-of-the-art predictive modeling techniques for complexity control. This presents a concern, as the survey reveals complexity control as one of the main reasons for employing dimensionality reduction. This lack of comparison is troubling in light of our empirical results. We experimentally evaluate the e cacy of dimensionality reduction in the context of a collection of predictive modeling problems from a large-scale published study. We find that utilizing dimensionality reduction improves predictive performance only under certain, rather narrow, conditions. Specifically, under default regularization (complexity control)settings dimensionality reduction helps for the more di cult predictive problems (where the predictive performance of a model built using the original feature set is relatively lower), but it actually decreases the performance on the easier problems. More surprisingly, employing state-of-the-art methods for selecting regularization parameters actually eliminates any advantage that dimensionality reduction has! Since the value of building accurate predictive models for business analytics applications has been well-established, the resulting guidelines for the application of dimensionality reduction should lead to better research and managerial decisions. | en_US |
dc.description.sponsorship | NYU Stern School of Business | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ;CBA-15-02 | - |
dc.title | Dimensionality Reduction via Matrix Factorization for Predictive Modeling from Large, Sparse Behavioral Data | en_US |
dc.type | Working Paper | en_US |
Appears in Collections: | Center for Business Analytics Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CBA-15-02.pdf | 616.95 kB | Adobe PDF | View/Open |
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.