An Architecture based on interactive optimization and machine learning applied to the next release problem

被引:32
作者
Araujo, Allysson Allex [1 ]
Paixao, Matheus [2 ]
Yeltsin, Italo [1 ]
Dantas, Altino [1 ]
Souza, Jerffeson [1 ]
机构
[1] Univ Estadual Ceara, Optimizat Software Engn Grp, 1700 Dr Silas Munguba Ave, BR-60714903 Fortaleza, Ceara, Brazil
[2] UCL, CREST Ctr, Malet Pl, London WC1E 6BT, England
关键词
Next release problem; Interactive optimization; Machine learning; Search based software engineering; EVOLUTIONARY COMPUTATION; SEARCH; PRIORITIZATION; SELECTION; FATIGUE; SYSTEMS;
D O I
10.1007/s10515-016-0200-3
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The next release problem (NRP) consists of selecting which requirements will be implemented in the next release of a software system. For many search based software engineering approaches to the NRP, there is still a lack of capability to efficiently incorporate human experience and preferences in the search process. Therefore, this paper proposes an architecture to deal with this issue, where the decision maker (DM) and his/her tacit assessments are taken into account during the solutions evaluations alongside the interactive genetic algorithm. Furthermore, a learning model is employed to avoid an overwhelming number of interactions. An empirical study involving software engineer practitioners, different instances, and different machine learning techniques was performed to assess the feasibility of the architecture to incorporate human knowledge in the overall optimization process. Obtained results indicate the architecture can assist the DM in selecting a set of requirements that properly incorporate his/her expertise, while optimizing other explicit measurable aspects equally important to the next release planning. On a scale of 0 (very ineffective) to 5 (very effective), all participants found the experience of interactively selecting the requirements using the approach as a 4 (effective).
引用
收藏
页码:623 / 671
页数:49
相关论文
共 61 条
  • [1] [Anonymous], 2005, DATA MINING
  • [2] [Anonymous], P 3 BRAZ WORKSH SEAR
  • [3] [Anonymous], 2015, P GECCO COMP
  • [4] [Anonymous], 2012, J THEORETICAL APPL C
  • [5] [Anonymous], 1999, INT SERIES OPERATION
  • [6] [Anonymous], THESIS
  • [7] Araújo AA, 2014, LECT NOTES COMPUT SC, V8636, P228
  • [8] A Hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering
    Arcuri, Andrea
    Briand, Lionel
    [J]. SOFTWARE TESTING VERIFICATION & RELIABILITY, 2014, 24 (03) : 219 - 250
  • [9] Arcuri A, 2011, LECT NOTES COMPUT SC, V6956, P33, DOI 10.1007/978-3-642-23716-4_6
  • [10] A Practical Guide for Using Statistical Tests to Assess Randomized Algorithms in Software Engineering
    Arcuri, Andrea
    Briand, Lionel
    [J]. 2011 33RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE), 2011, : 1 - 10