Abstract
Logistic regression is one of the most commonly applied statistical methods for binary classification problems. This paper considers the nonnegative garrote regularization penalty in logistic models and derives an optimization algorithm for minimizing the resultant penalty function. The search algorithm is computationally efficient and can be used even when the number of regressors is much larger than the number of samples. As the nonnegative garrote requires an initial estimate of the parameters, a number of possible estimators are compared and contrasted. Logistic regression with the nonnegative garrote is then compared with several popular regularization methods in a set of comprehensive numerical simulations. The proposed method attained excellent performance in terms of prediction rate and variable selection accuracy on both real and artificially generated data.
| Original language | English |
|---|---|
| Title of host publication | AI 2011 |
| Subtitle of host publication | Advances in Artificial Intelligence - 24th Australasian Joint Conference, Proceedings |
| Publisher | Springer |
| Pages | 82-91 |
| Number of pages | 10 |
| ISBN (Print) | 9783642258312 |
| DOIs | |
| Publication status | Published - 2011 |
| Externally published | Yes |
| Event | Australasian Joint Conference on Artificial Intelligence 2011 - Perth, Australia Duration: 5 Dec 2011 → 8 Dec 2011 Conference number: 24th https://link.springer.com/book/10.1007/978-3-642-25832-9 (Proceedings) |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 7106 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | Australasian Joint Conference on Artificial Intelligence 2011 |
|---|---|
| Abbreviated title | AI 2011 |
| Country/Territory | Australia |
| City | Perth |
| Period | 5/12/11 → 8/12/11 |
| Internet address |
|