parfront¶
- class corankco.partitioning.parfront.ParFront¶
ParFront is an algorithm published in P. Andrieu, B. Brancotte, L. Bulteau, S. Cohen-Boulakia, A. Denise, A. Pierrot , S. Vialette, Efficient, robust and effective rank aggregation for massive biological datasets, Future Generation Computer Systems, 2021, pp 406–421. The objective of this algorithm is the following one: it computes an ordered partition of the elements to rank that is a list of sets L = [s1, s2, s3, …, sk] such that for all i < j, for all x in s[i] and y in s[j], x is before y in all the optimal consensus rankings within a Kemeny prism. It is true for any ScoringScheme (see ScoringScheme class).
- static compute_partition(dataset: Dataset, scoring_scheme: ScoringScheme) OrderedPartition ¶
- Parameters:
dataset (Dataset (class Dataset in package 'datasets')) – A dataset containing the rankings to aggregate
scoring_scheme (ScoringScheme (class ScoringScheme in package 'distances')) – The penalty vectors to consider
:return a list of sets of elements such that any exact consensus respects this partitioning