Marco Bressan
YOU?
Author Swipe
View article: Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs Open
notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph halfspaces defin…
View article: On Finding Randomly Planted Cliques in Arbitrary Graphs
On Finding Randomly Planted Cliques in Arbitrary Graphs Open
We study a planted clique model introduced by Feige [Uriel Feige, 2021] where a complete graph of size c⋅ n is planted uniformly at random in an arbitrary n-vertex graph. We give a simple deterministic algorithm that, in almost linear time…
View article: Of Dice and Games: A Theory of Generalized Boosting
Of Dice and Games: A Theory of Generalized Boosting Open
Cost-sensitive loss functions are crucial in many real-world prediction problems, where different types of errors are penalized differently; for example, in medical diagnosis, a false negative prediction can lead to worse consequences than…
View article: Spare Time Activity Sheets from Photo Albums
Spare Time Activity Sheets from Photo Albums Open
Given arbitrary pictures, we explore the possibility of using new techniques from computer vision and artificial intelligence to create customized visual games on-the-fly. This includes coloring books, link-the-dot and spot-the-difference …
View article: Counting Subgraphs in Somewhere Dense Graphs
Counting Subgraphs in Somewhere Dense Graphs Open
We study the problems of counting copies and induced copies of a small pattern graph H in a large host graph G. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns H. In this w…
View article: Cooperative learning reduces the gender gap in perceived social competences: A large-scale nationwide longitudinal experiment.
Cooperative learning reduces the gender gap in perceived social competences: A large-scale nationwide longitudinal experiment. Open
International audience
View article: A Theory of Interpretable Approximations
A Theory of Interpretable Approximations Open
Can a deep neural network be approximated by a small decision tree based on simple features? This question and its variants are behind the growing demand for machine learning models that are *interpretable* by humans. In this work we study…
View article: Does the Jigsaw method improve motivation and self-regulation in vocational high schools?
Does the Jigsaw method improve motivation and self-regulation in vocational high schools? Open
International audience
View article: Preliminary Study on Pulse Wave Changes in Patients with Inflammatory Arthropathies Treated with bDMARDs
Preliminary Study on Pulse Wave Changes in Patients with Inflammatory Arthropathies Treated with bDMARDs Open
Background: Patients with inflammatory arthropathies exhibit an increased cardiovascular disease (CVD) risk as compared to the general population, which is not fully quantified by the conventional CVD risk scores. Biotechnological disease-…
View article: Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs Open
We study the problem of learning a binary classifier on the vertices of a graph. In particular, we consider classifiers given by monophonic halfspaces, partitions of the vertices that are convex in a certain abstract sense. Monophonic half…
View article: Sublinear Algorithms for Local Graph-Centrality Estimation
Sublinear Algorithms for Local Graph-Centrality Estimation Open
We study the complexity of local graph-centrality estimation, with the goal of approximating the centrality score of a given target node while exploring only a sublinear number of nodes/arcs of the graph and performing a sublinear number o…
View article: Fully-Dynamic Decision Trees
Fully-Dynamic Decision Trees Open
We develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples. Given ε>0 our algorithm guarantees that, at every point in time, every node of the deci…
View article: Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs Open
We study the following problem: Given an integer k ≥ 3 and a simple graph G , sample a connected induced k -vertex subgraph of G uniformly at random. This is a fundamental graph mining primitive with applications in social network analysis…
View article: Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees Open
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 worst-case running time per update request. For instance, we …
View article: Counting Subgraphs in Somewhere Dense Graphs
Counting Subgraphs in Somewhere Dense Graphs Open
We study the problems of counting copies and induced copies of a small pattern graph H in a large host graph G. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns H. In this w…
View article: Case study of structural reinforcement of a masonry building
Case study of structural reinforcement of a masonry building Open
G&P Intech presents a structural reinforcement intervention - case history - carried out on a nineteenth-century villa made of untidy stone masonry located in the municipality of Montecchio Maggiore (VI), Italy. In particular, in order to …
View article: Fully-Dynamic Decision Trees
Fully-Dynamic Decision Trees Open
We develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples. Given $ε> 0$ our algorithm guarantees that, at every point in time, every node of the d…
View article: The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree Open
We study the fixed-parameter tractability of the following fundamental problem: given two directed graphs $\vec H$ and $\vec G$, count the number of copies of $\vec H$ in $\vec G$. The standard setting, where the tractability is well under…
View article: Active Learning of Classifiers with Label and Seed Queries
Active Learning of Classifiers with Label and Seed Queries Open
We study exact active learning of binary and multiclass classifiers with margin. Given an $n$-point set $X \subset \mathbb{R}^m$, we want to learn any unknown classifier on $X$ whose classes have finite strong convex hull margin, a new not…
View article: Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies Open
We study the problems of counting the homomorphisms, the copies, and the induced copies of a $k$ -vertex graph $H$ in a $d$ -degenerate $n$ -vertex graph $G$ . By leveraging a new family of graph-minor obstructions called F-gadgets, we est…
View article: Socio-Emotional Competencies and School Performance in Adolescence: What Role for School Adjustment?
Socio-Emotional Competencies and School Performance in Adolescence: What Role for School Adjustment? Open
There is growing evidence in the literature of positive relationships between socio-emotional competencies and school performance. Several hypotheses have been used to explain how these variables may be related to school performance. In th…
View article: Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries Open
We investigate the problem of exact recovery using oracle queries.
Previous results show that clusters in Euclidean spaces that are convex and separated with a margin can be reconstructed exactly using only $O(\log n)$ same-cluster querie…
View article: Efficient and near-optimal algorithms for sampling connected subgraphs
Efficient and near-optimal algorithms for sampling connected subgraphs Open
We study the graphlet sampling problem: given an integer $k \ge 3$ and a simple graph $G=(V,E)$, sample a connected induced $k$-node subgraph of $G$ (also called $k$-graphlet) uniformly at random. This is a fundamental graph mining primiti…
View article: On Margin-Based Cluster Recovery with Oracle Queries
On Margin-Based Cluster Recovery with Oracle Queries Open
We study an active cluster recovery problem where, given a set of $n$ points and an oracle answering queries like "are these two points in the same cluster?", the task is to recover exactly all clusters using as few queries as possible. We…
View article: Motif Counting Beyond Five Nodes
Motif Counting Beyond Five Nodes Open
This is the preprint version of an ACM TKDD paper, https://doi.org/10.1145/3186586.
View article: Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications.
Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. Open
We study the problems of counting the homomorphisms, counting the copies, and counting the induced copies of a $k$-vertex graph $H$ in a $d$-degenerate $n$-vertex graph $G$. Our main result establishes exhaustive and explicit complexity cl…
View article: Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies Open
We study the problems of counting the homomorphisms, counting the copies, and counting the induced copies of a $k$-vertex graph $H$ in a $d$-degenerate $n$-vertex graph $G$. Our main result establishes exhaustive and explicit complexity cl…
View article: Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries Open
We investigate the problem of exact cluster recovery using oracle queries. Previous results show that clusters in Euclidean spaces that are convex and separated with a margin can be reconstructed exactly using only $O(\log n)$ same-cluster…
View article: Efficient and near-optimal algorithms for sampling small connected subgraphs
Efficient and near-optimal algorithms for sampling small connected subgraphs Open
We study the following problem: given an integer $k \ge 3$ and a simple graph $G$, sample a connected induced $k$-node subgraph of $G$ uniformly at random. This is a fundamental graph mining primitive with applications in social network an…