Benoît Groz
YOU?
Author Swipe
View article: Topic-aware influence maximization with deep reinforcement learning and graph attention networks
Topic-aware influence maximization with deep reinforcement learning and graph attention networks Open
Influence maximization is a fundamental problem in network analysis, focusing on identifying a subset of nodes in a social network to maximize the spread of influence. In this paper, we present an approach for tackling the Influence Maximi…
View article: The KG-ER Conceptual Schema Language
The KG-ER Conceptual Schema Language Open
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, property graphs, RDF) while helping to capture the semantics …
View article: Cutwidth Bounds via Vertex Partitions
Cutwidth Bounds via Vertex Partitions Open
We study the cutwidth measure on graphs and ways to bound the cutwidth of a graph by partitioning its vertices. We consider bounds expressed as a function of two quantities: on the one hand, the maximal cutwidth y of the subgraphs induced …
View article: Edge-Minimum Walk of Modular Length in Polynomial Time
Edge-Minimum Walk of Modular Length in Polynomial Time Open
We study the problem of finding, in a directed graph, an st-walk of length r mod q which is edge-minimum, i.e., uses the smallest number of distinct edges. Despite the vast literature on paths and cycles with modularity constraints, to the…
View article: Static Analysis of Graph Database Transformations
Static Analysis of Graph Database Transformations Open
We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental static analysis problems: type checking and equivalence of tran…
View article: Improved Approximation and Scalability for Fair Max-Min Diversification
Improved Approximation and Scalability for Fair Max-Min Diversification Open
Given an n-point metric space ({𝒳},d) where each point belongs to one of m = O(1) different categories or groups and a set of integers k₁, …, k_m, the fair Max-Min diversification problem is to select k_i points belonging to category i ∈ […
View article: Inference of Shape Expression Schemas Typed RDF Graphs
Inference of Shape Expression Schemas Typed RDF Graphs Open
We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that …
View article: Skyline Computation with Noisy Comparisons
Skyline Computation with Noisy Comparisons Open
Given a set of $n$ points in a $d$-dimensional space, we seek to compute the\nskyline, i.e., those points that are not strictly dominated by any other point,\nusing few comparisons between elements. We adopt the noisy comparison model\n[FR…
View article: Skyline Computation with Noisy Comparisons
Skyline Computation with Noisy Comparisons Open
Given a set of $n$ points in a $d$-dimensional space, we seek to compute the skyline, i.e., those points that are not strictly dominated by any other point, using few comparisons between elements. We adopt the noisy comparison model [FRPU9…
View article: The Complexity of Evaluating Order Queries with the Crowd *
The Complexity of Evaluating Order Queries with the Crowd * Open
One of the foremost challenges for information technology over the last few years has been to explore, understand, and extract useful information from large amounts of data. Some particular tasks such as annotating data or matching entitie…
View article: Filtering With the Crowd: CrowdScreen Revisited
Filtering With the Crowd: CrowdScreen Revisited Open
Filtering a set of items, based on a set of properties that can be verified by humans, is a common application of CrowdSourcing. When the workers are error-prone, each item is presented to multiple users, to limit the probability of miscla…
View article: Skyline Queries with Noisy Comparisons
Skyline Queries with Noisy Comparisons Open
International audience