Ontology optimization tactics via distance calculating
From MaRDI portal
(Redirected from Publication:4597639)
Recommendations
Cites work
Cited in
(19)- Stability analysis of learning algorithms for ontology similarity computation
- Partial multi-dividing ontology learning algorithm
- Total factor productivity growth and technological change in the telecommunications industry
- Improved concept similarity computing approach in ontology mapping
- An analysis of multiple similarity measures for ontology mapping problem
- Disequilibrium multi-dividing ontology learning algorithm
- 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
- Bi-level multi-objective optimization model for last mile delivery using a discrete approach
- Analysis of a k-partite ranking ontology algorithm based on an optimal ROC curve
- Characteristic sets verses generalized characteristic sets
- A discrete dynamics approach to sparse calculation and applied in ontology science
- A discrete method based on distance measure in linguistic space and its application for CMADM problem
- Ontology learning algorithm based on ranking SVM
- Leave-two-out stability of ontology learning algorithm
- A forecasting method for Chinese civil planes attendance rate based on vague sets
- scientific article; zbMATH DE number 2246070 (Why is no real title available?)
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)
