An Efficient Online Algorithm for Hierarchical Phoneme Classification

author: Joseph Keshet, The Hebrew University of Jerusalem
published: Feb. 25, 2007,   recorded: June 2004,   views: 3578


Related Open Educational Resources

Related content

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.
Lecture popularity: You need to login to cast your vote.


We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded by a rooted tree which induces a metric over the label set. Our approach combines ideas from large margin kernel methods and Bayesian analysis. Following the large margin principle, we associate a prototype with each label in the tree and formulate the learning task as an optimization problem with varying margin constraints. In the spirit of Bayesian methods, we impose similarity requirements between the prototypes corresponding to adjacent labels in the hierarchy. We describe a new online algorithm for solving the hierarchical classification problem and derive a worst case loss-bound for the algorithm. We demonstrate the merits of our approach with a series of experiments on synthetic data and speech data.

See Also:

Download slides icon Download slides: mlmi04ch_keshet_eoahp_01.ppt (589.0┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: