Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
From MaRDI portal
Recommendations
Cited in
(12)- A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval
- Weight-based label-unknown multi-view data set generation approach
- Statistical analysis of the moving least-squares method with unbounded sampling
- The framework of manifold regularization of ranking on graphs
- Bias corrected regularization kernel method in ranking
- Efficient regularized least-squares algorithms for conditional ranking on relational data
- Sparse mean-variance customer Markowitz portfolio optimization for Markov chains: a Tikhonov's regularization penalty approach
- Co-regularized least-squares for label ranking
- Debiased magnitude-preserving ranking: learning rate and bias characterization
- Video semantic analysis based on structure-sensitive anisotropic manifold ranking
- Laplacian unit-hyperplane learning from positive and unlabeled examples
- Learning to rank on graphs
This page was built for publication: Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510525)