期望最大化算法
算法
混合模型
计算机科学
人工智能
直线(几何图形)
树(集合论)
建筑
领域(数学分析)
数学
最大似然
机器学习
模式识别(心理学)
统计
数学分析
艺术
视觉艺术
几何学
作者
Michael I. Jordan,Robert A. Jacobs
标识
DOI:10.1162/neco.1994.6.2.181
摘要
We present a tree-structured architecture for supervised learning. The statistical model underlying the architecture is a hierarchical mixture model in which both the mixture coefficients and the mixture components are generalized linear models (GLIM's). Learning is treated as a maximum likelihood problem; in particular, we present an Expectation-Maximization (EM) algorithm for adjusting the parameters of the architecture. We also develop an on-line learning algorithm in which the parameters are updated incrementally. Comparative simulation results are presented in the robot dynamics domain.
科研通智能强力驱动
Strongly Powered by AbleSci AI