1. Home
  2. Material Detail: Greedy Function Optimization in Learning to Rank

Material Detail

Greedy Function Optimization in Learning to Rank

Greedy Function Optimization in Learning to Rank

This video was recorded at 3rd Russian Summer School in Information Retrieval (RuSSIR), Petrozavodsk 2009. Greedy function approximation and boosting algorithms are well suited for solving practical machine learning tasks. We will describe well-known boosting algorithms and their modifications used for solving learning to rank problems.
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 10, 2015
Date Modified in MERLOT:
February 10, 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:
Russian
Cost Involved:
No
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as Greedy Function Optimization in Learning to Rank
People who viewed this also viewed
Other materials like Greedy Function Optimization in Learning to Rank

Comments

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