2007 Seventh IEEE International Conference on Data Mining Finding Predictive Runs with LAPS Omaha, Nebraska, USA October 28-October 31 ISBN: 0-7695-3018-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2007.84
We present an extension to the Lasso [6] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [5] and the Group Lasso [7, 3] models, we aim to both discover and model runs (contiguous subgroups of the variables) that are highly predictive. We call the extended model LAPS (the Lasso with Attribute Partition Search). Such problems commonly arise in financial and medical domains, where predictors are time series variables, for example. This paper outlines the formulation of the problem, an algorithm to obtain the model coefficients and experiments showing applicability to practical problems of this type.
Citation:
Suhrid Balakrishnan, David Madigan, "Finding Predictive Runs with LAPS," icdm, pp.415-420, 2007 Seventh IEEE International Conference on Data Mining, 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||