%0 Conference Proceedings %T Extracting Relations in Texts with Concepts of Neighbours %+ Semantics, Logics, Information Systems for Data-User Interaction ( SemLIS) %+ Université de Rennes (UR) %+ Centre National de la Recherche Scientifique (CNRS) %+ Institut National des Sciences Appliquées (INSA) %A Ayats, Hugo %A Cellier, Peggy %A Ferré, Sébastien %< avec comité de lecture %B International Conference In Formal Concepts Analysis %C Strasbourg, France %8 2021-06-29 %D 2021 %Z Computer Science [cs] %Z Computer Science [cs]/Artificial Intelligence [cs.AI]Conference papers %X During the last decade, the need for reliable and massive Knowledge Graphs (KG) increased. KGs can be created in several ways: manually with forms or automatically with Information Extraction (IE), a natural language processing task for extracting knowledge from text. Relation Extraction is the part of IE that focuses on identifying relations between named entities in texts, which amounts to find new edges in a KG. Most recent approaches rely on deep learning, achieving state-ofthe-art performances. However, those performances are still too low to fully automatize the construction of reliable KGs, and human interaction remains necessary. This is made difficult by the statistical nature of deep learning methods that makes their predictions hardly interpretable. In this paper, we present a new symbolic and interpretable approach for Relation Extraction in texts. It is based on a modeling of the lexical and syntactic structure of text as a knowledge graph, and it exploits Concepts of Neighbours, a method based on Graph-FCA for computing similarities in knowledge graphs. An evaluation has been performed on a subset of TACRED (a relation extraction benchmark), showing promising results. %G English %2 https://inria.hal.science/hal-03531335/document %2 https://inria.hal.science/hal-03531335/file/2021_ICFCA_Hugo.pdf %L hal-03531335 %U https://inria.hal.science/hal-03531335 %~ UNIV-RENNES1 %~ CNRS %~ INRIA %~ UNIV-UBS %~ INSA-RENNES %~ IRISA %~ IRISA_SET %~ GRID5000 %~ IRISA-INSA-R %~ CENTRALESUPELEC %~ UR1-HAL %~ UR1-MATH-STIC %~ UR1-UFR-ISTIC %~ TEST-UR-CSS %~ UNIV-RENNES %~ INRIA-300009 %~ INSA-GROUPE %~ SILECS %~ UR1-MATH-NUM