Nearest Hyperdisk Methods for High-Dimensional Classification thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Nearest Hyperdisk Methods for High-Dimensional Classification

Published on Aug 05, 20084282 Views

In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample distributions cause lo

Related categories