parconsPartition¶
- class corankco.partitioning.parconsPartition.ParConsPartition¶
ParConsPartition is a preprocessing algorithm published in https://www.researchgate.net/publication/352277711_Efficient_robust_and_effective_rank_aggregation_for_massive_biological_datasets 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 there exists an optimal consensus ranking, in the sens of Kemeny, which is consistent with this partitioning.
- 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) – The ScoringScheme to consider (see ScoringScheme class)
:return a list of sets of elements such that there exists an exact consensus ranking which is consistent with the obtained partitioning
- static size_of_biggest_subproblem(dataset: Dataset, scoring_scheme: ScoringScheme) int ¶
Return the size of the biggest strongly connected component of the graph of elements defined in the article presented in the DocString class :param dataset: the dataset (list of rankings) to consider :param scoring_scheme: the scoring scheme to consider :return: