79 citations · 541 across the 84 of their papers we have counts for
5 papers · 2 filters
Discovering Polarized Communities in Signed Networks
Francesco Bonchi, Edoardo Galimberti, Aristides Gionis +2
Signed networks contain edge annotations to indicate whether each interaction is friendly (positive edge) or antagonistic (negative edge). The model is simple but powerful and it c…
Discovering Interesting Cycles in Directed Graphs
Florian Adriaens, Cigdem Aslay, Tijl De Bie +2
Cycles in graphs often signify interesting processes. For example, cyclic trading patterns can indicate inefficiencies or economic dependencies in trade networks, cycles in food we…
Inferring the strength of social ties: a community-driven approach
Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis
Online social networks are growing and becoming denser. The social connections of a given person may have very high variability: from close friends and relatives to acquaintances t…
Discovering Nested Communities
Nikolaj Tatti, Aristides Gionis
Finding communities in graphs is one of the most well-studied problems in data mining and social-network analysis. In many real applications, the underlying graph does not have a c…
Reconciliation k-median: Clustering with Non-Polarized Representatives
Bruno Ordozgoiti, Aristides Gionis
We propose a new variant of the k-median problem, where the objective function models not only the cost of assigning data points to cluster representatives, but also a penalty term…