Journal Article10.1016/J.ASOC.2015.09.050
Using metaheuristic algorithms for parameter estimation in generalized Mallows models
Juan A. Aledo,José A. Gámez,David Molina +2 more
- 01 Jan 2016
- Vol. 38, pp 308-320
14
TL;DR: A comparative study of several MH algorithms and a tailored algorithm A* to address parameter estimation in GMMs by using both local and global search metaheuristic (MH) algorithms is carried out.
read more
Abstract: HighlightsWe deal with the problem of parameter estimation in Generalized Mallows model (GMM).We deal with 22 real datasets, all of them but one created by the authors.We have designed two experiments varying the maximum evaluations allowed.Obtained results significantly improve the previous competing approaches. This paper deals with the problem of parameter estimation in the generalized Mallows model (GMM) by using both local and global search metaheuristic (MH) algorithms. The task we undertake is to learn parameters for defining the GMM from a dataset of complete rankings/permutations. Several approaches can be found in the literature, some of which are based on greedy search and branch and bound search. The greedy approach has the disadvantage of usually becoming trapped in local optima, while the branch and bound approach, basically A* search, usually comes down to approximate search because of memory requirements, losing in this way its guaranteed optimality. Here, we carry out a comparative study of several MH algorithms (iterated local search (ILS) methods, variable neighborhood search (VNS) methods, genetic algorithms (GAs) and estimation of distribution algorithms (EDAs)) and a tailored algorithm A* to address parameter estimation in GMMs. We use 22 real datasets of different complexity, all but one of which were created by the authors by preprocessing real raw data. We provide a complete analysis of the experiments in terms of accuracy, number of iterations and CPU time requirements.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Bio-inspired computational heuristics for parameter estimation of nonlinear Hammerstein controlled autoregressive system
Muhammad Asif Zahoor Raja,Abbas Ali Shah,Ammara Mehmood,Naveed Ishtiaq Chaudhary,Muhammad Saeed Aslam +4 more
TL;DR: In this study, strength of evolutionary computational intelligence based on genetic algorithms (GAs) is exploited for parameter identification of nonlinear Hammerstein controlled autoregressive (NHCAR) systems.
80
Autonomous task allocation for multi-UAV systems based on the locust elastic behavior
Heba Kurdi,Heba Kurdi,Ebtesam Aloboud,Maram Alalwan,Sarah Alhassan,Sarah Alhassan,Ebtehal Turki Saho Alotaibi,Guillermo Bautista,Jonathan P. How +8 more
TL;DR: Experimental results demonstrated that the new approach substantially improves the net throughput and the mean task completion time while maintaining a linear running time when compared to all benchmarks under different scales of fleet size and number of tasks, demonstrating better scalability and sustainability.
61
An improved Simulated Annealing algorithm based on ancient metallurgy techniques
Bernardo Morales-Castañeda,Daniel Zaldivar,Erik Cuevas,Oscar Maciel-Castillo,Itzel Aranguren,Fernando Fausto +5 more
TL;DR: The proposed algorithm modifies the original SA incorporating two new operators, folding and reheating, inspired by the ancient Japanese Swordsmithing technique, and demonstrates the high performance of the proposed method when compared to the originalSA and other popular state-of-the-art algorithms.
54
Approaching rank aggregation problems by using evolution strategies: The case of the optimal bucket order problem
TL;DR: The study shows that the best evolution strategy improves upon the accuracy obtained by the standard greedy method (BPA) by 35%, and that of LIA G M P 2 by 12.5%.
34
Partial evaluation in Rank Aggregation Problems
TL;DR: A theoretical and experimental study of the application of partial evaluation in the Rank Aggregation Problem (RAP) shows that the complexity of evaluating the original objective function can be reduced from quadratic to linear by using partial evaluation after applying insertion and interchange.
13
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
A Simple Sequentially Rejective Multiple Test Procedure
TL;DR: In this paper, a simple and widely accepted multiple test procedure of the sequentially rejective type is presented, i.e. hypotheses are rejected one at a time until no further rejections can be done.
•Book
Genetic Algorithms + Data Structures = Evolution Programs
Zbigniew Michalewicz
- 01 Jan 1992
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
13.5K
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
12.7K