object

schulze_ranker

Schulze pairwise preference ranker. Learns one deterministic score per item from a dataset object implementing the pairwise_ranking_dataset_protocol protocol by computing strongest paths over aggregated head-to-head outcomes and returns a self-describing ranker term with diagnostics that can be used for ranking and export.

Availability:
logtalk_load(schulze_ranker(loader))
Author: Paulo Moura
Version: 1:0:0
Date: 2026-05-07
Compilation flags:
static, context_switching_calls
Remarks:
(none)
Inherited public predicates:
 check_option/1  check_options/1  check_ranker/1  default_option/1  default_options/1  diagnostic/2  diagnostics/2  export_to_clauses/4  export_to_file/4  grouped_dataset_groups/2  grouped_dataset_items/2  grouped_dataset_items/3  grouped_dataset_summary/2  learn/2  learn/3  option/2  option/3  pairwise_dataset_connected_components/2  pairwise_dataset_declared_items/2  pairwise_dataset_items/2  pairwise_dataset_matchups/2  pairwise_dataset_preferences/2  pairwise_dataset_summary/2  pairwise_dataset_win_totals/2  pairwise_measurement_dataset_connected_components/2  pairwise_measurement_dataset_declared_items/2  pairwise_measurement_dataset_items/2  pairwise_measurement_dataset_measurements/2  pairwise_measurement_dataset_summary/2  print_ranker/1  rank/3  ranker_options/2  scores/2  temporal_pairwise_dataset_connected_components/2  temporal_pairwise_dataset_declared_items/2  temporal_pairwise_dataset_games/2  temporal_pairwise_dataset_games/3  temporal_pairwise_dataset_items/2  temporal_pairwise_dataset_periods/2  temporal_pairwise_dataset_summary/2  valid_option/1  valid_options/1  valid_ranker/1  validate_grouped_dataset/1  validate_grouped_dataset/2  validate_pairwise_dataset/1  validate_pairwise_dataset/2  validate_pairwise_measurement_dataset/1  validate_pairwise_measurement_dataset/2  validate_temporal_pairwise_dataset/1  validate_temporal_pairwise_dataset/2

Public predicates

strongest_paths/2

Returns the labeled strongest-path relation as path(Item1,Item2,Strength) terms for all ordered pairs of distinct learned items.

Compilation flags:
static
Template:
strongest_paths(Ranker,StrongestPaths)
Mode and number of proofs:
strongest_paths(+compound,-list(compound)) - one

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)