Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guillaume Pitel

dblp:78/2147 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 67% Information retrieval · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
evaluation
0.912025
Multilingual Evaluation of Main Content Extractors for Web Pages · SIGIR 2025
Data integration and cleaning › data extraction › web data extraction
main content extraction
0.912025
Multilingual Evaluation of Main Content Extractors for Web Pages · SIGIR 2025
Data integration and cleaning › data extraction
web data extraction
0.912025
Multilingual Evaluation of Main Content Extractors for Web Pages · SIGIR 2025

Methods — techniques the papers use, named apart from their topics

benchmark reproduction · 0.9
YearPublicationVenuePosition
2025 Multilingual Evaluation of Main Content Extractors for Web Pages
abstract
Tools designed to extract main content from web pages require thorough evaluation, yet existing benchmarks disproportionately focus on English-language datasets. Consequently, previous studies have shown that while these extractors are well-optimized for English, their effectiveness partially or entirely diminishes in other languages. This study reproduces and extends recent benchmarks by incorporating multilingual datasets as a key factor. We analyze extractor performance across five languages-Greek, English, Polish, Russian, and Chinese-highlighting the need to adapt extraction models to linguistic variations. Our results show that while some extractors maintain stable performance, others suffer significant drops in precision and recall on non-English or structurally irregular pages.
Aurélien Bournonville, Gaël Dias, Thomas Largillier, Emmanuel Marchand, Fabrice Maurel, Guillaume Pitel, François Rioult
SIGIR6
2023 Look back, look around: A systematic analysis of effective predictors for new outlinks in focused Web crawling
abstract
Small and medium enterprises rely on detailed Web analytics to be informed about their market and competition. Focused crawlers meet this demand by crawling and indexing specific parts of the Web. Critically, a focused crawler must quickly find new pages that have not yet been indexed. Since a new page can be discovered only by following a new outlink, predicting new outlinks is very relevant in practice. In the literature, many feature designs have been proposed for predicting changes in the Web. In this work we provide a structured analysis of this problem, using new outlinks as our running prediction target. Specifically, we unify earlier feature designs in a taxonomic arrangement of features along two dimensions: static versus dynamic features, and features of a page versus features of the network around it. Within this taxonomy, complemented by our new (mainly, dynamic network) features, we identify best predictors for new outlinks. Our main conclusion is that most informative features are the recent history of new outlinks on a page itself, and of its content-related pages. Hence, we propose a new ‘look back, look around’ (LBLA) model, that uses only these features. With the obtained predictions, we design a number of scoring functions to guide a focused crawler to pages with most new outlinks, and compare their performance. The LBLA approach proved extremely effective, outperforming other models including those that use a most complete set of features. One of the learners we use, is the recent NGBoost method that assumes a Poisson distribution for the number of new outlinks on a page, and learns its parameters. This connects the two so far unrelated avenues in the literature: predictions based on features of a page, and those based on probabilistic modeling. All experiments were carried out on an original dataset, made available by a commercial focused crawler.
Thi Kim Nhung Dang, Doina Bucur, Berk Atil, Guillaume Pitel, Frank Ruis, Hamid Reza Kadkhodaei, Nelly Litvak
Knowl. Based Syst.4
2008 Semi-automatic Building Method for a Multidimensional Affect Dictionary for a New Language
Guillaume Pitel, Gregory Grefenstette
LREC1
2006 A Deep-Parsing Approach to Natural Language Understanding in Dialogue System: Results of a Corpus-Based Evaluation
Alexandre Denis 0002, Matthieu Quignard, Guillaume Pitel
LREC3
2006 Fusion of children's speech and 2D gestures when conversing with 3D characters
Jean-Claude Martin, Stéphanie Buisine, Guillaume Pitel, Niels Ole Bernsen
Signal Process.3