Stability analysis of learning algorithms for ontology similarity computation
From MaRDI portal
Publication:2016684
Recommendations
- Analysis of a \(k\)-partite ranking ontology algorithm based on an optimal ROC curve
- Ontology computation for graph spaces focus on partial vertex pairs
- Leave-two-out stability of ontology learning algorithm
- Ontology optimization tactics via distance calculating
- Ontology learning algorithm based on ranking SVM
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- 10.1162/153244302760200704
- An approximation theory approach to learning with \(\ell^1\) regularization
- Consistency of spectral clustering
- Convergence of spectral clustering with a general similarity function
- Cross-validation based adaptation for regularization operators in learning theory
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Generalization bounds for ranking algorithms via algorithmic stability
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Geometry on probability spaces
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory
- Learning to rank on graphs
- Online regression with varying Gaussians and non-identical distributions
- Real-variable characterizations of Hardy spaces associated with Bessel operators
Cited in
(12)- Ontology computation for graph spaces focus on partial vertex pairs
- Partial multi-dividing ontology learning algorithm
- Ontology learning algorithm based on ranking SVM
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Ontology mapping based on \(k\)-partite ranking learning method
- A discrete dynamics approach to sparse calculation and applied in ontology science
- Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology
- Analysis of a \(k\)-partite ranking ontology algorithm based on an optimal ROC curve
- Distance computation of ontology vector for ontology similarity measuring and ontology mapping
- Gradient descent technology for sparse vector learning in ontology algorithms
- Affine transformation based ontology sparse vector learning algorithm
- Leave-two-out stability of ontology learning algorithm
This page was built for publication: Stability analysis of learning algorithms for ontology similarity computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016684)
