首页> 外文会议>IEA-AIE 2009 >Comprehensible Knowledge Discovery Using Particle Swarm Optimization with Monotonicity Constraints
【24h】

Comprehensible Knowledge Discovery Using Particle Swarm Optimization with Monotonicity Constraints

机译:使用单调性约束,使用粒子群优化的可理解知识发现

获取原文

摘要

Due to uncertain data quality, knowledge extracted by methods merely focusing on gaining high accuracy might result in contradiction to experts' knowledge or sometimes even common sense. In many application areas of data mining, taking into account the monotonic relations between the response variable and predictor variables could help extracting rules with better comprehensibility. This study incorporates Particle Swarm Optimization (PSO), which is a competitive heuristic technique for solving optimization tasks, with constraints of monotonicity for discovering accurate and comprehensible rules from databases. The results show that the proposed constraints-based PSO classifier can exploit rules with both comprehensibility and justifiability.
机译:由于数据质量不确定,通过方法提取的知识仅关注获得高精度可能导致专家知识或有时甚至常识的矛盾。在数据挖掘的许多应用领域,考虑到响应变量和预测变量之间的单调关系可以帮助提取具有更好可理解性的规则。本研究包括粒子群优化(PSO),这是一种竞争激发的启发式技术,用于解决优化任务,具有从数据库中发现准确和可辨别的规则的单调性的限制。结果表明,所提出的基于约束的PSO分类器可以利用可理解性和合理性的规则。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号