## Abstract

We present an algorithmic framework for phoneme classification where the set of phonemes is organized in a predefined hierarchical structure. This structure is encoded via a rooted tree which induces a metric over the set of phonemes. Our approach combines techniques from large margin kernel methods and Bayesian analysis. Extending the notion of large margin to hierarchical classification, we associate a prototype with each individual phoneme and with each phonetic group which corresponds to a node in the tree. We then formulate the learning task as an optimization problem with margin constraints over the phoneme set. In the spirit of Bayesian methods, we impose similarity requirements between the prototypes corresponding to adjacent phonemes in the phonetic hierarchy. We describe a new online algorithm for solving the hierarchical classification problem and provide worst-case loss analysis for the algorithm. We demonstrate the merits of our approach by applying the algorithm to synthetic data and as well as speech data.

Original language | English (US) |
---|---|

Pages (from-to) | 146-158 |

Number of pages | 13 |

Journal | LECTURE NOTES IN COMPUTER SCIENCE |

Volume | 3361 |

DOIs | |

State | Published - 2005 |

Event | First International Workshop on Machine Learning for Multimodal Interaction, MLMI 2004 - Martigny, Switzerland Duration: Jun 21 2004 → Jun 23 2004 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- General Computer Science