Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem

9Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed by a team of agents (A-Team). Several A-Team architectures with agents executing the simulated annealing and tabu search procedures are proposed and investigated. The paper includes a detailed description of the proposed approach and discusses the results of a validating experiment.

Cite

CITATION STYLE

APA

Czarnowski, I., & Jȩdrzejowicz, P. (2011). Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem. International Journal of Applied Mathematics and Computer Science, 21(1), 57–68. https://doi.org/10.2478/v10006-011-0004-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free