Rule Induction with Iterated Local Search

Abstract

The wide amount of data in the modern applications available on the Internet make it very complicated to deal with the knowledge behind these data. The data classification task is a useful tool that used to deal with a huge amount of data by classify these data into coherent groups. The data size decreases the performace of the classification technique, especially when contain uninformative data (i.e., irrelevant, noisy). The stochastic local search algorithm is an optimization approaches employed to find the informative data to build the classification model. These methods are used to search for the optimal patterns to construct the classification algorithm. Thus, this research introduces a stochastic local search algorithm for rule induction called Iterated-Miner (Iterated local search-based rule induction). The purpose of the algorithm is to construct classification rules from data. This classification algorithm is inspired by the concepts and principles of stochastic local search and rule induction. The performance of the proposed classifier evaluated with a well-known and state of art classification algorithms called, Ant-Miner, ACO/PSO2, PART FURIA, and ACO/GA on 10 UCI datasets. The results demonstrate that our classifier is superior compare with all classifiers respect to classification accuracy; and the model sizes by our classifier are considerably competitive with those discovered by other classifier.

Indecision trees: learning argument-based reasoning under quantified uncertainty

“…More recently, there have been rule-based systems which employ stochastic local search optimization techniques like simulated annealing, iterated local search, and ant colony optimization to learn rules. 8,9 The systems we described are impressive in their own right, but one area that deserves more attention in rulebased classification systems is handling quantified measurement noise in the data. More mainstream machine learning systems (i.e.…”

An improved artificial bee colony with perturbation operators in scout bees’ phase for solving vehicle routing problem with time windows

“…The theory of evolution is used by evolutionary algorithms to generate new species [19], [20]. Swarm intelligence algorithms rely on metaheuristics that mimic the collective behavior of problem-solving processes in self-organized systems [21], [22]. The collective intelligence emerges from the interactions of agents in social colonies with their surroundings [23], [24].…”

Indecision Trees: Learning Argument-Based Reasoning under Quantified Uncertainty

“…Several algorithms for this exist for building these trees, like CART [1], and ID3 [9], but C4.5 [10] is most commonly used. More recently, there have been rule-based systems which employ stochastic local search optimization techniques like simulated annealing, iterated local search, and ant colony optimization to learn rules [7,8].…”