Probabilistic Model for Covering Algorithm
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 24,2006
  • Revised:August 22,2006
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063