Full Paper at IEEE Xplore

Machine Learning Methods and Applications

Přednášející: Seungjin Choi, Autoři: Sunho Park, Seungjin Choi, POSTECH, Republic of Korea

Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final answer. We present a convex optimization-based method for aggregating results of binary classifiers in an optimal way to estimate class membership probabilities. We model the class membership probability as a softmax function whose input argument is a conic combination of discrepancies induced by individual binary classifiers. With this model, we formulate the l_1-regularized maximum likelihood estimation as a convex optimization that is solved by geometric programming. Numerical experiments on several UCI datasets demonstrate the high performance of our method, compared to existing methods.

  Přepis řeči



Please sign in to post your comment!

  Informace o přednášce

Nahráno: 2011-05-27 13:45 - 14:05, Club H
Přidáno: 21. 6. 2011 20:18
Počet zhlédnutí: 48
Rozlišení videa: 1024x576 px, 512x288 px
Délka videa: 0:19:26
Audio stopa: MP3 [6.56 MB], 0:19:26