Ontology optimization tactics via distance calculating
From MaRDI portal
Publication:4597639
DOI10.21042/AMNS.2016.1.00012zbMATH Open1423.68490WikidataQ112771438 ScholiaQ112771438MaRDI QIDQ4597639FDOQ4597639
Authors: Yun Gao, Mohammad Reza Farahani, Wei Gao 
Publication date: 14 December 2017
Published in: Applied Mathematics and Nonlinear Sciences (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (18)
- Bi-level multi-objective optimization model for last mile delivery using a discrete approach
- Ontology computation for graph spaces focus on partial vertex pairs
- Ontology learning algorithm based on ranking SVM
- Stability analysis of learning algorithms for ontology similarity computation
- Ontology mapping based on \(k\)-partite ranking learning method
- Total factor productivity growth and technological change in the telecommunications industry
- Disequilibrium multi-dividing ontology learning algorithm
- An analysis of multiple similarity measures for ontology mapping problem
- A discrete dynamics approach to sparse calculation and applied in ontology science
- Title not available (Why is that?)
- Improved concept similarity computing approach in ontology mapping
- Characteristic sets verses generalized characteristic sets
- 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
- A discrete method based on distance measure in linguistic space and its application for CMADM problem
- Affine transformation based ontology sparse vector learning algorithm
- A forecasting method for Chinese civil planes attendance rate based on vague sets
- Leave-two-out stability of ontology learning algorithm
This page was built for publication: Ontology optimization tactics via distance calculating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597639)
