2 citations · 4 across the 7 of their papers we have counts for
9 papers
An Efficient Streaming Algorithm for Approximating Graphlet Distributions
Marco Bressan, T-H. Hubert Chan, Qipeng Kuang +1
In recent years, the problem of computing the frequencies of the induced -vertex subgraphs of a graph, or \emph{-graphlets}, has become central. One approach for this problem…
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
Marco Bressan, Mauro Sozio
We give the first algorithm that maintains an approximate decision tree over an arbitrary sequence of insertions and deletions of labeled examples, with strong guarantees on the wo…
Fully-Dynamic Decision Trees
Marco Bressan, Gabriel Damay, Mauro Sozio
We develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples. Given our algorithm g…
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…
Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search
Rediet Abebe, T-H. Hubert Chan, Jon Kleinberg +4
A long line of work in social psychology has studied variations in people's susceptibility to persuasion -- the extent to which they are willing to modify their opinions on a topic…
EviDense: a Graph-based Method for Finding Unique High-impact Events with Succinct Keyword-based Descriptions
Oana Balalau, Carlos Castillo, Mauro Sozio
Despite the significant efforts made by the research community in recent years, automatically acquiring valuable information about high impact-events from social media remains chal…