【24h】

Upper bounds of stochastic complexity in mixture models

机译:Upper bounds of stochastic complexity in mixture models

获取原文
获取原文并翻译 | 示例
       

摘要

It is well known that mixture models such as gaussian mixtures are non-regular statistical models, since the set of parameters of small size models is an analytic set with singularities in the apace of parameters of a large size models. Because of these singularities, the mathematical foundation of the models is not yet constructed though the models are applied in a lot of information processing systems. Recent years using the algebraic geometrical method, we can calculate the stochastic complexity that is the roost important value to clarify the models. This paper proves the theorem that shows the tipper hounds of it in mixture models with the method.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号