— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates the target search resu...
Avi Arampatzis, Pavlos Efraimidis, George Drosatos