Answering why-questions by exemplars in attributed graphs
This paper studies the problem of\em answering Why-questions for graph pattern queries.
Given a query Q, its answers Q(G) in a graph G, and an exemplar \E that describes desired …
Given a query Q, its answers Q(G) in a graph G, and an exemplar \E that describes desired …
Picasso: exploratory search of connected subgraph substructures in graph databases
Recently, exploratory search has received much attention in information retrieval and
database fields. This search paradigm assists users who do not have a clear search intent …
database fields. This search paradigm assists users who do not have a clear search intent …
TED: Towards discovering top-k edge-diversified patterns in a graph database
With an exponentially growing number of graphs from disparate repositories, there is a
strong need to analyze a graph database containing an extensive collection of small-or …
strong need to analyze a graph database containing an extensive collection of small-or …
Cluster query: a new query pattern on temporal knowledge graph
A temporal knowledge graph (TKG) is theoretically a temporal graph. Recently, systems
have been developed to support snapshot queries over temporal graphs. However …
have been developed to support snapshot queries over temporal graphs. However …
A statistical approach to knowledge discovery: Bootstrap analysis of language models for knowledge base population from unstructured text
S Momtazi, O Moradiannasab - Scientia Iranica, 2019 - scientiairanica.sharif.edu
In this paper, we propose a novel approach for knowledge discovery from textual data. The
generated knowledge base can be used as one of the main components in the cognitive …
generated knowledge base can be used as one of the main components in the cognitive …
[PDF][PDF] Un système d'interrogation flexible pour le Web sémantique: application au corpus de la correspondance d'Henri Poincaré
N Lasolle - 2022 - researchgate.net
L'expression «Web sémantique» désigne une extension du Web qui s' appuie sur des
données structurées et réutilisables. L'objectif est de produire du contenu pouvant être …
données structurées et réutilisables. L'objectif est de produire du contenu pouvant être …
FERRARI: an efficient framework for visual exploratory subgraph search in graph databases
Exploratory search paradigm assists users who do not have a clear search intent and are
unfamiliar with the underlying data space. Query formulation evolves iteratively in this …
unfamiliar with the underlying data space. Query formulation evolves iteratively in this …
Insta-search: Towards effective exploration of knowledge graphs
M Mohanty, M Ramanath - Proceedings of the 28th ACM International …, 2019 - dl.acm.org
Knowledge Graphs (KGs) are used to store heterogenous information in the form of graphs.
One flexible and non-expert way to query these KGs is to use relationship queries or …
One flexible and non-expert way to query these KGs is to use relationship queries or …
Conception d'un famework pour la relaxation des requêtes SPARQL
GF Pelap - 2016 - theses.hal.science
Une ontologie (ou base de connaissances) est une représentation formelle de
connaissances sous la forme d'entités et de faits sur ces entités. Ces dernières années de …
connaissances sous la forme d'entités et de faits sur ces entités. Ces dernières années de …
[PDF][PDF] Conception d'un framework pour la relaxation des requetes SPARQL
F TOUMANI, F GOASDOUE, A HADJALI - 2016 - lias-lab.fr
Le Web sémantique a été créé, dans les années 90, afin de permettre aux utilisateurs de
rechercher, partager et combiner les informations plus aisément et sans aucun …
rechercher, partager et combiner les informations plus aisément et sans aucun …