Ontology computation for graph spaces focus on partial vertex pairs

DOI10.1080/10236198.2016.1200567zbMath1372.68226OpenAlexW2472482883WikidataQ112808018 ScholiaQ112808018MaRDI QIDQ4978251

Wei Gao, Muhammad Reza Farahani, Xiao Yu, Jian-Zhang Wu

Publication date: 8 August 2017

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236198.2016.1200567

zbMATH Keywords

similarity measureontologyontology mappingadjoint graphKronecker kernel

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (1)

Characteristic sets verses generalized characteristic sets

Cites Work

• Cycle Kronecker products that are representable as optimal circulants
• Unimodality via Kronecker products
• Simple spectral bounds for sums of certain Kronecker products
• Regularized learning in Banach spaces as an optimization problem: representer theorems
• Stability analysis of learning algorithms for ontology similarity computation
• Ontology Sparse Vector Learning Algorithm for Ontology Similarity Measuring and Ontology Mapping via ADAL Technology
• FFT-based Kronecker product approximation to micromagnetic long-range interactions
• Shifted Kronecker Product Systems

This page was built for publication: Ontology computation for graph spaces focus on partial vertex pairs