RMHC-MR: Instance selection by random mutation hill climbing algorithm with MapReduce in big data
نویسندگان
چکیده
منابع مشابه
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the term “prototypes” refers to the reference instances used in a nearest neighbor computation — the instances with respect to which similarity is assessed in order to assign a class to a new data item. Both algorithms rely ...
متن کاملVoting-based instance selection from large data sets with MapReduce and random weight networks
Instance selection is an important preprocessing step in machine learning. By choosing a subset of a data set, it achieves the same performance of a machine learning algorithm as if the whole data set is used, and it enables a machine learning algorithm to be feasible for and to work effectively with large data sets. Based on voting mechanism, this paper proposes a large data sets instance sele...
متن کاملHill-climbing Nds Random Planted Bisections
We analyze the behavior of hill-climbing algorithms for the minimum bisection problem on instances drawn from the \planted bisection" ran-is one of the few problem distributions for which various popular heuris-tic methods, such as simulated annealing, have been proven to succeed. However, it has been open whether these sophisticated methods were necessary , or whether simpler heuristics would ...
متن کاملRapid Control Selection through Hill-Climbing Methods
Consider the problem of control selection in complex dynamical and environmental scenarios where model predictive control (MPC) proves particularly effective. As the performance of MPC is highly dependent on the efficiency of its incorporated search algorithm, this work examined hill climbing as an alternative to traditional systematic or random search algorithms. The relative performance of a ...
متن کاملParticle swarm optimization with combined mutation and hill climbing
Particle swarm optimization is an established, effective technique for global optimization, but one which is prone to delivering sub-optimal results when faced with multimodal functions, especially when the local optima are found in regions where the objective function varies rapidly. The failure of the swarm to venture into these regions is not just of theoretical interest; it has been observe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.06.061