• DocumentCode
    2141115
  • Title

    High-dimensional objective-based data farming

  • Author

    Zeng, Fanchao ; Decraene, James ; Low, Malcolm Yoke Hean ; Wentong, Cai ; Hingston, Philip ; Zhou, Suiping

  • Author_Institution
    Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
  • fYear
    2011
  • fDate
    11-15 April 2011
  • Firstpage
    80
  • Lastpage
    87
  • Abstract
    In objective-based data farming, decision variables of the Red Team are evolved using evolutionary algorithms such that a series of rigorous Red Team strategies can be generated to assess the Blue Team´s operational tactics. Typically, less than 10 decision variables (out of 1000+) are selected by subject matter experts (SMEs) based on their past experience and intuition. While this approach can significantly improve the computing efficiency of the data farming process, it limits the chance of discovering “surprises” and moreover, data farming may be used only to verify SMEs´ assumptions. A straightforward solution is simply to evolve all Red Team parameters without any SME involvement. This modification significantly increases the search space and therefore we refer to it as high-dimensional objective-based data farming (HD-OBDF). The potential benefits of HD-OBDF include: possible better performance and information about more important decision variables. In this paper, several state-of-the-art multi-objective evolutionary algorithms are applied in HD-OBDF to assess their suitability in terms of convergence speed and Pareto efficiency. Following that, we propose two approaches to identify dominant/key evolvable parameters in HD-OBDF - decision variable coverage and diversity spread.
  • Keywords
    Pareto distribution; data handling; decision theory; evolutionary computation; search problems; Blue Team operational tactics; Pareto efficiency; Red Team strategy; convergence speed; decision variable coverage; evolutionary algorithm; multiobjective evolutionary algorithm; objective based data farming; Computational modeling; Data models; Educational institutions; IEEE Potentials; Indexes; Search problems; Subspace constraints;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence for Security and Defense Applications (CISDA), 2011 IEEE Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4244-9939-7
  • Type

    conf

  • DOI
    10.1109/CISDA.2011.5945942
  • Filename
    5945942