On Equivalence Relationships Between Classification and Ranking Algorithms

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Journal of machine learning research

• Publication date

  2011-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.5555/1953048.2078199
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Boosting: Foundations and Algorithms

  2013cited by this paper
• Boosting: Foundations and Algorithms

  2012cited by this paper
• The Rate of Convergence of Adaboost

  2011cited by this paper
• Bipartite Ranking through Minimization of Univariate Loss

  2011cited by this paper
• The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List

  2009cited by this paper
• Margin-based Ranking and an Equivalence between AdaBoost and RankBoost

  2009cited by this paper
• Multi-class cost-sensitive boosting with p-norm loss functions

  2008cited by this paper
• Cost-sensitive boosting for classification of imbalanced data

  2007cited by this paper
• Boosted Classification Trees and Class Probability/Quantile Estimation

  2007cited by this paper
• Robust Reductions from Ranking to Classification

  2006cited by this paper
• An empirical comparison of supervised learning algorithms

  2006cited by this paper
• Learning to rank using gradient descent

  2005cited by this paper
• Soft Margins for AdaBoost

  2001cited by this paper
• Logistic Regression, AdaBoost and Bregman Distances

  2000cited by this paper
• Special Invited Paper-Additive logistic regression: A statistical view of boosting

  2000cited by this paper
• Boosting Algorithms as Gradient Descent

  1999cited by this paper
• AdaCost: Misclassification Cost-Sensitive Boosting

  1999cited by this paper
• A geometric approach to leveraging weak learners

  1999cited by this paper
• An Efficient Boosting Algorithm for Combining Preferences

  1998influential reference
• A decision-theoretic generalization of on-line learning and an application to boosting

  1997cited by this paper
• ARCING THE EDGE

  1997cited by this paper
• No free lunch theorems for optimization

  1997cited by this paper

• Fast Sparse Classification for Generalized Linear and Additive Models

  2022cites this paper
• Density-Ratio Based Personalised Ranking from Implicit Feedback

  2021cites this paper
• DSS-OSM: An Integrated Decision Support System for Offshore Oil Spill Management

  2021cites this paper
• Cell Detection from Imperfect Annotation by Pseudo Label Selection Using P-classification

  2021influential citation
• Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges

  2021cites this paper
• Automatic role identification for research teams with ranking multi-view machines

  2020cites this paper
• The risk of trivial solutions in bipartite top ranking

  2018cites this paper
• Direct Learning to Rank and Rerank

  2018cites this paper
• A loss framework for calibrated anomaly detection

  2018cites this paper
• Cold-start playlist recommendation with multitask learning

  2018influential citation
• Optimal choice: new machine learning problem and its solution

  2017cites this paper
• Optimal choice problem and its solutions

  2017cites this paper
• Bipartite Ranking: a Risk-Theoretic Perspective

  2016cites this paper
• Offshore oil spill response practices and emerging challenges.

  2016influential citation
• Linking losses for density ratio and class-probability estimation

  2016cites this paper
• Learning Optimized Risk Scores

  2016cites this paper
• Learning to rank academic experts in the DBLP dataset

  2015cites this paper
• Development of an integrated decision support system for supporting offshore oil spill response in harsh environments

  2014influential citation
• Bayes-Optimal Scorers for Bipartite Ranking

  2014cites this paper
• Analytics for Power Grid Distribution Reliability in New York City

  2014cites this paper
• Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking

  2013cites this paper
• Learning about meetings

  2013cites this paper
• Parameter-free classification in multi-class imbalanced data sets

  2013cites this paper
• Learning multi-labeled bioacoustic samples with an unsupervised feature learning approach

  2013cites this paper
• On the Relationship Between Binary Classification, Bipartite Ranking, and Binary Class Probability Estimation

  2013cites this paper
• Online Learning with Pairwise Loss Functions

  2013cites this paper
• Predicting accurate probabilities with a ranking loss

  2012cites this paper
• Integer optimization methods for machine learning

  2012cites this paper
• Integer Optimization Methods for Supervised Ranking

  2011cites this paper