Extensions of Gaussian processes for ranking: semi-supervised and active learning
Explore this paper's citation graph
Summary
This work focuses on ranking learning from pairwise instance preference to discuss these important extensions, semi-supervised learning and active learning, in the probabilistic framework of Gaussian processes.
- Type
- article
- Published
- 2005-09-16
- Cited by
- 18
- References
- 18
- OpenAlex
- https://openalex.org/W42414577
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59652871
Keywords
Preference learning, Active learning (machine learning), Semi-supervised learning, Machine learning, Artificial intelligence
References
- Learning Preference Relations for Information Retrieval
- Gaussian processes:iterative sparse approximations
- Preference learning with Gaussian processes
- Semi-supervised Learning via Gaussian Processes
- Cluster Kernels for Semi-Supervised Learning
- Information-Based Objective Functions for Active Data Selection
- Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions
- Learning Preferences for Multiclass Problems
- Fast Sparse Gaussian Process Methods: The Informative Vector Machine
- Learning to rank using gradient descent
- Beyond the point cloud: from transductive to semi-supervised learning
- Log-Linear Models for Label Ranking
- Learning with Local and Global Consistency
- Constraint Classification: A New Approach to Multiclass Classification and Ranking
- Active Learning with Statistical Models
- Online Choice of Active Learning Algorithms
- Semi-supervised learning using Gaussian fields and harmonic functions
- Thesis Supervisor Accepted by.......................................................................
- In Advances in Neural Information Processing Systems
Cited by
- Sparse Gaussian Processes for Learning Preferences
- Learning Preferences with Kernel-Based Methods
- Adapting ranking SVM to document retrieval
- Efficiently learning the preferences of people
- Active Ranking in Practice: General Ranking Functions with Sample Complexity Bounds
- Interactive Bayesian optimization : learning user preferences for graphics and animation
- The Analysis of Adaptive Data Collection Methods for Machine Learning
- Analysis on Digital Image Re-Ranking Algorithm based on Multi-feature Fusion
- Efficient Learning from Comparisons
- Bayesian recommender systems : models and algorithms
- Apprentissage de Fonctions d'Ordonnancement Semi-Supervisé Inductives
- Interactive multi-objective reinforcement learning in multi-armed bandits for any utility function
- Speech gesture generation from the trimodal context of text, audio, and speaker identity
- An Approach to Bayesian Optimization for Design Feasibility Check on Discontinuous Black-Box Functions
- Active Ranking using Pairwise Comparisons
- Active Sampling for Rank Learning via Optimizing the Area under the ROC Curve
- Learning community-based preferences via dirichlet process mixtures of Gaussian processes
- Large Scale Co-Regularized Ranking
- A dynamic Bayesian optimized active recommender system for curiosity-driven partially “Human-in-the-loop” automated experiments
- Combining Serendipity and Active Learning for Personalized Contextual Exploration of Knowledge Graphs
Related papers
- Preference learning with Gaussian processes
- Learning to rank using gradient descent
- An efficient boosting algorithm for combining preferences
- Optimizing search engines using clickthrough data
- Gaussian Processes for Machine Learning
- S4L: Self-Supervised Semi-Supervised Learning
- S^4L: Self-Supervised Semi-Supervised Learning
- EnAET: A Self-Trained Framework for Semi-Supervised and Supervised Learning With Ensemble Transformations