CONNOR: Exploring Similarities in Graphs with Concepts of Neighbors - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

CONNOR: Exploring Similarities in Graphs with Concepts of Neighbors

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Licence

Paternité

Identifiants

  • HAL Id : hal-03866075 , version 1

Citer

H. Ambre 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⟩
65 Consultations
33 Téléchargements

Partager

Gmail Facebook X LinkedIn More