পদ্ধতির তুলনা করুন

	র‍্যাঙ্ক একত্রীকরণ পদ্ধতি	প্লাকেট-লুস মডেল
ক্ষেত্র	সিদ্ধান্ত গ্রহণ	সিদ্ধান্ত গ্রহণ
পরিবার	Machine learning	Regression model
উদ্ভবের বছর	2001	1975
প্রবর্তক	Dwork, Kumar, Naor & Sivakumar	Robin Plackett; R. Duncan Luce
ধরন	Combinatorial ranking method	Probabilistic ranking model
মৌলিক উৎস	Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. Proceedings of the 10th International Conference on World Wide Web, 613–622.	Plackett, R. L. (1975). The analysis of permutations. Journal of the Royal Statistical Society: Series C, 24(2), 193–202.
অপর নাম	Rank Fusion, Order Aggregation, Preference Aggregation, Sıralama Birleştirme	Luce's Choice Axiom Model, Rank-Ordered Logit Model, Exploded Logit Model, Sıralama Tercih Modeli
সম্পর্কিত	2	3
সারসংক্ষেপ	Rank Aggregation is a family of methods that combine multiple ranked lists of alternatives into a single consensus ranking. Formally studied in the context of web search by Dwork, Kumar, Naor, and Sivakumar (2001), these methods address the problem of synthesizing divergent preference orderings from multiple sources — such as search engines, expert judges, or voter ballots — into one coherent, representative ordering that minimizes overall disagreement across the input rankings.	The Plackett-Luce model is a probabilistic framework for analysing and predicting rank-ordered data. Introduced by Robin Plackett (1975) — building on R. Duncan Luce's earlier axiom of choice (1959) — it models the probability of any complete ranking of items as a sequential selection process, where each item's chance of being chosen at each position is proportional to its latent worth parameter. It is widely used in preference learning, recommender systems, and choice modelling.