A Simple and Efficient Algorithm for Variable Ranking and Redundancy Detection

author: Oscar Luaces, Artificial Intelligence Center, University of Oviedo at Gijón

You might be experiencing some problems with Your Video player.

*Slides*
0:00	A simple and efficient algorithm for variable ranking and redundancy detection
0:19	Outline
1:12	Introduction
2:21	Some state-of-the-art rankers: SVM wrappers
5:26	Some state-of-the-art rankers: filters pt 1
7:32	Some state-of-the-art rankers: filters pt 2
9:15	SPE-ranker pt 1
10:49	SPE-ranker pt 2
11:54	Experimental results
13:25	Experimental results: performance measure
16:06	Experimental results - Varying redundancy: AUC-FR
17:57	Experimental results - Varying redundancy: running time
18:51	Experimental results - Varying # of irrelevants: AUC-FR
19:31	Experimental results - Varying # of irrelevants: running time
20:25	Conclusions

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.