Thus, an efficient genetic algorithm is proposed to find the optimal consensus string. To show an application for the studied problem, this work also exhibits a ...
It investigates consensus string under rank distance. 2. It presents an efficient genetic algorithm for consensus string. 3. It gives a hierarchical clustering ...
The aim of this paper is to investigate the consensus string in the rank distance paradigm. Theoretical results show that it is not possible to identify a ...
People also ask
What is an efficient algorithm for mining frequent sequences?
What is considered an efficient algorithm?
Jan 24, 2024 · FAST algorithm to find consensus (median) ranking defined by Amodio, D'Ambrosio and Siciliano (2016). It returns at least one of the solutions.
In this paper, a novel consensus quantifying approach, without the use of correlation or distance functions as in existing studies of consensus, is proposed.
We finally show that our algorithm can find the consensus faster than other heuristic approaches and can deal with the problem with large number of objects.
In many scenarios, the object items for which a consensus needs to be determined are rankings, and the process is called rank aggregation. Common applications ...
We propose a procedure for the calibration of the number of clusters (and regularization parameter) by maximizing the sharp score.
4 days ago · It combines Kemeny's axiomatic approach to define a unique distance between rankings with the CART approach to find a stable prediction tree.
Jul 26, 2019 · The Kendall's τ measures the correlation of two rankings by considering their concordant and discordant pairs, and the Spearman's ρ evaluates ...