A discrete dynamics approach to sparse calculation and applied in ontology science

DOI10.1080/10236198.2018.1551383zbMath1430.68331OpenAlexW2902588722MaRDI QIDQ5205890

Yaojun Chen, Yunqing Zhang, Wei Gao, Juan Luis García Guirao

Publication date: 17 December 2019

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

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

zbMATH Keywords

ontologyontology mappingsimilarity measuringsparse computing

Mathematics Subject Classification ID

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

Related Items (1)

Chaotic behaviour and bifurcation in real dynamics of two-parameter family of functions including logarithmic map

Cites Work

• Unnamed Item
• A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
• A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
• Dynamic algorithms via the primal-dual method
• A primal-dual approach of weak vector equilibrium problems
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
• A double oracle approach to minmax regret optimization problems with interval data
• Stability analysis of learning algorithms for ontology similarity computation
• Partial multi-dividing ontology learning algorithm
• Peristaltic slip flow of a Bingham fluid in an inclined porous conduit with Joule heating
• Ontology Sparse Vector Learning Algorithm for Ontology Similarity Measuring and Ontology Mapping via ADAL Technology
• Coordinate descent with arbitrary sampling I: algorithms and complexity^†
• Coordinate descent with arbitrary sampling II: expected separable overapproximation
• Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems
• FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time
• Disequilibrium multi-dividing ontology learning algorithm
• Ontology optimization tactics via distance calculating
• Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
• Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection
• Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
• Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks

This page was built for publication: A discrete dynamics approach to sparse calculation and applied in ontology science