Reference : Computing linear rankings from trillions of pairwise outranking situations
Scientific congresses, symposiums and conference proceedings : Unpublished conference
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/28613
Computing linear rankings from trillions of pairwise outranking situations
English
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Nov-2016
6
Yes
International
DA2PL'2016 From Multiple Criteria Decision Aid to Preference Learning
from 07-11-2016 to 08-11-2016
University of Paderborn
Paderborn
Germany
[en] Multiple criteria decision aid ; Linear Rankings ; Big data
[en] We present in this paper a sparse HPC implementation for outranking digraphs of huge orders, up to several millions of decision alternatives. The proposed outranking digraph model is based on a quantiles equivalence class decomposition of the underlying multicriteria performance tableau. When locally ranking each of these ordered components, we may readily obtain an overall linear ranking of big sets of decision alternatives. For the local rankings, both, Copeland's as well as the Net-Flows ranking rules, appear to give the best compromise between, on the one side, the fitness of the overall ranking with respect to the given global outranking relation and, on the other side, computational tractability for very big outranking digraphs modelling up to several trillions of pairwise outranking situations.
University of Luxembourg: High Performance computing - ULHPC
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/28613
FnR ; FNR10367986 > Raymond Bisdorff > ALGODEC 2 > Algorithmic Decision Theory > 01/04/2015 > 31/03/2019 > 2015

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
DA2PL-RB-2016.pdfAuthor preprint440.81 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.