Data Mining with Scatter Search
Author(s) -
I. J. García del Amo,
Miguel García-Torres,
Belén Melián-Batista,
José Andrés Moreno Pérez,
J. Marcos MorenoVega,
Raquel Rivero Martín
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-29002-8
DOI - 10.1007/11556985_25
Subject(s) - metaheuristic , computer science , hyper heuristic , machine learning , heuristic , parallel metaheuristic , artificial intelligence , cluster analysis , feature selection , feature (linguistics) , data mining , robot learning , linguistics , philosophy , meta optimization , robot , mobile robot
Most Data Mining tasks are performed by the application of Machine Learning techniques. Metaheuristic approaches are becoming very useful for designing efficient tools in Machine Learning. Metaheuristics are general strategies to design efficient heuristic procedures. Scatter Search is a recent metaheuristic that has been successfully applied to solve standard problems in three central paradigms of Machine Learning: Clustering, Classification and Feature Selection. We describe the main components of the Scatter Search metaheuristic and the characteristics of the specific designs to be applied to solve standard problems in these tasks.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom