Presentation | 2002/1/22 Multi-thread Search with Deterministic Annealing EM Algorithm Masaharu TAKADA, Ryohei NAKANO, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | The EM algorithm is an efficient algorithm to obtain the ML estimate for incomplete data, but has the local optimality problem. The DAEM algorithm was once proposed to solve the problem, but is not guaranteed to obtain the global optimum since it employs a single token search. The paper investigates the possibility of the multiple-thread search with the DAEM algorithm for a Gaussian mixture. The experiments showed the minimal beam size to guarantee the global optimality is not so large for a Gaussian mixture, and the solution quality of the beam DAEM algorithm always exceeds the EM and DAEM algorithms. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | maximum likelihood / EM algorithm / DAEM algorithm / Gaussian mixture / beam search |
Paper # | |
Date of Issue |
Conference Information | |
Committee | NC |
---|---|
Conference Date | 2002/1/22(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Neurocomputing (NC) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Multi-thread Search with Deterministic Annealing EM Algorithm |
Sub Title (in English) | |
Keyword(1) | maximum likelihood |
Keyword(2) | EM algorithm |
Keyword(3) | DAEM algorithm |
Keyword(4) | Gaussian mixture |
Keyword(5) | beam search |
1st Author's Name | Masaharu TAKADA |
1st Author's Affiliation | Department of Intelligence and Computer Science, Nagoya Institute of Technology() |
2nd Author's Name | Ryohei NAKANO |
2nd Author's Affiliation | Department of Intelligence and Computer Science, Nagoya Institute of Technology |
Date | 2002/1/22 |
Paper # | |
Volume (vol) | vol.101 |
Number (no) | 616 |
Page | pp.pp.- |
#Pages | 7 |
Date of Issue |