Stability analysis of learning algorithms for ontology similarity computation
From MaRDI portal
Publication:2016684
DOI10.1155/2013/174802zbMath1371.68234OpenAlexW1974646033WikidataQ58915433 ScholiaQ58915433MaRDI QIDQ2016684
Publication date: 20 June 2014
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/174802
Related Items
Gradient descent technology for sparse vector learning in ontology algorithms, Affine Transformation Based Ontology Sparse Vector Learning Algorithm, Partial multi-dividing ontology learning algorithm, Leave-two-out stability of ontology learning algorithm, Ontology Sparse Vector Learning Algorithm for Ontology Similarity Measuring and Ontology Mapping via ADAL Technology, A discrete dynamics approach to sparse calculation and applied in ontology science, Distance computation of ontology vector for ontology similarity measuring and ontology mapping, Ontology computation for graph spaces focus on partial vertex pairs, Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Geometry on probability spaces
- An approximation theory approach to learning with \(\ell^1\) regularization
- Learning to rank on graphs
- Consistency of spectral clustering
- ONLINE REGRESSION WITH VARYING GAUSSIANS AND NON-IDENTICAL DISTRIBUTIONS
- REAL-VARIABLE CHARACTERIZATIONS OF HARDY SPACES ASSOCIATED WITH BESSEL OPERATORS
- CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- 10.1162/153244302760200704
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Convergence of spectral clustering with a general similarity function
- Learning Theory
