An Iterative Transient Rank Aggregation Technique for Mitigation of Rank Reversal

2018 ◽  
Vol 9 (1) ◽  
pp. 40-50
Author(s):  
Bikash Bepari ◽  
Shubham Kumar ◽  
Awanish Tiwari ◽  
Divyam ◽  
Sharjil Ahmar

With the advent of decision science, significant elucidation has been sought in the literature of multi criteria decision making. Often, it is observed that for the same MCDM problem, different methods fetch way-apart ranks and the phenomenon leads to rank reversal. To alleviate this problem, different methodologies like the Borda rule, the Copeland method, the Condorcet method, the statistical Thurstone scaling, and linear programming methods are readily available in the literature. In connection with the same, the authors proposed a novel technique to aggregate the ranks laid by different methods. The algorithm initially assigns equal weights to the methods involved to avoid biasness to a particular method and a simple average rank was obtained. Then, after the separation measures of individual methods with respect to average rank were calculated. Considering the separation measure the higher the weightage, the dynamic weights are ascertained to declare the weighted aggregate rank subjected to the terminal condition which include whether the previous rank equals to the current rank or not. To substantiate the proposed algorithm, a materials selection problem was taken into consideration and solved with the proposed technique. Moreover, the same problem was solved by existing voting techniques like the Borda and the Copeland-Condoract methods. The authors found a correlation of more than 85% between the proposed and existing methodologies.

2018 ◽  
Vol 29 (1) ◽  
pp. 653-663 ◽  
Author(s):  
Ritu Meena ◽  
Kamal K. Bharadwaj

Abstract Many recommender systems frequently make suggestions for group consumable items to the individual users. There has been much work done in group recommender systems (GRSs) with full ranking, but partial ranking (PR) where items are partially ranked still remains a challenge. The ultimate objective of this work is to propose rank aggregation technique for effectively handling the PR problem. Additionally, in real applications, most of the studies have focused on PR without ties (PRWOT). However, the rankings may have ties where some items are placed in the same position, but where some items are partially ranked to be aggregated may not be permutations. In this work, in order to handle problem of PR in GRS for PRWOT and PR with ties (PRWT), we propose a novel approach to GRS based on genetic algorithm (GA) where for PRWOT Spearman foot rule distance and for PRWT Kendall tau distance with bucket order are used as fitness functions. Experimental results are presented that clearly demonstrate that our proposed GRS based on GA for PRWOT (GRS-GA-PRWOT) and PRWT (GRS-GA-PRWT) outperforms well-known baseline GRS techniques.


Author(s):  
Rashid Ali ◽  
M. M. Sufyan Beg

Rank aggregation is the process of generating a single aggregated ranking for a given set of rankings. In industrial environment, there are many applications where rank aggregation must be applied. Rough set based rank aggregation is a user feedback based technique which mines ranking rules for rank aggregation using rough set theory. In this chapter, the authors discuss rough set based rank aggregation technique in light of Web search evaluation. Since there are many search engines available, which can be used by used by industrial houses to advertise their products, Web search evaluation is essential to decide which search engines to rely on. Here, the authors discuss the limitations of rough set based rank aggregation and present an improved version of the same, which is more suitable for aggregation of different techniques for Web search evaluation. In the improved version, the authors incorporate the confidence of the rules in predicting a class for a given set of data. They validate the mined ranking rules by comparing the predicted user feedback based ranking with the actual user feedback based ranking. They show their experimental results pertaining to the evaluation of seven public search engines using improved version of rough set based aggregation for a set of 37 queries.


2018 ◽  
Vol 5 (4) ◽  
pp. 74-87
Author(s):  
Mohd Zeeshan Ansari ◽  
M.M. Sufyan Beg

Rank aggregation is applied on the web to build various applications like meta-search engines, consumer reviews classification, and recommender systems. Meta-searching is the generation of a single list from a collection of the results produced by multiple search engines, together using a rank aggregation technique. It is an efficient and cost-effective technique to retrieve quality results from the internet. The quality of results produced by a meta-searching relies upon the efficiency of rank aggregation technique applied. An effective rank aggregation technique assigns the rank to a document that is closest to all its previous rankings. The newly generated list of documents may be evaluated by the measurement of Spearman footrule distance. In this article, various fuzzy logic techniques for rank aggregation are analyzed and further improvements are proposed in Modified Shimura technique. Consequently, two novel OWA operators are suggested for the calculation of membership values of document ranks in a modified Shimura technique. The performance of proposed improvements is evaluated on the Spearman footrule distance along with execution time. The results show that the anticipated improvements exhibit better performance than other fuzzy techniques.


2002 ◽  
Vol 7 (2) ◽  
pp. 213-228 ◽  
Author(s):  
Pierre Favardin ◽  
Dominique Lepelley ◽  
Jérôme Serais

Cancers ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 917
Author(s):  
Jun A ◽  
Baotong Zhang ◽  
Zhiqian Zhang ◽  
Hailiang Hu ◽  
Jin-Tang Dong

Molecular signatures predictive of recurrence-free survival (RFS) and castration resistance are critical for treatment decision-making in prostate cancer (PCa), but the robustness of current signatures is limited. Here, we applied the Robust Rank Aggregation (RRA) method to PCa transcriptome profiles and identified 287 genes differentially expressed between localized castration-resistant PCa (CRPC) and hormone-sensitive PCa (HSPC). Least absolute shrinkage and selection operator (LASSO) and stepwise Cox regression analyses of the 287 genes developed a 6-gene signature predictive of RFS in PCa. This signature included NPEPL1, VWF, LMO7, ALDH2, NUAK1, and TPT1, and was named CRPC-derived prognosis signature (CRPCPS). Interestingly, three of these 6 genes constituted another signature capable of distinguishing CRPC from HSPC. The CRPCPS predicted RFS in 5/9 cohorts in the multivariate analysis and remained valid in patients stratified by tumor stage, Gleason score, and lymph node status. The signature also predicted overall survival and metastasis-free survival. The signature’s robustness was demonstrated by the C-index (0.55–0.74) and the calibration plot in all nine cohorts and the 3-, 5-, and 8-year area under the receiver operating characteristic curve (0.67–0.77) in three cohorts. The nomogram analyses demonstrated CRPCPS’ clinical applicability. The CRPCPS thus appears useful for RFS prediction in PCa.


2021 ◽  
Author(s):  
Christian Basteck

AbstractWe characterize voting procedures according to the social choice correspondence they implement when voters cast ballots strategically, applying iteratively undominated strategies. In elections with three candidates, the Borda Rule is the unique positional scoring rule that satisfies unanimity (U) (i.e., elects a candidate whenever it is unanimously preferred) and is majoritarian after eliminating a worst candidate (MEW)(i.e., if there is a unanimously disliked candidate, the majority-preferred among the other two is elected). In a larger class of rules, Approval Voting is characterized by a single axiom that implies both U and MEW but is weaker than Condorcet-consistency (CON)—it is the only direct mechanism scoring rule that is majoritarian after eliminating a Pareto-dominated candidate (MEPD)(i.e., if there is a Pareto-dominated candidate, the majority-preferred among the other two is elected); among all finite scoring rules that satisfy MEPD, Approval Voting is the most decisive. However, it fails a desirable monotonicity property: a candidate that is elected for some preference profile, may lose the election once she gains further in popularity. In contrast, the Borda Rule is the unique direct mechanism scoring rule that satisfies U, MEW and monotonicity (MON). There exists no direct mechanism scoring rule that satisfies both MEPD and MON and no finite scoring rule satisfying CON.


Sign in / Sign up

Export Citation Format

Share Document