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

Catherine Berrut

dblp:b/CBerrut · DBLP profile ↗
← Back
16ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

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

Databases, data management, data science and information retrieval · 13 · 4 first-authorArtificial intelligence and machine learning · 8 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
3 papers
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
logic-based retrieval models
0.212013
Is uncertain logical-matching equivalent to conditional probability? · SIGIR 2013
Information retrieval
retrieval models
0.212013
Is uncertain logical-matching equivalent to conditional probability? · SIGIR 2013
Information retrieval › retrieval models
probabilistic retrieval model
0.012013
Is uncertain logical-matching equivalent to conditional probability? · SIGIR 2013
Information retrieval › indexing
document indexing
0.021989
Indexing Medical Reports in a Multimedia Environment: The RIME Experimental Approach · SIGIR 1989
Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing · SIGIR 1986
Information retrieval
indexing
0.021989
Indexing Medical Reports in a Multimedia Environment: The RIME Experimental Approach · SIGIR 1989
Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing · SIGIR 1986
Information retrieval
multimedia analysis and retrieval
0.011989
Indexing Medical Reports in a Multimedia Environment: The RIME Experimental Approach · SIGIR 1989
Information retrieval › text analysis
parsing
0.011986
Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing · SIGIR 1986

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

propositional logic · 0.2lattice theory · 0.2degree of implication · 0.2linguistic analysis · 0.0conceptual language · 0.0syntactic networks · 0.0precedence matrix · 0.0
YearPublicationVenuePosition
2018 Advanced Text Mining Methods for Bilingual Lexicon Extraction from Speciliazed Comparable Corpora
Belhaj Rhouma Sourour, Cherif Chiraz Latiri, Catherine Berrut
CICLing (2)3
2018 Combining Bilingual Lexicons Extracted from Comparable Corpora: The Complementary Approach Between Word Embedding and Text Mining
Belhaj Rhouma Sourour, Cherif Chiraz Latiri, Catherine Berrut
DEXA (2)3
2018 Hybrid query expansion model for text and microblog information retrieval
Meriem Amina Zingla, Cherif Chiraz Latiri, Philippe Mulhem, Catherine Berrut, Yahya Slimani
Inf. Retr. J.4
2017 Logics, Lattices and Probability: The Missing Links to Information Retrieval
abstract
Logic-based information retrieval (IR) models represent the retrieval decision as an implication d→q between a document d and a query q, where d and q are logical sentences. However, d→q is generally a binary decision, thus we need a measurement to estimate the degree to which d implies q, denoted U(d→q)⁠. Most of the existing logic-based IR models either do not precisely define the implication d→q or use non-classical definitions. Some models also define the uncertainty U in informal ways. More importantly, they use two non-related frameworks to define d→q and its uncertainty U, even though the two notions are intrinsically related. The goal of this study is to propose a new logic-based IR model, which overcome these shortcomings. To this end, we first propose to replace the implication d→q by the validity of material implication⊨d⊃q⁠. Second, we redefine and adapt the mathematical relationship between logics, lattices and probability. Our new IR model presents a possible formalism for van Rijsbergen's intuition about replacing U(d→q) by P(q∣d)⁠.
Karam Abdulahhad, Jean-Pierre Chevallet, Catherine Berrut
Comput. J.3
2016 A Comparison of Deep Learning Based Query Expansion with Pseudo-Relevance Feedback and Mutual Information
Mohannad Almasri, Catherine Berrut, Jean-Pierre Chevallet
ECIR2
2015 Statistical and Semantic Approaches for Tweet Contextualization
abstract
Microblogging sites, like Twitter, have emerged as a popular platform for expressing opinions. Bound to 140 characters, Twitter's publications (tweets) are very short and not always written maintaining formal grammar and proper spelling. The spelling variations increase the likelihood of vocabulary mismatch and make the tweets difficult to understand without some kind of context. The task of tweet contextualization was organized around these issues. It aims to provide an automatic readable context explaining a given tweet, in order to help the reader understand this latter. In this paper, we describe statistical and semantic approaches for the tweet contextualization task. While the statistical one is based on association rules mining, the semantic one uses Wikipedia as an external knowledge source. The effectiveness of our approaches is proved through an experimental study conducted on the INEX 2013 collection.
Meriem Amina Zingla, Cherif Chiraz Latiri, Yahya Slimani, Catherine Berrut
KES4
2013 Revisiting the Term Frequency in Concept-Based IR Models
Karam Abdulahhad, Jean-Pierre Chevallet, Catherine Berrut
DEXA (1)3
2013 Is uncertain logical-matching equivalent to conditional probability?
abstract
Logic-based Information Retrieval (IR) models represent the retrieval decision as a logical implication d->q between a document d and a query q, where d and q are logical sentences. However, d->q is a binary decision, we thus need a measure to estimate the degree to which d implies q, denoted P(d->q). In this study, we revisit the Van Rijsbergen's assumptions about: 1- the logical implication ->' is not the material one, and 2- P(d->q) could be estimated by the conditional probability P(q|d). More precisely, we claim that the material implication is an appropriate implication for IR, and also we mathematically prove that replacing P(d->q) by P(q|d) is a correct choice. In order to prove the Van Rijsbergen's assumption, we use the Propositional Logic and the Lattice theory. We also exploit the notion of degree of implication that is proposed by Knuth.
Karam Abdulahhad, Jean-Pierre Chevallet, Catherine Berrut
SIGIR3
2012 The Effective Relevance Link between a Document and a Query
Karam Abdulahhad, Jean-Pierre Chevallet, Catherine Berrut
DEXA (1)3
2007 Incomplete and Fuzzy Conceptual Graphs to Automatically Index Medical Reports
Loïc Maisonnasse, Jean-Pierre Chevallet, Catherine Berrut
NLDB3
2007 Improving new user recommendations with rule-based induction on cold user data
abstract
With recommender systems, users receive items recommended on the basis of their profile. New users experience the cold start problem: as their profile is very poor, the system performs very poorly. In this paper, classical new user cold start techniques are improved by exploiting the cold user data, i.e. the user data that is readily available (e.g. age, occupation, location, etc.), in order to automatically associate the new user with a better first profile. Relying on the existing α-community spaces model, a rule-based induction process is used and a recommendation process based on the "level of agreement" principle is defined. The experiments show that the quality of recommendations compares to that obtained after a classical new user technique, while the new user effort is smaller as no initial ratings are asked.
An-Te Nguyen, Nathalie Denos, Catherine Berrut
RecSys3
2000 Patterns Retrieval System: A First Attempt
Catherine Berrut, Agnès Front
NLDB1
1997 An Image Retrieval System Based on the Visualization of System Relevance via Documents
Nathalie Denos, Catherine Berrut, Mourad Mechkour
DEXA2
1990 Indexing medical reports: The rime approach
Catherine Berrut
Inf. Process. Manag.1
1989 Indexing Medical Reports in a Multimedia Environment: The RIME Experimental Approach
abstract
This paper focuses on the RIME system aimed to the indexing of medical reports in a multimedia environment. This particular application is viewed as representative of a large set of still unanswered needs of large communities of users: domain experts dealing with on-line specialized documentation such as software engineers, medical specialists and so on. In this application textual information appears as an interesting media to access related pictures in the data base. After the presentation of the application and a study of the particular corpus involved we define a semantic model for the documents which is based on a Conceptual Language. Then we detail the indexing process and its various linguistic components which perform the translation of every medical report according to this semantic model.
Catherine Berrut, Yves Chiaramella
SIGIR1
1986 Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing
abstract
This paper describes linguistic tools specifically designed for performant automatic indexing of natural language texts. By performant indexing, we mean the ability of the system to extract noun phrases (considered as main conceptual frames regarding text content) without processing full syntactic analysis of sentences (surface analyzer) both with its ability in learning unknown words. The paper describes the overall principles of this parser, emphasizing the use of syntactic networks and precedence matrix to fulfil the above goals of reducing the analysis cost and infering new vocabularies without interrupting the indexing process.
Catherine Berrut, Patrick Palmer
SIGIR1