Difference between revisions of "User talk:Xxiong"
From Cohen Courses
Jump to navigationJump to searchPastStudents (talk | contribs) |
PastStudents (talk | contribs) |
||
| Line 7: | Line 7: | ||
== Goal == | == Goal == | ||
1. A revisit of boosting. | 1. A revisit of boosting. | ||
| + | |||
2. | 2. | ||
== Motivation == | == Motivation == | ||
| Line 20: | Line 21: | ||
== Superpowers == | == Superpowers == | ||
| + | |||
| + | Experience with CRF and stacking in the domain of computer vision. | ||
== What question you want to answer == | == What question you want to answer == | ||
| Line 25: | Line 28: | ||
the traditional Ada-boost. | the traditional Ada-boost. | ||
| − | 2 | + | 2. |
| − | |||
| − | |||
Revision as of 01:04, 29 September 2010
Contents
Project Proposal I
Team Members
Xuehan Xiong [xxiong@andrew.cmu.edu]
Goal
1. A revisit of boosting.
2.
Motivation
1. In the traditional boosting, within each iteration the mis-classified samples are weighted more in the next round. However, these errors are made from training data. In my algorithm, I will give more weight to the data that are mis-labeled from cross-validation process, as in stacking.
2.
Dataset
Superpowers
Experience with CRF and stacking in the domain of computer vision.
What question you want to answer
1. I want to know whether the proposed algorithm will outperform the traditional Ada-boost.
2.
