Learning to rank on graphs
From MaRDI portal
Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Computational methods for problems pertaining to biology (92-08)
Recommendations
- Learning to rank in vector spaces and social networks
- The framework of manifold regularization of ranking on graphs
- An efficient algorithm for learning to rank from preference graphs
- Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
- Learning Theory
Cites work
- 10.1162/1532443041827916
- An Alternative Ranking Problem for Search Engines
- Authoritative sources in a hyperlinked environment
- Existence of nonnegative solutions for nonlinear boundary value problems via pseudomonotone operators and nonsmooth critical point theory
- Generalization bounds for ranking algorithms via algorithmic stability
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Kernels and regularization on graphs.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Laplacians and the Cheeger inequality for directed graphs
- Learning Theory
- Learning Theory
- Online Ranking by Projecting
- Ranking and empirical minimization of \(U\)-statistics
- Semi-supervised learning on Riemannian manifolds
- Small ball probabilities for a shifted Poisson process
- Some properties of invariant sets of a flow
- Statistical Analysis of Bayes Optimal Subset Ranking
- Support Vector Ordinal Regression
- The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list
Cited in
(32)- Fuzzy collaborative clustering-based ranking approach for complex objects
- Query-dependent ranking and its asymptotic properties
- Learning layered ranking functions with structured support vector machines
- Relational retrieval using a combination of path-constrained random walks
- Graph regularization methods for Web spam detection
- An efficient algorithm for learning to rank from preference graphs
- Stability analysis of learning algorithms for ontology similarity computation
- A review on instance ranking problems in statistical learning
- Efficient regularized least-squares algorithms for conditional ranking on relational data
- RankMerging: a supervised learning-to-rank framework to predict links in large social networks
- Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
- Properties of vector embeddings in social networks
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- Efficient learning of label ranking by soft projections onto polyhedra
- Learning-Related Complexity of Linear Ranking Functions
- scientific article; zbMATH DE number 6961717 (Why is no real title available?)
- Ranking with adaptive neighbors
- Generalization performance of bipartite ranking algorithms with convex losses
- The rankability of data
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Graph representation learning for popularity prediction problem: A survey
- Learning to Rank in Entity Relationship Graphs
- Learning utility functions from preference relations on graphs
- On consistent vertex nomination schemes
- The framework of manifold regularization of ranking on graphs
- Graph Machines and Their Applications to Computer-Aided Drug Design: A New Approach to Learning from Structured Data
- Learning to rank in vector spaces and social networks
- Quantitative robustness of instance ranking problems
- Graph neural networks-based preference learning method for object ranking
- Reliable graph-based collaborative ranking
- Learning to rank: a ROC-based graph-theoretic approach
- Ranking relations using analogies in biological and information networks
This page was built for publication: Learning to rank on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959630)
