1. Home
  2. Material Detail: Convex Sparse Methods for Feature Hierarchies

Material Detail

Convex Sparse Methods for Feature Hierarchies

Convex Sparse Methods for Feature Hierarchies

This video was recorded at 26th International Conference on Machine Learning (ICML), Montreal 2009. Sparse methods usually deal with the selection of a few elements from a large collection of pre-computed features. While theoretical results suggest that techniques based on the L1-norm can deal with exponentially many irrelevant features, current algorithms cannot handle more than millions of variables. In this talk, I will show how structured norms can deal in polynomial time with exponentially many features that are organized in a directed acyclic graph.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 8, 2015
Date Modified in MERLOT:
February 8, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as Convex Sparse Methods for Feature Hierarchies
People who viewed this also viewed
Other materials like Convex Sparse Methods for Feature Hierarchies

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.