Adaptive Rule-Based Malware Detection Employing Learning Classifier Systems: A Proof of Concept

If complexity is your problem, learning classifier systems (LCSs) may offer a solution. These rule-based, multifaceted, machine learning algorithms originated and have evolved in the cradle of evolutionary biology and artificial intelligence. The LCS concept has inspired a multitude of implementations adapted to manage the different problem domains to which it has been applied (e.g., autonomous robotics, classification, knowledge discovery, and modeling). One field that is taking increasing notice of LCS is epidemiology, where there is a growing demand for powerful tools to facilitate etiological discovery. Unfortunately, implementation optimization is nontrivial, and a cohesive encapsulation of implementation alternatives seems to be lacking. This paper aims to provide an accessible foundation for researchers of different backgrounds interested in selecting or developing their own LCS. Included is a simple yet thorough introduction, a historical review, and a roadmap of algorithmic components, emphasizing differences in alternative LCS implementations.

Download Full-text

An Implementation of Learning Classifier Systems for Rule-Based Machine Learning

Lecture Notes in Computer Science - Knowledge-Based Intelligent Information and Engineering Systems ◽

10.1007/11552451_7 ◽

2005 ◽

pp. 45-54

Author(s):

An-Pin Chen ◽

Mu-Yen Chen

Keyword(s):

Machine Learning ◽

Learning Classifier Systems ◽

Classifier Systems ◽

Rule Based ◽

Learning Classifier

Download Full-text

A Comparison of Learning Classifier Systems’ Rule Compaction Algorithms for Knowledge Visualization

ACM Transactions on Evolutionary Learning and Optimization ◽

10.1145/3468166 ◽

2021 ◽

Vol 1 (3) ◽

pp. 1-38

Author(s):

Yi Liu ◽

Will N. Browne ◽

Bing Xue

Keyword(s):

Large Scale ◽

Optimal Solution ◽

Population Level ◽

Learning Classifier Systems ◽

Classifier Systems ◽

Rule Based ◽

Stochastic Nature ◽

Learning Classifier ◽

Large Scale Problems ◽

First Time

Learning Classifier Systems (LCSs) are a paradigm of rule-based evolutionary computation (EC). LCSs excel in data-mining tasks regarding helping humans to understand the explored problem, often through visualizing the discovered patterns linking features to classes. Due to the stochastic nature of EC, LCSs unavoidably produce and keep redundant rules, which obscure the patterns. Thus, rule compaction methods are invoked to produce a better population by removing problematic rules. Previously, compaction methods have neither been tested on large-scale problems nor been assessed on the performance of capturing patterns. We review and test the most popular compaction algorithms, finding that across multiple LCSs’ populations for the same task, although the redundant rules can be different, the accurate rules are common. Furthermore, the patterns contained consistently refer to the nature of the explored domain, e.g., the data distribution or the importance of features for determining actions. This extends the [ O ] set hypothesis proposed by Butz et al. [1], in which an LCS is expected to evolve a minimal number of non-overlapped rules to represent an addressed domain. Two new compaction algorithms are introduced to search at the rule level and the population level by compacting multiple LCSs’ populations. Two visualization methods are employed for verifying the interpretability of these populations. Successful compaction is demonstrated on complex and real problems with clean datasets, e.g., the 11-bits Majority-On problem that requires 924 different interacting rules in the optimal solution to be uniquely identified to enable correct visualization. For the first time, the patterns contained in learned models for the large-scale 70-bits Multiplexer problem are visualized successfully.

Download Full-text