首页> 外文会议>Advanced Workshop on Content Computing >Rule Discovery with Particle Swarm Optimization
【24h】

Rule Discovery with Particle Swarm Optimization

机译:粒子群优化规则发现

获取原文

摘要

This paper proposes Particle Swarm Optimization (PSO) algorithm to discover classification rules. The potential IF-THEN rules are encoded into real-valued particles that contain all types of attributes in data sets. Rule discovery task is formulized into an optimization problem with the objective to get the high accuracy, generalization performance, and comprehensibility, and then PSO algorithm is employed to resolve it. The advantage of the proposed approach is that it can be applied on both categorical data and continuous data. The experiments are conducted on two benchmark data sets: Zoo data set, in which all attributes are categorical, and Wine data set, in which all attributes except for the classification attribute are continuous. The results show that there is on average the small number of conditions per rule and a few rules per rule set, and also show that the rules have good performance of predictive accuracy and generalization ability.
机译:本文提出了粒子群优化(PSO)算法来发现分类规则。 潜在的IF-DEN-DEL规则被编码为具有数据集中所有类型的属性的实际值粒子。 规则发现任务在优化问题中配方,目标是为了获得高精度,泛化性能和可理解性,然后采用PSO算法来解决它。 所提出的方法的优点是它可以应用于分类数据和连续数据。 实验在两个基准数据集中进行:动物园数据集,其中所有属性都是分类的,并且葡萄酒数据集,其中除了分类属性之外的所有属性都是连续的。 结果表明,平均每条规则的少量条件和每条规则集的一些规则,并表明规则具有良好的预测准确性和泛化能力的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号