A new multiple seeds based genetic algorithm for discovering a set of interesting Boolean association rules

详细信息    查看全文

• 作者：Mir Md. Jahangir Kabir ; ^{mmjkabir@utas.edu.au} ; Shuxiang Xu ^{Shuxiang.Xu@utas.edu.au} ; Byeong Ho Kang ^{Byeong.Kang@utas.edu.au} ; Zongyuan Zhao ^{Zongyuan.Zhao@utas.edu.au}
• 关键词：Multiple seeds based genetic algorithm ; Initial population ; Boolean association rules ; Conditional probability ; Search efficiency
• 刊名：Expert Systems with Applications
• 出版年：2017
• 出版时间：15 May 2017
• 年：2017
• 卷：74
• 期：Complete
• 页码：55-69
• 全文大小：3833 K
• 卷排序：74

文摘

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.