Gradient descent technology for sparse vector learning in ontology algorithms
From MaRDI portal
Publication:5069813
Recommendations
- Affine transformation based ontology sparse vector learning algorithm
- Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology
- Ontology learning algorithm based on ranking SVM
- A discrete dynamics approach to sparse calculation and applied in ontology science
- scientific article; zbMATH DE number 1734132
- Ontology learning: grand tour and challenges
Cites work
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Cross‐validation based assessment of a new Bayesian palaeoclimate model
- Extreme value analysis of empirical frame coefficients and implications for denoising by soft-thresholding
- Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Performance of first-order methods for smooth convex minimization: a novel approach
- Stability analysis of learning algorithms for ontology similarity computation
- Strong and weak stability of \(k\)-partite ranking algorithms
- Thinned Array Beampattern Synthesis by Iterative Soft-Thresholding-Based Optimization Algorithms
- Two-point step-size iterative soft-thresholding method for sparse reconstruction
Cited in
(1)
This page was built for publication: Gradient descent technology for sparse vector learning in ontology algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069813)
