Solving relative reduction problem using genetic algorithms

被引:0
|
作者
Tao, Z [1 ]
Xu, BD [1 ]
Zhao, CY [1 ]
机构
[1] Northeastern Univ, Sch Informat Sci & Engn, Shenyang 110004, Peoples R China
关键词
rough set theory; Genetic Algorithms; decision attribute support degree; relative reduction; fitness function;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Kind of knowledge relative reduction algorithm was proposed. With decision attribute supporting degree applied in knowledge expression system, the support degree of the knowledge, supplied by condition attribute for the whole decision making was described and then relative core was obtained. The relative core was introduced in initial population in GA which can accelerate convergence speed. Penalty function was used in fitness function to assure the reduction has fewer attributes and stronger supporting degree at the same time. The searching effect is very well. The practical simulation results show that the approach was effective in solving knowledge reduction problem.
引用
收藏
页码:650 / 654
页数:5
相关论文
共 50 条
  • [1] Solving Test Suite Reduction Problem Using Greedy and Genetic Algorithms
    Yamuc, Ali
    Cingiz, M. Ozgur
    Biricik, Goksel
    Kalipsiz, Oya
    [J]. PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTERS AND ARTIFICIAL INTELLIGENCE - ECAI 2017, 2017,
  • [2] Solving a timetabling problem using hybrid genetic algorithms
    Kragelund, LV
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1997, 27 (10): : 1121 - 1134
  • [3] Solving timetabling problem using genetic and heuristic algorithms
    Thanh, Nguyen Duc
    [J]. SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 472 - 477
  • [4] Solving the Mountain Car Problem Using Genetic Algorithms
    Badica, Amelia
    Badica, Costin
    Buligiu, Ion
    Ciora, Liviu Ion
    Ganzha, Maria
    Paprzycki, Marcin
    [J]. LARGE-SCALE SCIENTIFIC COMPUTATIONS, LSSC 2023, 2024, 13952 : 237 - 245
  • [5] Solving wood collection problem using genetic algorithms
    Karanta, I
    Mikkola, T
    Bounsaythip, C
    Jokinen, O
    Savola, J
    [J]. GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 1787 - 1787
  • [6] Using genetic algorithms for solving partitioning problem in codesign
    Koudil, M
    Benatchba, K
    Dours, D
    [J]. ARTIFICIAL NEURAL NETS PROBLEM SOLVING METHODS, PT II, 2003, 2687 : 393 - 400
  • [7] Solving timetable scheduling problem using genetic algorithms
    Sigl, B
    Golub, M
    Mornar, V
    [J]. ITI 2003: PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2003, : 519 - 524
  • [8] Solving graph partitioning problem using genetic algorithms
    Shazely, S
    Baraka, H
    Abdel-Wahab, A
    [J]. 1998 MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, PROCEEDINGS, 1999, : 302 - 305
  • [9] Solving the vehicle routing problem by using Cellular Genetic Algorithms
    Alba, E
    Dorronsoro, B
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3004 : 11 - 20
  • [10] Solving the Dynamic Vehicle Routing Problem using Genetic Algorithms
    Elhassania, Messaoud
    Jaouad, Boukachour
    Ahmed, Elhilali Alaoui
    [J]. PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014), 2014, : 62 - 69