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

DOI10.2478/v10006-011-0004-3zbMath1221.68191OpenAlexW2085846246MaRDI QIDQ3016271

Ireneusz Czarnowski, Piotr Jȩdrzejowicz

Publication date: 15 July 2011

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/208037

zbMATH Keywords

optimizationdata reductionmulti-agent systemmachine learningA-Team

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42)

Related Items (4)

Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices ⋮ Nonparametric statistical analysis for multiple comparison of machine learning regression algorithms ⋮ Multiple-instance learning with pairwise instance similarity ⋮ An algorithm for reducing the dimension and size of a sample for data exploration procedures

Uses Software

• UCI-ml
• Genocop
• Tabu search
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Prototype selection algorithms for distributed learning
• Wrappers for feature subset selection
• Reduction techniques for instance-based learning algorithms
• An approach to data reduction and integrated machine classification
• Tabu Search—Part II
• An algorithm for a selective nearest neighbor decision rule (Corresp.)
• Nearest prototype classifier designs: An experimental study

This page was built for publication: Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem