An Empirical Evaluation of Supervised Learning in High Dimensions

author: Nikos Karampatziakis, Department of Computer Science, Cornell University
published: Aug. 29, 2008,   recorded: July 2008,   views: 161

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

In this paper we perform an empirical evaluation of supervised learning methods on high dimensional data. We evaluate learning performance on three metrics: accuracy, AUC, and squared loss. We also study the effect of increasing dimensionality on the relative performance of the learning algorithms. Our findings are consistent with previous studies for problems of relatively low dimension, but suggest that as dimensionality increases the relative performance of the various learning algorithms changes. To our surprise, the methods that seem best able to learn from high dimensional data are random forests and neural nets.

See Also:

Download slides icon Download slides: icml08_karampatziakis_aee_01.pdf (1.0┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 athlion, September 21, 2008 at 8:21 p.m.:

I am unable to view this lecture in neither Windows XP, nor MacOS X. I can watch other lectures but not this one!

Write your own review or comment:

make sure you have javascript enabled or clear this field: