Dependent feature trees for density approximation II. Maximum likelihood clustering
作者:
C. B. CHITTINENI,
期刊:
International Journal of Remote Sensing
(Taylor Available online 1982)
卷期:
Volume 3,
issue 2
页码: 163-179
ISSN:0143-1161
年代: 1982
DOI:10.1080/01431168208948389
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
In this paper, maximum likelihood clustering for the decomposition of mixture density of data into its normal component densities is considered. Optimal dependent feature trees for approximating the densities can be constructed using criteria of mutual information and distance measures. By defining different types of nodes in a general dependent feature tree, maximum likelihood equations are developed for the estimation of parameters of mixture density using fixed-point iterations. Furthermore, the field structure of the data is also taken into account in developing maximum likelihood equations.
点击下载:
PDF (477KB)
返 回