An agent-based simulated annealing algorithm for data reduction

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data reduction in the supervised machine learning aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction can result in increased capabilities and generalization properties of the learning model and shorter learning process time. It can also help in scaling up to a large data sources. This paper proposes an approach based on a combination of the simulated annealing technique and the multi-agent architecture designed for solving the data reduction problem. The paper includes the overview of the proposed approach and shows the computational experiment results. Experiment has shown that the proposed agent-based simulated annealing outperforms the traditional simulated annealing approach when solving the data reduction problem. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Czarnowski, I., & Jȩdrzejowicz, P. (2010). An agent-based simulated annealing algorithm for data reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6071 LNAI, pp. 130–139). https://doi.org/10.1007/978-3-642-13541-5_14

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