Pages that link to "Item:Q62323"

The following pages link to Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323):

Displaying 17 items.

• ConsRank (Q36946) (← links)
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
• Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726) (← links)
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
• Partial evaluation in rank aggregation problems (Q1652087) (← links)
• Weighted distance-based trees for ranking data (Q1999451) (← links)
• Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
• Comparing boosting and bagging for decision trees of rankings (Q2129304) (← links)
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings (Q2184062) (← links)
• A new approach for identifying the Kemeny median ranking (Q2333014) (← links)
• Median constrained bucket order rank aggregation (Q2418073) (← links)
• Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
• Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings (Q2673352) (← links)
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation (Q5868914) (← links)
• On weakly and strongly popular rankings (Q6094721) (← links)
• The Bradley-Terry regression trunk approach for modeling preference data with small trees (Q6198874) (← links)