Variable-Length Differential Evolution for Numerical and Discrete Association Rule Mining

Abstract

This paper proposes a variable-length Differential Evolution for Association Rule Mining. The proposed algorithm includes a novel representation of individuals, which can encode both numerical and discrete attributes in their original or absolute complement of the original intervals. The fitness function used is comprised of a weighted sum of Support and Confidence Association Rule Mining metrics. The proposed algorithm was tested on fourteen publicly available, and commonly used datasets from the UC Irvine Machine Learning Repository. It is also compared to the nature inspired algorithms taken from the NiaARM framework, providing superior results. The implementation of the proposed algorithm follows the principles of Green Artificial Intelligence, where a smaller computational load is required for obtaining promising results, and thus lowering the carbon footprint.

Keywords

• Association rule mining
• differential evolution
• data mining
• variable-length solution representation
• green AI