Generalization of the EM algorithm for mixture density estimation

被引:22
|
作者
Kehtarnavaz, N [1 ]
Nakamura, E
机构
[1] Texas A&M Univ, Dept Elect Engn, College Stn, TX 77843 USA
[2] Aichi Inst Technol, Dept Informat Network Engn, Toyota, Aichi 47003, Japan
关键词
mixture density estimation; expectation-maximization; model selection; multi-scale clustering;
D O I
10.1016/S0167-8655(97)00173-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The expectation-maximization (EM) algorithm is used for estimating mixture density parameters. This algorithm relies on the assumption that the number of component densities is given or known. This paper presents a preprocessing module to generalize the EM algorithm for the purpose of easing the assumption regarding the number of component densities. This module consists of a clustering algorithm, called multi-scale clustering, which allows an optimal number of component densities to be found by using scale-space theory. Examples are provided to (i) illustrate the improvement made by this generalization over the original EM algorithm and (ii) examine the performance of the developed algorithm in realistic situations. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:133 / 140
页数:8
相关论文
共 50 条