Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) BD
Social-aware search: instance optimality versus efficiency
Bogdan Cautis

29 March 2013, 14h00 - 29 March 2013, 15h30
Salle/Bat : 445/PCRI-N
Contact : jesus.camacho-rodriguez@lri.fr

Activités de recherche :

Résumé :
We present in this talk our recent research on top-k query answering in social applications.

This problem requires a significant departure from socially agnostic techniques for information retrieval. One can now exploit the social links in order to obtain more relevant results, valid not only with respected to the keyword query but also with respect to the social context of the user who issued it. We propose a sound and complete algorithm, called TOPKS, which addresses important applicability issues of existing techniques. Moreover, we show that TOPKS is instance optimal in the case when the search relies exclusively on the social weight of the data. To further address the efficiency needs of online applications, for which the exact search, albeit optimal, may still be expensive, we also consider approximate algorithms. These rely on concise statistics about the social network or on approximate shortest-paths computations.

As a complementary direction for efficient, online answering, we also consider the materialization and exploitation of previous query results (views). We study social-aware query optimization based on views, presenting algorithms that address two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle this uncertainty. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results.

Extensive experiments on both synthetic and real-world data (from Delicious and Twitter) show that our techniques have the potential to scale and meet the requirements of real applications. They have been recently demonstrated in a prototype social-aware search called Taagle.

This is joint work with Silviu Maniu (now at Hong Kong University).

Pour en savoir plus :
Séminaires
Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................

Caractérisation de réseaux égocentrés par l'énumér
Friday 15 June 2018 - 14h30
Salle : 455 - PCRI-N
Raphaël Charbey .............................................

DATA VERACITY ASSESSMENT: HOW A-PRIORI KNOWLEDGE E
Intégration de données et de connaissances
Friday 15 June 2018 - 14h00
Salle : 445 - PCRI-N
Valentina Beretta .............................................

Model Based Software and Data Integration (MBSDI)
Intégration de données et de connaissances
Tuesday 05 June 2018 - 15h00
Salle : 435 - PCRI-N
Dr. Ralf-Detlef Kutsche .............................................