计算机工程 ›› 2011, Vol. 37 ›› Issue (18): 190-191.doi: 10.3969/j.issn.1000-3428.2011.18.063

• 人工智能及识别技术 • 上一篇    下一篇

一种改进的领域覆盖算法

张月琴,丁旭玲   

  1. (太原理工大学计算机科学与技术学院,太原 030024)
  • 收稿日期:2011-03-02 出版日期:2011-09-20 发布日期:2011-09-20
  • 作者简介:张月琴(1963-),女,教授,主研方向:数据挖掘;丁旭玲,硕士研究生
  • 基金项目:

    山西省自然科学基金资助项目(2008011028-1)

Improved Neighborhood Covering Algorithm

ZHANG Yue-qin, DING Xu-ling   

  1. (College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan 030024, China)
  • Received:2011-03-02 Online:2011-09-20 Published:2011-09-20

摘要: 为解决领域覆盖算法中覆盖中心的选取问题,引入遗传算法中的适应度函数,提出一种改进的覆盖算法。以覆盖样本数最多为目标设计适应度函数,通过计算每个样本的适应度值来搜索最优覆盖中心,采用神经网络和灵敏度相结合的方法计算输入因素对输出因素的决策权重。实验证明,该算法能保证覆盖的稳定性,且覆盖中心的个数较少。

关键词: 覆盖算法, 适应度函数, 灵敏度系数, 特征权重, 神经网络

Abstract: In order to solve the problem of selection of the center cover, this paper combines fitness function of the genetic algorithm with covering algorithm, and presents an improvement on neighborhood covering algorithm. Most samples are covered, and fitness function is designed. Decision weights are calculated by using neural networks and sensitivity of the method of combining. Experiments show this algorithm which searches the best coverage center in the sample space, ensures that the coverage is stable, and the number is less.

Key words: covering algorithm, fitness function, sensitivity coefficient, feature weight, neural network

中图分类号: