ABArmelle Brun

Armelle Brun

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Armelle Brun has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Shift your Focus for the Greater Good: Improving Fairness at no cost for Accuracy and Diversity in News Recommender Systems

    by Célina Treuillier, Sylvain Castagnos, Evan Dufraisse, Özlem Özgöbek, Armelle Brun

    In today’s digital landscape, recommender systems assist users in navigating the vast amount of available data. Within the realm of information access, a subset of such systems called News Recommender Systems help users find news content that interests them. However, by prioritizing traditional accuracy-focused optimization, these systems contribute to the formation of filter bubbles, restricting users’ exposure to diverse viewpoints and exacerbating polarization. To address this issue, beyond-accuracy factors like diversity have been integrated into recommendation. Yet, such approaches can be ineffective and even unintentionally influence user opinions. This raises major ethical concerns as systems lack the legitimacy to shape opinions. This article presents the ADF framework, a novel approach designed to optimize accuracy, diversity, and fairness simultaneously. Unlike conventional models that manage fairness in a tradeoff, ADF establishes fairness as a core constraint. The framework relies on an innovative fairness-constrained diversification strategy, ensuring that users are exposed to a broader range of opinions, without being oriented toward specific viewpoints. ADF is adaptable to various diversity metrics and provides personalized diversification, independent of the underlying recommendation algorithms. Through real-world benchmark datasets and multiple recommendation models, experimental evaluation confirmed that ADF limits the impact on accuracy, enhances diversity, and crucially upholds fairness.


  • Open Access

    Combining Objective and Subjective Perspectives for Political News Understanding

    by Evan Dufraisse, Adrian Popescu, Julien Tourille, Armelle Brun, Olivier Hamon

    Researchers and practitioners interested in computational politics rely on automatic content analysis tools to make sense of the large amount of political texts available on the Web. Such tools should provide objective and subjective aspects at different granularity levels to make the analyses useful in practice. Existing methods produce interesting insights for objective aspects, but are limited for subjective ones, are often limited to national contexts, and have limited explainability. We introduce a text analysis framework which integrates both perspectives and provides a fine-grained processing of subjective aspects. Information retrieval techniques and knowledge bases complement powerful natural language processing components to allow a flexible aggregation of results at different granularity levels. Importantly, the proposed bottom-up approach facilitates the explainability of the obtained results. We illustrate its functioning with insights on news outlets, political orientations, topics, individual entities, and demographic segments. The approach is instantiated on a large corpus of French news, but is designed to work seamlessly for other languages and countries.

  • Open Access

    Beyond Trade-offs: Unveiling Fairness-Constrained Diversity in News Recommender Systems

    by Célina Treuillier, Sylvain Castagnos, Özlem Özgöbek, Armelle Brun

    Recommender Systems have played an important role in our daily lives for many years. However, it is only recently that their social impact has raised ethical issues and has thus been considered in the design of such systems. Particularly, News Recommender Systems (NRS) have a critical influence on individuals. NRS can provide overspecialized recommendations and enclose users into filter bubbles. Besides, NRS can influence users and make their original opinions diverge. Worse, they can orient users’ opinions towards more radical views. The literature has worked on these issues by leveraging diversity and fairness in the recommendation algorithms, but generally only one of these dimensions at a time. We propose to consider both diversity and fairness simultaneously to provide recommendations that are fair, diverse, and obviously accurate. To this end, we propose a novel recommendation framework, Accuracy-Diversity-Fairness (ADF), which considers that fairness is not at the expense of diversity. Concretely, fairness is approached as a constraint on diversity. Experiments highlight that constraining diversity by fairness remarkably contributes to providing recommendations 5 times more diverse than models of the literature, without any loss in accuracy.


  • Do Similar Entities Have Similar Embeddings?

    by Nicolas Hubert, Heiko Paulheim, Armelle Brun, Davy Monticolo


  • PyGraft: Configurable Generation of Synthetic Schemas and Knowledge Graphs at Your Fingertips

    by Nicolas Hubert, Pierre Monnin, Mathieu D’aQuin, Davy Monticolo, Armelle Brun


  • Open Access

    All Polarized but Still Different: a Multi-factorial Metric to Discriminate between Polarization Behaviors on Social Media

    by Celina Treuillier, Sylvain Castagnos, Armelle Brun

    Online polarization has attracted the attention of researchers for many years. Its effects on society are a cause for concern, and the design of personalized depolarization strategies appears to be a key solution. Such strategies should rely on a fine and accurate measurement, and a clear understanding of polarization behaviors. However, the literature still lacks ways to characterize them finely. We propose GRAIL, the first individual polarization metric, relying on multiple factors. GRAIL assesses these factors through entropy and is based on an adaptable Generalized Additive Model. We evaluate the proposed metric on a Twitter dataset related to the highly controversial debate about the COVID-19 vaccine. Experiments confirm the ability of GRAIL to discriminate between polarization behaviors. To go further, we provide a finer characterization and explanation of the identified behaviors through an innovative evaluation framework.


  • Open Access

    Do Similar Entities have Similar Embeddings?

    by Nicolas Hubert, Heiko Paulheim, Armelle Brun, Davy Monticolo

    Knowledge graph embedding models (KGEMs) developed for link prediction learn vector representations for entities in a knowledge graph, known as embeddings. A common tacit assumption is the KGE entity similarity assumption, which states that these KGEMs retain the graph's structure within their embedding space, \textit{i.e.}, position similar entities within the graph close to one another. This desirable property make KGEMs widely used in downstream tasks such as recommender systems or drug repurposing. Yet, the relation of entity similarity and similarity in the embedding space has rarely been formally evaluated. Typically, KGEMs are assessed based on their sole link prediction capabilities, using ranked-based metrics such as Hits@K or Mean Rank. This paper challenges the prevailing assumption that entity similarity in the graph is inherently mirrored in the embedding space. Therefore, we conduct extensive experiments to measure the capability of KGEMs to cluster similar entities together, and investigate the nature of the underlying factors. Moreover, we study if different KGEMs expose a different notion of similarity. Datasets, pre-trained embeddings and code are available at: https://github.com/nicolas-hbt/similar-embeddings/.

  • Open Access

    Treat Different Negatives Differently: Enriching Loss Functions with Domain and Range Constraints for Link Prediction

    by Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo

    Knowledge graph embedding models (KGEMs) are used for various tasks related to knowledge graphs (KGs), including link prediction. They are trained with loss functions that consider batches of true and false triples. However, different kinds of false triples exist and recent works suggest that they should not be valued equally, leading to specific negative sampling procedures. In line with this recent assumption, we posit that negative triples that are semantically valid w.r.t. signatures of relations (domain and range) are high-quality negatives. Hence, we enrich the three main loss functions for link prediction such that all kinds of negatives are sampled but treated differently based on their semantic validity. In an extensive and controlled experimental setting, we show that the proposed loss functions systematically provide satisfying results which demonstrates both the generality and superiority of our proposed approach. In fact, the proposed loss functions (1) lead to better MRR and Hits@10 values, and (2) drive KGEMs towards better semantic correctness as measured by the Sem@K metric. This highlights that relation signatures globally improve KGEMs, and thus should be incorporated into loss functions. Domains and ranges of relations being largely available in schema-defined KGs, this makes our approach both beneficial and widely usable in practice.


  • Open Access

    Sem@$K$: Is my knowledge graph embedding model semantic-aware?

    by Nicolas Hubert, Pierre Monnin, Armelle Brun, Davy Monticolo

    Using knowledge graph embedding models (KGEMs) is a popular approach for predicting links in knowledge graphs (KGs). Traditionally, the performance of KGEMs for link prediction is assessed using rank-based metrics, which evaluate their ability to give high scores to ground-truth entities. However, the literature claims that the KGEM evaluation procedure would benefit from adding supplementary dimensions to assess. That is why, in this paper, we extend our previously introduced metric Sem@K that measures the capability of models to predict valid entities w.r.t. domain and range constraints. In particular, we consider a broad range of KGs and take their respective characteristics into account to propose different versions of Sem@K. We also perform an extensive study to qualify the abilities of KGEMs as measured by our metric. Our experiments show that Sem@K provides a new perspective on KGEM quality. Its joint analysis with rank-based metrics offers different conclusions on the predictive power of models. Regarding Sem@K, some KGEMs are inherently better than others, but this semantic superiority is not indicative of their performance w.r.t. rank-based metrics. In this work, we generalize conclusions about the relative performance of KGEMs w.r.t. rank-based and semantic-oriented metrics at the level of families of models. The joint analysis of the aforementioned metrics gives more insight into the peculiarities of each model. This work paves the way for a more comprehensive evaluation of KGEM adequacy for specific downstream tasks.