scientific article; zbMATH DE number 1288298
From MaRDI portal
Publication:4243442
Recommendations
Cited in
(64)- Analysis of regularized least squares ranking with centered reproducing kernel
- Machine Learning: ECML 2004
- Statistical computational learning
- A phase transition in Arrow's theorem with three alternatives
- On the exact amount of missing information that makes finding possible winners hard
- Learning concepts by arranging appropriate training order
- Set-to-Sequence Methods in Machine Learning: A Review
- Optimality of regularized least squares ranking with imperfect kernels
- Preference-based learning to rank
- Robust reductions from ranking to classification
- Mining maximum consensus sequences from group ranking data
- Democratic approximation of lexicographic preference models
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- The \(K\)-armed dueling bandits problem
- Using extension sets to aggregate partial rankings in a flexible setting
- Relational networks of conditional preferences
- Kernels for feedback arc set in tournaments
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting
- Preference relation-based Markov random fields for recommender systems
- On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Packing arc-disjoint cycles in tournaments
- Computer science and decision theory
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
- Dyad ranking using Plackett-Luce models based on joint feature representations
- Detecting and ordering salient regions
- Partial order bounding: A new approach to evaluation in game tree search
- Space reduction constraints for the median of permutations problem
- Partial evaluation in rank aggregation problems
- Packing Arc-Disjoint Cycles in Tournaments
- Comparing multiagent systems research in combinatorial auctions and voting
- \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Automedian sets of permutations: direct sum and shuffle
- 10.1162/1532443041827916
- Scaling-invariant maximum margin preference learning
- A reward-based approach for preference modeling: a case study
- Experiments with Kemeny ranking: What works when?
- Global optimization based on active preference learning with radial basis functions
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Learning to rank on graphs
- U-Processes and Preference Learning
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Concordance and consensus
- Sequential event prediction
- Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems
- Label ranking by learning pairwise preferences
- A linear functional strategy for regularized ranking
- A review on instance ranking problems in statistical learning
- Analysis of convergence performance of neural networks ranking algorithm
- Local distance constrained bribery in voting
- scientific article; zbMATH DE number 7370524 (Why is no real title available?)
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
- Bias corrected regularization kernel method in ranking
- Generalization performance of bipartite ranking algorithms with convex losses
- Analyzing and mining ordered information tables
- A new approach for identifying the Kemeny median ranking
- WHIRL: A word-based information representation language
- Supervised multidimensional scaling for visualization, classification, and bipartite ranking
- A survey on the linear ordering problem for weighted or unweighted tournaments
- The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models
- Statistical significance of the Netflix challenge
- Intensity of preference and related uncertainty in non-compensatory aggregation rules
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243442)
