Unsupervised learning of Gaussian mixtures based on variational component splitting

被引:70
作者
Constantinopoulos, Constantinos [1 ]
Likas, Aristidis [1 ]
机构
[1] Univ Ioannina, Dept Comp Sci, GR-45110 Ioannina, Greece
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2007年 / 18卷 / 03期
关键词
clustering; mixture models; model selection; variational Bayes methods;
D O I
10.1109/TNN.2006.891114
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present an incremental method for model selection and learning of Gaussian mixtures based on the recently proposed variational Bayes approach. The method adds components to the mixture using a Bayesian splitting test procedure: a component is split into two components and then variational update equations are applied only to the parameters of the two components. As a result, either both components are retained in the model or one of them is found to be redundant and is eliminated from the model. In our approach, the model selection problem is treated locally, in a region of the data space, so we can set more informative priors based on the local data distribution. A modified Bayesian mixture model is presented to implement this approach, along with a learning algorithm that iteratively applies a splitting test on each mixture component. Experimental results and comparisons with two other techniques testify for the adequacy of the proposed approach.
引用
收藏
页码:745 / 755
页数:11
相关论文
共 28 条
[1]  
Arfken G B, 2005, MATH METHODS PHYS
[2]  
Attias H, 1999, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, P21
[3]  
Attias H, 2000, ADV NEUR IN, V12, P209
[4]   A spatially constrained mixture model for image segmentation [J].
Blekas, K ;
Likas, A ;
Galatsanos, NP ;
Lagaris, IE .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (02) :494-498
[5]   Maximum weighted likelihood via rival penalized EM for density mixture clustering with automatic model selection [J].
Cheung, YM .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :750-761
[6]   An incremental training method for the probabilistic RBF network [J].
Constantinopoulos, Constantinos ;
Likas, Aristidis .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2006, 17 (04) :966-974
[7]  
Corduneanu C. Bishop, 2001, Artif. Intell. Statist., V18, P27
[8]  
Dasgupta S., 1999, P 40 ANN S FDN COMP, P634, DOI DOI 10.1109/SFFCS.1999.814639
[9]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[10]   Unsupervised learning of finite mixture models [J].
Figueiredo, MAT ;
Jain, AK .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (03) :381-396