Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs
Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely related to semantic similarity and relationships, but its measurement strongly depends on the context of the given concepts. DIS-C represents an advancement in the computation of sema...
Main Authors: | Rolando Quintero, Esteban Mendiola, Giovanni Guzmán, Miguel Torres-Ruiz, Carlos Guzmán Sánchez-Mejorada |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-11-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/23/4806 |
Similar Items
-
A Conceptual Graph-Based Method to Compute Information Content
by: Rolando Quintero, et al.
Published: (2023-09-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
Extended Lorenz majorization and frequencies of distances in an undirected network
by: Egghe Leo
Published: (2024-02-01) -
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004) -
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004)