Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) LaHDAK
Speeding up information extraction programs: a holistic optimizer and a learning-based approach to rank documents
Helena Galhardas

27 March 2015, 14h00 - 27 March 2015, 15h30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Gestion de données du Web

Résumé :
A wealth of information produced by individuals and organizations is expressed in natural language text. Text lacks the explicit structure that is necessary to support rich querying and analysis. Information extraction systems are sophisticated software tools to discover structured information in natural language text. Unfortunately, information extraction is a challenging and time-consuming task.

In this talk, I will first present our proposal to optimize information extraction programs. It consists of a holistic approach that focuses on: (i) optimizing all key aspects of the information extraction process collectively and in a coordinated manner, rather than focusing on individual subtasks in isolation; (ii) accurately predicting the execution time, recall, and precision for each information extraction execution plan; and (iii) using these predictions to choose the best execution plan to execute a given information extraction program.

Then, I will briefly present a principled, learning-based approach for ranking documents according to their potential usefulness for an extraction task. Our online learning-to-rank methods exploit the information collected during extraction, as we process new documents and the fine-grained characteristics of the useful documents are revealed. Then, these methods decide when the ranking model should be updated, hence significantly improving the document ranking quality over time.

This is joint work with Gonçalo Simões, INESC-ID and IST/University of Lisbon, and Pablo Barrio and Luis Gravano from Columbia University, NY.

Pour en savoir plus : http://web.ist.utl.pt/helena.galhardas/
Séminaires
The Domino Problem is undecidable on surface group
Combinatoire
Friday 27 September 2019 - 14h30
Salle : 445 - PCRI-N
Nathalie Aubrun .............................................

Scalable Load Balancing - Distributed Algorithms a
Algorithmique distribuée
Friday 20 September 2019 - 14h30
Salle : 445 - PCRI-N
Vinicius Marino Calvo Torres de Freitas .............................................

graph algorithms to help molecular construction
Théorie des graphes
Friday 07 June 2019 - 14h30
Salle : 445 - PCRI-N
Stefi Nouleho .............................................

Sur le nombre des (d,k)-polytopes
Combinatoire
Friday 24 May 2019 - 14h30
Salle : 455 - PCRI-N
Rado Rakotonarivo .............................................

Predicting the structure of RNA-binding protein re
Thursday 23 May 2019 - 00h00
Salle : 465 - PCRI-N
François Major .............................................