activity
20152022
most citedThe Social World of Content Abusers in Community Question Answering

64 citations · 256 across the 14 of their papers we have counts for

collaborators

24 papers

cs.CY202232 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.DS20229 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.SI20218 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.LG20211 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.SI202115 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…