覆盖算法的概率模型
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60475017, 60675031 (国家自然科学基金); the National Basic Research Program of China under Grant No.2004CB318108 (国家重点基础研究发展计划(973)); the National Research Foundation for the Doctoral Program of Higher Education of the Ministry of Education of China under Grant No.20040357002 (国家教育部高等学校博士学科点专项科研基金); the Natural Science Foundation of Anhui Province of China under Grant No.050420208 (安徽省自然科学基金); the Provincial Project of Natural Science Research for Colleges and Universities of Anhui Province of China under Grant Nos.2006KJ015A, 2006KJ244B (安徽高等学校省级自然科学研究项目); the Innovative Research Team of 211 Project in Anhui University of China (安徽大学学术创新团队); the Program of Superior Teacher Team in Anhui University of China (安徽大学人才队伍建设经费)


Probabilistic Model for Covering Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    要从本质上提高覆盖算法的精度,必须在算法中引入全局的优化计算.为此,先将覆盖算法扩展成核覆盖算法(以高斯函数为核函数),再利用高斯函数的概率意义(高斯分布),为核覆盖算法建立一个有限混合概率模型,在此基础上,利用"最大似然原理"引入全局优化计算,并利用EM(expectation maximization)方法进行求解,完成对覆盖算法的全局优化计算,从而扩大覆盖方法的使用范围并提高算法的精度,且将它从确定的模型扩展成概率的模型,后者更具抗噪声干扰的能力.最后给出模拟实验,实验比较结果表明,经优化后的概率模型确实提高了算法的精度.

    Abstract:

    It is necessary to bring global optimization in covering algorithm to improve its precision of classification.So a probabilistic model of covering algorithm is put forward in this paper.Firstly,the covering algorithm is ameliorated to kernel covering model(Gaussian function is the kernel function),then a kind of finite mixture probabilistic model for kernel covering model is introduced according to the probabilistic meaning of Gaussian function.Finally,the global optimization calculation is inducted based on maximum likelihood theory and Expectation Maximization Algorithm.Therefore,the algorithm optimizes the covering network broadens the application domain of covering algorithm and improves its robustness.The experimental results show that the optimized probabilistic model of covering algorithm can improve the accuracy of classification.

    参考文献
    相似文献
    引证文献
引用本文

张铃,吴涛,周瑛,张燕平.覆盖算法的概率模型.软件学报,2007,18(11):2691-2699

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2006-04-24
  • 最后修改日期:2006-08-22
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号