Data mining methods for knowledge discovery in multi-objective optimization: Part B - New developments and applications

被引:41
作者
Bandaru, Sunith [1 ]
Ng, Amos H. C. [1 ]
Deb, Kalyanmoy [2 ]
机构
[1] Univ Skovde, Sch Engn Sci, S-54128 Skovde, Sweden
[2] Michigan State Univ, Dept Elect & Comp Engn, 428 S Shaw Lane, E Lansing, MI 48824 USA
关键词
Data mining; Knowledge discovery; Multi-objective optimization; Discrete variables; Production systems; Flexible pattern mining; DECISION-SUPPORT;
D O I
10.1016/j.eswa.2016.10.016
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The first part of this paper served as a comprehensive survey of data mining methods that have been used to extract knowledge from solutions generated during multi-objective optimization. The current paper addresses three major shortcomings of existing methods, namely, lack of interactiveness in the objective space, inability to handle discrete variables and inability to generate explicit knowledge. Four data mining methods are developed that can discover knowledge in the decision space and visualize it in the objective space. These methods are (i) sequential pattern mining, (ii) clustering-based classification trees, (iii) hybrid learning, and (iv) flexible pattern mining. Each method uses a unique learning strategy to generate explicit knowledge in the form of patterns, decision rules and unsupervised rules. The methods are also capable of taking the decision maker's preferences into account to generate knowledge unique to preferred regions of the objective space. Three realistic production systems involving different types of discrete variables are chosen as application studies. A multi-objective optimization problem is formulated for each system and solved using NSGA-II to generate the optimization datasets. Next, all four methods are applied to each dataset. In each application, the methods discover similar knowledge for specified regions of the objective space. Overall, the unsupervised rules generated by flexible pattern mining are found to be the most consistent, whereas the supervised rules from classification trees are the most sensitive to user-preferences. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:119 / 138
页数:20
相关论文
共 32 条
  • [1] AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
  • [2] [Anonymous], 1994, P INT C VERY LARGE D
  • [3] [Anonymous], SWED PROD S GOT 28 3
  • [4] [Anonymous], P 5 SWED PROD S SPS
  • [5] [Anonymous], P IND SIM C ISC 2011
  • [6] [Anonymous], 2001, SPRINGE SER STAT N
  • [7] Bernedixen Jacob, 2014, 12th International Industrial Simulation Conference 2014 (ISC 2014), P97
  • [8] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [9] Deb K., 1995, Complex Systems, V9, P115
  • [10] Deb K., 2001, MULTIOBJECTIVE OPTIM, V16