Generalization Bounds for Some Ordinal Regression Algorithms

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Conference on Algorithmic Learning Theory

• Publication date

  2008-10-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-87987-9_6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ROC analysis in ordinal regression learning

  2008cited by this paper
• Support Vector Ordinal Regression

  2007influential reference
• Learning to Classify Ordinal Data: The Data Replication Method

  2007influential reference
• Convexity, Classification, and Risk Bounds

  2006cited by this paper
• Loss Functions for Preference Levels: Regression with Discrete Ordered Labels

  2005cited by this paper
• Online Ranking by Projecting

  2005cited by this paper
• Gaussian Processes for Ordinal Regression

  2005cited by this paper
• Stability and Generalization of Bipartite Ranking Algorithms

  2005cited by this paper
• Proceedings of the 18th annual conference on Learning Theory

  2005cited by this paper
• Online Ranking/Collaborative Filtering Using the Perceptron Algorithm

  2003cited by this paper
• Statistical behavior and consistency of classification methods based on convex risk minimization

  2003cited by this paper
• Ranking with Large Margin Principle: Two Approaches

  2002influential reference
• Stability and Generalization

  2002influential reference
• Taxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems

  2002cited by this paper
• Generalized Linear Models

  2002cited by this paper
• Covering Number Bounds of Certain Regularized Linear Function Classes

  2002cited by this paper
• Proceedings of the 12th European Conference on Machine Learning

  2001cited by this paper
• A Simple Approach to Ordinal Classification

  2001cited by this paper
• Prediction of Ordinal Classes Using Regression Trees

  2001cited by this paper
• Pranking with Ranking

  2001cited by this paper
• Large Margin Rank Boundaries for Ordinal Regression

  2000influential reference
• Advances in Large Margin Classifiers

  2000cited by this paper
• Learning in Neural Networks: Theoretical Foundations

  1999cited by this paper
• Generalized Linear Models, 2nd Edn.

  1990cited by this paper
• Chapman and Hall

  1985cited by this paper
• Proceedings of the NIPS 2005 Workshop on Learning to Rank Generalization Bounds for k-Partite Ranking

  year unknowncited by this paper

• Cumulative Logit Ordinal Regression With Proportional Odds Under Nonignorable Missing Responses—Application to Phase III Trial

  2025cites this paper
• Unimodal Likelihood Models for Ordinal Data

  2022cites this paper
• Pairwise Fairness for Ordinal Regression

  2021cites this paper
• Robust Ordinal Regression: User Credit Grading with Triplet Loss-Based Sampling

  2021cites this paper
• Cross-Lingual Document Retrieval with Smooth Learning

  2020cites this paper
• Bounds for Ordinal Regression Pfannschmidt

  2019cites this paper
• Feature relevance bounds for ordinal regression

  2019cites this paper
• University of Groningen Feature Relevance Bounds for Ordinal Regression Pfannschmidt

  2019cites this paper
• Risk Bounds for Low Cost Bipartite Ranking

  2019cites this paper
• Feature Relevance Determination for Ordinal Regression in the Context of Feature Redundancies and Privileged Information

  2019cites this paper
• Feature relevance determination for ordinal regression in the context of feature redundancies and privileged information

  2019cites this paper
• Feature Relevance Determination for Ordinal Regression in the Context of Feature Redundancies and Privileged Information

  2019cites this paper
• Ordinal Regression Methods: Survey and Experimental Study

  2016cites this paper
• A comparison of regression analysis for predicting the daily number of anxiety-related outpatient visits with different time series data mining

  2015cites this paper
• The TreeRank Tournament algorithm for multipartite ranking

  2015influential citation
• Incremental Support Vector Learning for Ordinal Regression

  2015cites this paper
• Building confidence regions for the ROC surface

  2014cites this paper
• On the Consistency of Ordinal Regression Methods

  2014cites this paper
• Ranking data with ordinal labels: optimality and pairwise aggregation

  2013cites this paper
• Méthodes d'apprentissage statistique pour le ranking : théorie, algorithmes et applications

  2013cites this paper
• Ontology Similarity Measure and Ontology Mapping via Learning Optimization Similarity Function

  2012cites this paper
• Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification

  2012cites this paper
• ConeRANK: Ranking as Learning Generalized Inequalities

  2012cites this paper
• Supervised Learning with Similarity Functions

  2012cites this paper
• Statistical Ranking Framework

  2011cites this paper
• Statistical Learning Theory for Ranking

  2011cites this paper
• Generalization Analysis for Ranking

  2011cites this paper
• Ranking Multi-Class Data : Optimality and Pairwise Aggregation

  2011cites this paper
• Learning to rank for information retrieval

  2009cites this paper
• Ontology Similarity Measure and Ontology Mapping via Learning Optimization Similarity Function

  year unknowncites this paper