• Publications
  • Influence
Determining Semantic Similarity among Entity Classes from Different Ontologies
TLDR
This work presents an approach to computing semantic similarity that relaxes the requirement of a single ontology and accounts for differences in the levels of explicitness and formalization of the different ontology specifications.
Comparing geospatial entity classes: an asymmetric and context-dependent similarity measure
TLDR
The Matching-Distance Similarity Measure (MDSM) is defined for determining semantic similarity among spatial entity classes, taking into account the distinguishing features of these classes and their semantic interrelations (is–a and part–whole relations).
The Gremlin graph traversal machine and language (invited talk)
TLDR
These properties enable Gremlin to naturally support imperative and declarative querying, host language agnosticism, user-defined domain specific languages, an extensible compiler/optimizer, single- and multi-machine execution models, hybrid depth- and breadth-first evaluation, as well as the existence of a Universal Gremlin Machine and its respective entailments.
Constructions from Dots and Lines
TLDR
The world of graphs in computing is explored and situations in which graphical models are beneficial are exposed.
Journal status
TLDR
The Y-factor is introduced which is a simple combination of both the ISI IF and the weighted PageRank, and it is found that the resulting journal rankings correspond well to a general understanding of journal status.
Clickstream Data Yields High-Resolution Maps of Science
TLDR
Map of science resulting from large-scale clickstream data provide a detailed, contemporary view of scientific activity and correct the underrepresentation of the social sciences and humanities that is commonly found in citation data.
The Graph Traversal Pattern
TLDR
The graph traversal pattern and its use in computing is discussed, which makes use of index-free, local traversals in contrast to the index-intensive, set-theoretic operations of relational databases.
The Gremlin Graph Traversal Machine and Language
TLDR
These properties enable Gremli n to naturally support imperative and declarative querying, host l anguage agnosticism, user-defined domain specific languages, an ext e sible compiler/optimizer, singleand multi-machine execution models, hybrid depthand breadth-first evaluation, as well as the ex ist nce of a Universal Gremlin Machine and its respective entailmen ts.
Groupoids
This paper gives some new results for the theory of quantum groupoids. First, the authors recall the relevant notions and results of the theory of Li-Rinehart algebras and bialgebras. Then, they
...
1
2
3
4
5
...