activity
20102023
most citedFA*IR: A Fair Top-k Ranking Algorithm

485 citations · 1.2k across the 47 of their papers we have counts for

collaborators

54 papers

cs.SI2023★ 10 cited

Rebalancing Social Feed to Minimize Polarization and Disagreement

Federico Cinus, Aristides Gionis, Francesco Bonchi

Social media have great potential for enabling public discourse on important societal issues. However, adverse effects, such as polarization and echo chambers, greatly impact the b…

cs.DS2023

Hyper-distance Oracles in Hypergraphs

Giulia Preti, Gianmarco De Francisci Morales, Francesco Bonchi

We study point-to-point distance estimation in hypergraphs, where the query is parameterized by a positive integer s, which defines the required level of overlap for two hyperedges…

cs.DS2022

Balancing Utility and Fairness in Submodular Maximization (Technical Report)

Yanhao Wang, Yuchen Li, Francesco Bonchi +1

Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recomm…

cs.CY2022★ 32 cited

The language of opinion change on social media under the lens of communicative action

Corrado Monti, Luca Maria Aiello, Gianmarco De Francisci Morales +1

Which messages are more effective at inducing a change of opinion in the listener? We approach this question within the frame of Habermas' theory of communicative action, which pos…

cs.SI2022★ 1 cited

Cascade-based Echo Chamber Detection

Marco Minici, Federico Cinus, Corrado Monti +2

Despite echo chambers in social media have been under considerable scrutiny, general models for their detection and analysis are missing. In this work, we aim to fill this gap by p…

cs.LG2022★ 3 cited

Learning Multiscale Non-stationary Causal Structures

Gabriele D'Acunto, Gianmarco De Francisci Morales, Paolo Bajardi +1

This paper addresses a gap in the current state of the art by providing a solution for modeling causal relationships that evolve over time and occur at different time scales. Speci…

cs.SI2022

On the Relation Between Opinion Change and Information Consumption on Reddit

Flavio Petruzzellis, Corrado Monti, Gianmarco De Francisci Morales +1

While much attention has been devoted to the causes of opinion change, little is known about its consequences. Our study sheds a light on the relationship between one user's opinio…

physics.soc-ph2022

On learning agent-based models from data

Corrado Monti, Marco Pangallo, Gianmarco De Francisci Morales +1

Agent-Based Models (ABMs) are used in several fields to study the evolution of complex systems from micro-level assumptions. However, ABMs typically can not estimate agent-specific…

cs.CY2022★ 51 cited

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways

Francesco Fabbri, Yanhao Wang, Francesco Bonchi +2

Recommender systems typically suggest to users content similar to what they consumed in the past. If a user happens to be exposed to strongly polarized content, she might subsequen…

cs.DS2022★ 9 cited

FreSCo: Mining Frequent Patterns in Simplicial Complexes

Giulia Preti, Gianmarco De Francisci Morales, Francesco Bonchi

Simplicial complexes are a generalization of graphs that model higher-order relations. In this paper, we introduce simplicial patterns -- that we call simplets -- and generalize th…

cs.DS2021★ 18 cited

Multi-relation Graph Summarization

Xiangyu Ke, Arijit Khan, Francesco Bonchi

Graph summarization is beneficial in a wide range of applications, such as visualization, interactive and exploratory analysis, approximate query processing, reducing the on-disk s…

cs.SI2021★ 1 cited

Exposure Inequality in People Recommender Systems: The Long-Term Effects

Francesco Fabbri, Maria Luisa Croci, Francesco Bonchi +1

People recommender systems may affect the exposure that users receive in social networking platforms, influencing attention dynamics and potentially strengthening pre-existing ineq…

cs.SI2021

Dense and well-connected subgraph detection in dual networks

Tianyi Chen, Francesco Bonchi, David Garcia-Soriano +2

Dense subgraph discovery is a fundamental problem in graph mining with a wide range of applications \cite{gionis2015dense}. Despite a large number of applications ranging from comp…

math.GM2021

A Challenging 7-Fold Tiling Puzzle

Theo P. Schaad

A quasiperiodic 7-fold rhombic tiling is constructed with an iterative substitution scheme. The inflation factor is 5.04892..., the square of the longer diagonal of a regular hepta…

q-fin.ST2021★ 5 cited

The Evolving Causal Structure of Equity Risk Factors

Gabriele D'Acunto, Paolo Bajardi, Francesco Bonchi +1

In recent years, multi-factor strategies have gained increasing popularity in the financial industry, as they allow investors to have a better understanding of the risk drivers und…

cs.SI2021★ 8 cited

Learning Ideological Embeddings from Information Cascades

Corrado Monti, Giuseppe Manco, Cigdem Aslay +1

Modeling information cascades in a social network through the lenses of the ideological leaning of its users can help understanding phenomena such as misinformation propagation and…

cs.SI2021

Counterfactual Graphs for Explainable Classification of Brain Networks

Carlo Abrate, Francesco Bonchi

Training graph classifiers able to distinguish between healthy brains and dysfunctional ones, can help identifying substructures associated to specific cognitive phenotypes. Howeve…

cs.LG2021★ 1 cited

Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints

David Garcia-Soriano, Francesco Bonchi

We study a novel problem of fairness in ranking aimed at minimizing the amount of individual unfairness introduced when enforcing group-fairness constraints. Our proposal is rooted…

cs.SI2021★ 15 cited

STruD: Truss Decomposition of Simplicial Complexes

Giulia Preti, Gianmarco De Francisci Morales, Francesco Bonchi

A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a n…

cs.DS2020

Better Fewer but Better: Community Search with Outliers

Francesco Bonchi, Lorenzo Severini, Mauro Sozio

Given a set of vertices in a network, that we believe are of interest for the application under analysis, community search is the problem of producing a subgraph potentially explai…

cs.DS2020

Adaptive Community Search in Dynamic Networks

Ioanna Tsalouchidou, Francesco Bonchi, Ricardo Baeza-Yates

Community search is a well-studied problem which, given a static graph and a query set of vertices, requires to find a cohesive (or dense) subgraph containing the query vertices. I…

cs.DS2020★ 17 cited

Finding Densest -Connected Subgraphs

Francesco Bonchi, David García-Soriano, Atsushi Miyauchi +1

Dense subgraph discovery is an important graph-mining primitive with a variety of real-world applications. One of the most well-studied optimization problems for dense subgraph dis…

cs.SI2020

Explainable Classification of Brain Networks via Contrast Subgraphs

Tommaso Lanciano, Francesco Bonchi, Aristides Gionis

Mining human-brain networks to discover patterns that can be used to discriminate between healthy individuals and patients affected by some neurological disorder, is a fundamental…

cs.SI2020★ 26 cited

Learning Opinion Dynamics From Social Traces

Corrado Monti, Gianmarco De Francisci Morales, Francesco Bonchi

Opinion dynamics - the research field dealing with how people's opinions form and evolve in a social context - traditionally uses agent-based models to validate the implications of…