Stability analysis of learning algorithms for ontology similarity computation
Summary: Ontology, as a useful tool, is widely applied in lots of areas such as social science, computer science, and medical science. Ontology concept similarity calculation is the key part of the algorithms in these applications. A recent approach is to make use of similarity between vertices on ontology graphs. It is, instead of pairwise computations, based on a function that maps the vertex set of an ontology graph to real numbers. In order to obtain this, the ranking learning problem plays an important and essential role, especially \(k\)-partite ranking algorithm, which is suitable for solving some ontology problems. A ranking function is usually used to map the vertices of an ontology graph to numbers and assign ranks of the vertices through their scores. Through studying a training sample, such a function can be learned. It contains a subset of vertices of the ontology graph. A good ranking function means small ranking mistakes and good stability. For ranking algorithms, which are in a well-stable state, we study generalization bounds via some concepts of algorithmic stability. We also find that kernel-based ranking algorithms stated as regularization schemes in reproducing kernel Hilbert spaces satisfy stability conditions and have great generalization abilities.
- 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
- 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
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- 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
- Partial multi-dividing ontology learning algorithm
- Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology
- Affine transformation based ontology sparse vector learning algorithm
- Ontology mapping based on \(k\)-partite ranking learning method
- Distance computation of ontology vector for ontology similarity measuring and ontology mapping
- Ontology computation for graph spaces focus on partial vertex pairs
- Analysis of a k-partite ranking ontology algorithm based on an optimal ROC curve
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Gradient descent technology for sparse vector learning in ontology algorithms
- A discrete dynamics approach to sparse calculation and applied in ontology science
- Ontology learning algorithm based on ranking SVM
- 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)
