The following pages link to (Q4243442):
Displaying 50 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Detecting and ordering salient regions (Q408609) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- Supervised multidimensional scaling for visualization, classification, and bipartite ranking (Q452683) (← links)
- Generalization performance of bipartite ranking algorithms with convex losses (Q488690) (← links)
- Concordance and consensus (Q545367) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Democratic approximation of lexicographic preference models (Q646538) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Robust reductions from ranking to classification (Q1009271) (← links)
- Mining maximum consensus sequences from group ranking data (Q1027615) (← links)
- Dyad ranking using Plackett-Luce models based on joint feature representations (Q1640577) (← links)
- Partial evaluation in rank aggregation problems (Q1652087) (← links)
- A linear functional strategy for regularized ranking (Q1669294) (← links)
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting (Q1698914) (← links)
- Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
- Analyzing and mining ordered information tables (Q1884314) (← links)
- Intensity of preference and related uncertainty in non-compensatory aggregation rules (Q1930915) (← links)
- Analysis of convergence performance of neural networks ranking algorithm (Q1942699) (← links)
- Relational networks of conditional preferences (Q1945137) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- Learning to rank on graphs (Q1959630) (← links)
- WHIRL: A word-based information representation language (Q1978789) (← links)
- The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models (Q2048216) (← links)
- Global optimization based on active preference learning with radial basis functions (Q2051251) (← links)
- A review on instance ranking problems in statistical learning (Q2127240) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank (Q2251435) (← links)
- Sequential event prediction (Q2251444) (← links)
- Computer science and decision theory (Q2271874) (← links)
- \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost} (Q2303658) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- A new approach for identifying the Kemeny median ranking (Q2333014) (← links)
- Label ranking by learning pairwise preferences (Q2389690) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- Preference relation-based Markov random fields for recommender systems (Q2398091) (← links)
- Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems (Q2407884) (← links)
- A reward-based approach for preference modeling: a case study (Q2410502) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Scaling-invariant maximum margin preference learning (Q2658026) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- On the exact amount of missing information that makes finding possible winners hard (Q2698287) (← links)
- Learning concepts by arranging appropriate training order (Q2744912) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- Bias corrected regularization kernel method in ranking (Q4615656) (← links)
