A new multiple seeds based genetic algorithm for discovering a set of interesting Boolean association rules
作者：
Highlights：
• A new multiple seeds based genetic algorithm is proposed.
• This method relies on generating multiple seeds from different domains.
• This scheme introduces m-domain model and m-seeds selection process.
• Multiple seeds are used to generate an effective initial population.
• The experiments were conducted to show the effeciency of the proposed method.
摘要
•A new multiple seeds based genetic algorithm is proposed.•This method relies on generating multiple seeds from different domains.•This scheme introduces m-domain model and m-seeds selection process.•Multiple seeds are used to generate an effective initial population.•The experiments were conducted to show the effeciency of the proposed method.
论文关键词：Multiple seeds based genetic algorithm,Initial population,Boolean association rules,Conditional probability,Search efficiency
论文评审过程：Received 8 January 2016, Revised 31 December 2016, Accepted 1 January 2017, Available online 4 January 2017, Version of Record 13 January 2017.
论文官网地址：https://doi.org/10.1016/j.eswa.2017.01.001
