Pierre Senellart

Prof. Pierre Senellart


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2004 in SIAM Review
Verified
Journal Article
Closed access
VBVincent D. Blondel
Vincent D. Blondel
AGAnahí Gajardo
Anahí Gajardo
MHMaureen Heymans
Maureen Heymans
PSPierre Senellart
Pierre Senellart
PDPaul Van Dooren
Paul Van Dooren
We introduce a concept of {similarity} between vertices of directed graphs. Let G A and G B betwo directed graphs with, respectively, n A and n B vertices. We define an n B \times n A similarity matrixS whose real entry s ij expresses how similar vertex j (in G A ) is to vertex i (in G B ): we say that s ij is their similarity score. The similarity matrix can be obtained as the limit of the normalized even iterates of S k +1 = BS k A T + B T S k A, where A and B are adjacency matrices of the graphs and S 0 is a matrix whose entries are all equal to 1. In the special case where G A = G B = G, the matrix S is square and the score s ij is the similarity score between the vertices i and j of G. We point out that Kleinberg's "hub and authority" method to identify web-pages relevant to a given query can be viewed as a special case of our definition in the case where one of the graphs has two vertices and a unique directed edge between them. In analogy to Kleinberg, we show that our similarity scores are given by the components of a dominant eigenvector of a nonnegative matrix. Potential applications of our similarity concept are numerous. We illustrate an application for the automatic extraction of synonyms in a monolingual dictionary.

1 November 2011 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
FSFabian M. Suchanek
Fabian M. Suchanek
SASerge Abiteboul
Serge Abiteboul
PSPierre Senellart
Pierre Senellart
One of the main challenges that the Semantic Web faces is the integration of a growing number of independently designed ontologies. In this work, we present paris, an approach for the automatic alignment of ontologies. paris aligns not only instances, but also relations and classes. Alignments at the instance level cross-fertilize with alignments at the schema level. Thereby, our system provides a truly holistic solution to the problem of ontology alignment. The heart of the approach is probabilistic, i.e., we measure degrees of matchings based on probability estimates. This allows paris to run without any parameter tuning. We demonstrate the efficiency of the algorithm and its precision through extensive experiments. In particular, we obtain a precision of around 90% in experiments with some of the world's largest ontologies.

4 February 2010
Verified
Conference Paper
Open access
AGAlban Galland
Alban Galland
SASerge Abiteboul
Serge Abiteboul
AMAmélie Marian
Amélie Marian
PSPierre Senellart
Pierre Senellart

10 August 2015
Verified
Conference Paper
Open access
SLSiyu Lei
Siyu Lei
SMSilviu Maniu
Silviu Maniu
LMLuyi Mo
Luyi Mo
RCReynold Cheng
Reynold Cheng
PSPierre Senellart
Pierre Senellart
Social networks are commonly used for marketing purposes. For example, free samples of a product can be given to a few influential social network users (or seed nodes), with the hope that they will convince their friends to buy it. One way to formalize this objective is through the problem of influence maximization (or IM), whose goal is to find the best seed nodes to activate under a fixed budget, so that the number of people who get influenced in the end is maximized. Solutions to IM rely on the influence probability that a user influences another one. However, this probability information may be unavailable or incomplete. In this paper, we study IM in the absence of complete information on influence probability. We call this problem Online Influence Maximization (OIM), since we learn influence probabilities at the same time we run influence campaigns. To solve OIM, we propose a multiple-trial approach, where (1) some seed nodes are selected based on existing influence information; (2) an influence campaign is started with these seed nodes; and (3) user feedback is used to update influence information. We adopt Explore-Exploit strategies, which can select seed nodes using either the current influence probability estimation (exploit), or the confidence bound on the estimation (explore). Any existing IM algorithm can be used in this framework. We also develop an incremental algorithm that can significantly reduce the overhead of handling user feedback information. Our experiments show that our solution is more effective than traditional IM methods on the partial information.

18 May 2015
Verified
Conference Paper
Open access
CMChangping Meng
Changping Meng
RCReynold Cheng
Reynold Cheng
SMSilviu Maniu
Silviu Maniu
PSPierre Senellart
Pierre Senellart
WZWangda Zhang
Wangda Zhang
The Heterogeneous Information Network (HIN) is a graph data model in which nodes and edges are annotated with class and relationship labels. Large and complex datasets, such as Yago or DBLP, can be modeled as HINs. Recent work has studied how to make use of these rich information sources. In particular, meta-paths, which represent sequences of node classes and edge types between two nodes in a HIN, have been proposed for such tasks as information retrieval, decision making, and product recommendation. Current methods assume meta-paths are found by domain experts. However, in a large and complex HIN, retrieving meta-paths manually can be tedious and difficult. We thus study how to discover meta-paths automatically. Specifically, users are asked to provide example pairs of nodes that exhibit high proximity. We then investigate how to generate meta-paths that can best explain the relationship between these node pairs. Since this problem is computationally intractable, we propose a greedy algorithm to select the most relevant meta-paths. We also present a data structure to enable efficient execution of this algorithm. We further incorporate hierarchical relationships among node classes in our solutions. Extensive experiments on real-world HIN show that our approach captures important meta-paths in an efficient and scalable manner.

11 June 2007
Verified
Conference Paper
Open access
PDF file
PSPierre Senellart
Pierre Senellart
SASerge Abiteboul
Serge Abiteboul
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees where nodes are annotated with conjunctions of probabilistic event variables. We briefly described an implementation and scenarios of usage. We develop here a mathematical foundation for this model. In particular, we present complexity results. We identify a very large class of queries for which simple variations of querying and updating algorithms from [3] compute the correct answer. A main contribution is a full complexity analysis of queries and updates. We also exhibit a decision procedure for the equivalence of probabilistic trees and prove it is in co-RP. Furthermore, we study the issue of removing less probable possible worlds, and that of validating a probabilistic tree against a DTD. We show that these two problems are intractable in the most general case.