#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1968

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Trevor J. Hastie, Robert Tibshirani, Jerome H. Friedman
- Springer series in statistics
- 2009

by E.T. Jaynes CAMBRIDGE, CAMBRIDGE UNIVERSITY PRESS, 2003 727pp. $65.00 HARDBACK ISBN 0-521-59271-2 The Fundamentals of Risk Measurement by Chris Marrison BOSTON, McGRAW-HILL, 2002 415pp. $44.95… (More)

Boosting is one of the most important recent developments in classification methodology. Boosting works by sequentially applying a classification algorithm to reweighted versions of the training data… (More)

- Jerome H. Friedman, Trevor J. Hastie, Rob Tibshirani
- Journal of statistical software
- 2010

We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multinomial regression problems… (More)

- Jerome H. Friedman, Trevor J. Hastie, Robert Tibshirani
- Biostatistics
- 2008

We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm--the… (More)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of… (More)

Gradient boosting constructs additive regression models by sequentially tting a simple parameterized function (base learner) to current \pseudo"{residuals by least{squares at each iteration. The… (More)

We consider “one-at-a-time” coordinate-wise descent algorithms for a class of convex optimization problems. An algorithm of this kind has been proposed for the L1-penalized regression (lasso) in the… (More)

- Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel
- ACM Trans. Math. Softw.
- 1977

An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.… (More)

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use… (More)

- Jerome H. Friedman, John W. Tukey
- IEEE Transactions on Computers
- 1974

An algorithm for the analysis of multivariate data is presented and is discussed in terms of specific examples. The algorithm seeks to find one-and two-dimensional linear projections of multivariate… (More)