scientific article; zbMATH DE number 1288298
From MaRDI portal
Publication:4243442
zbMath0915.68031MaRDI QIDQ4243442
William W. Cohen, Robert E. Schapire, Yoram Singer
Publication date: 18 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A review on instance ranking problems in statistical learning, Analyzing and mining ordered information tables, Dyad ranking using Plackett-Luce models based on joint feature representations, Label ranking by learning pairwise preferences, A survey on the linear ordering problem for weighted or unweighted tournaments, Partial evaluation in rank aggregation problems, The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders, Preference relation-based Markov random fields for recommender systems, Scaling-invariant maximum margin preference learning, A linear functional strategy for regularized ranking, Packing arc-disjoint cycles in tournaments, Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems, A reward-based approach for preference modeling: a case study, A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments, Space reduction constraints for the median of permutations problem, Intensity of preference and related uncertainty in non-compensatory aggregation rules, Comparing multiagent systems research in combinatorial auctions and voting, Detecting and ordering salient regions, Unnamed Item, Optimality of regularized least squares ranking with imperfect kernels, Analysis of convergence performance of neural networks ranking algorithm, Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting, Relational networks of conditional preferences, The \(K\)-armed dueling bandits problem, On the exact amount of missing information that makes finding possible winners hard, Experiments with Kemeny ranking: What works when?, Bias corrected regularization kernel method in ranking, Supervised multidimensional scaling for visualization, classification, and bipartite ranking, Democratic approximation of lexicographic preference models, Preference-based learning to rank, Learning to rank on graphs, Local distance constrained bribery in voting, U-Processes and Preference Learning, Automedian sets of permutations: direct sum and shuffle, Kernels for feedback arc set in tournaments, Using extension sets to aggregate partial rankings in a flexible setting, Generalization performance of bipartite ranking algorithms with convex losses, WHIRL: A word-based information representation language, The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders, Set-to-Sequence Methods in Machine Learning: A Review, Calibration and regret bounds for order-preserving surrogate losses in learning to rank, Sequential event prediction, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Concordance and consensus, Partial order bounding: A new approach to evaluation in game tree search, Computer science and decision theory, Statistical significance of the Netflix challenge, Robust reductions from ranking to classification, The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models, Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions, Global optimization based on active preference learning with radial basis functions, \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}, Packing Arc-Disjoint Cycles in Tournaments, Mining maximum consensus sequences from group ranking data, Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers, On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard, A new approach for identifying the Kemeny median ranking, Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
