CONNOR: Exploring Similarities in Graphs with Concepts of Neighbors - Archive ouverte HAL Access content directly
Conference Papers Year :

CONNOR: Exploring Similarities in Graphs with Concepts of Neighbors

Hugo Ayats
Peggy Cellier
Sébastien Ferré

Abstract

Since its first formalization, the Formal Concept Analysis (FCA) field has shown diverse extensions of the FCA paradigm. A recent example is Graph-FCA, an extension of FCA to graphs. In the context of Graph-FCA, a notion of concept of neighbors has been introduced to support a form of nearest neighbor search over the nodes of a graph. Concepts of neighbors have been used for diverse tasks, such as knowledge graph completion and relation classification in texts. In this paper, we present CONNOR, a Java library for the computation of concepts of neighbors on RDF graphs.
Fichier principal
Vignette du fichier
ETAFCA_2022.pdf (451.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03866075 , version 1 (22-11-2022)

Identifiers

  • HAL Id : hal-03866075 , version 1

Cite

Hugo Ayats, Peggy Cellier, Sébastien Ferré. CONNOR: Exploring Similarities in Graphs with Concepts of Neighbors. ETAFCA 2022 - Existing Tools and Applications for Formal Concept Analysis, Jun 2022, Tallinn, Estonia. pp.1-6. ⟨hal-03866075⟩
34 View
12 Download

Share

Gmail Facebook Twitter LinkedIn More