کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892546 | 1445450 | 2018 | 34 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Efficient algorithms using subiterative convergence for Kemeny ranking problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Efficient algorithms using subiterative convergence for Kemeny ranking problem Efficient algorithms using subiterative convergence for Kemeny ranking problem](/preview/png/6892546.png)
چکیده انگلیسی
Rank aggregation problem is useful to practitioners in political science, computer science, social science, medical science, and allied fields. The objective is to identify a consensus ranking of n objects that best fits independent rankings given by k different judges. Under the Kemeny framework, a distance metric called Kemeny distance is minimized to obtain consensus ranking. For large n, with present computing powers, it is not feasible to identify a consensus ranking under the Kemeny framework. To address the problem, researchers have proposed several algorithms. These algorithms are able to handle datasets with n up to 200 in a reasonable amount of time. However, run-time increases very quickly as n increases. In the present paper, we propose two basic algorithms- Subiterative Convergence and Greedy Algorithm. Using these basic algorithms, two advanced algorithms- FUR and SIgFUR have been developed. We show that our results are generally superior to existing algorithms in terms of both performance (Kemeny distance) and run-time. Even for large number of objects, the proposed algorithms run in few minutes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 98, October 2018, Pages 198-210
Journal: Computers & Operations Research - Volume 98, October 2018, Pages 198-210
نویسندگان
Prakash S Badal, Ashish Das,