Gentle Nearest Neighbors Boosting over Proper Scoring Rules
Tailoring nearest neighbors algorithms to boosting is an important problem. Recent papers study an approach, UNN, which provably minimizes particular convex surrogates under weak assumptions. However, numerical issues make it necessary to experimentally tweak parts of the UNN algorithm, at the possi...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 37(2015), 1 vom: 01. Jan., Seite 80-93
|
|---|
| 1. Verfasser: |
Nock, Richard
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Ali, Wafa Bel Haj,
D'Ambrosio, Roberto,
Nielsen, Frank,
Barlaud, Michel |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2015
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article |
|---|