antColony {FSinR} | R Documentation |
Ant Colony Optimization (Advanced Binary Ant Colony Optimization)
Description
Generates a search function based on the ant colony optimization. This function is called internally within the searchAlgorithm
function. The Ant Colony Optimization (Advanced Binary Ant Colony Optimization) (Kashef and Nezamabadi-pour 2015) algorithm consists of generating in each iteration a random population of individuals (ants) according to the values of a pheromone matrix (which is updated each iteration according to the paths most followed by the ants) and a heuristic (which determines how good is each path to follow by the ants). The evaluation measure is calculated for each individual. The algorithm ends once the established number of iterations has been reached
Usage
antColony(
population = 10,
iter = 10,
a = 1,
b = 1,
p = 0.2,
q = 1,
t0 = 0.2,
tmin = 0,
tmax = 1,
mode = 1,
verbose = FALSE
)
Arguments
population |
The number of ants population |
iter |
The number of iterations |
a |
Parameter to control the influence of the pheromone (If a=0, no pheromone information is used) |
b |
Parameter to control the influence of the heuristic (If b=0, the attractiveness of the movements is not taken into account) |
p |
Rate of pheromone evaporation |
q |
Constant to determine the amount of pheromone deposited by the best ant. This amount is determined by the Q/F equation (for minimization) where F is the cost of the solution (F/Q for maximization) |
t0 |
Initial pheromone level |
tmin |
Minimum pheromone value |
tmax |
Maximum pheromone value |
mode |
Heuristic information measurement. 1 -> min redundancy (by default). 2-> max-relevance and min-redundancy. 3-> feature-feature. 4-> based on F-score |
verbose |
Print the partial results in each iteration |
Value
Returns a search function that is used to guide the feature selection process.
Author(s)
Francisco Aragón Royón
References
Kashef S, Nezamabadi-pour H (2015). “An advanced ACO algorithm for feature subset selection.” Neurocomputing, 147, 271–279. doi: 10.1016/j.neucom.2014.06.067, Advances in Self-Organizing Maps Subtitle of the special issue: Selected Papers from the Workshop on Self-Organizing Maps 2012 (WSOM 2012), https://www.sciencedirect.com/science/article/abs/pii/S0925231214008601.
Examples
## Not run:
## The direct application of this function is an advanced use that consists of using this
# function directly and performing a search process in a feature space
## Classification problem
# Generates the filter evaluation function with ACO
filter_evaluator <- filterEvaluator('determinationCoefficient')
# Generates the search function
aco_search <- antColony()
# Performs the search process directly (parameters: dataset, target variable and evaluator)
aco_search(iris, 'Species', filter_evaluator)
## End(Not run)