Aristides Gionis

research

∙ 08/28/2023

Rebalancing Social Feed to Minimize Polarization and Disagreement

Social media have great potential for enabling public discourse on impor...

0 Federico Cinus, et al. ∙

research

∙ 07/06/2023

Finding Favourite Tuples on Data Streams with Provably Few Comparisons

One of the most fundamental tasks in data science is to assist a user wi...

0 Guangyi Zhang, et al. ∙

research

∙ 06/17/2023

Adversaries with Limited Information in the Friedkin–Johnsen Model

In recent years, online social networks have been the target of adversar...

0 Sijing Tu, et al. ∙

research

∙ 06/06/2023

Minimizing Hitting Time between Disparate Groups with Shortcut Edges

Structural bias or segregation of networks refers to situations where tw...

0 Florian Adriaens, et al. ∙

research

∙ 06/05/2023

Reducing Exposure to Harmful Content via Graph Rewiring

Most media content consumed today is provided by digital platforms that ...

0 Corinna Coupette, et al. ∙

research

∙ 04/20/2023

Learning Cellular Coverage from Real Network Configurations using GNNs

Cellular coverage quality estimation has been a critical task for self-o...

10 Yifei Jin, et al. ∙

research

∙ 01/17/2023

Ranking with submodular functions on the fly

Maximizing submodular functions have been studied extensively for a wide...

0 Guangyi Zhang, et al. ∙

research

∙ 10/04/2022

Concise and interpretable multi-label rule sets

Multi-label classification is becoming increasingly ubiquitous, but not ...

24 Martino Ciaperoni, et al. ∙

research

∙ 09/01/2022

Diameter Minimization by Shortcutting with Degree Constraints

We consider the problem of adding a fixed number of new edges to an undi...

0 Florian Adriaens, et al. ∙

research

∙ 08/23/2022

Regularized impurity reduction: Accurate decision trees with complexity guarantees

Decision trees are popular classification models, providing high accurac...

19 Guangyi Zhang, et al. ∙

research

∙ 07/08/2022

Open World Learning Graph Convolution for Latency Estimation in Routing Networks

Accurate routing network status estimation is a key component in Softwar...

0 Yifei Jin, et al. ∙

research

∙ 06/16/2022

Generalized Leverage Scores: Geometric Interpretation and Applications

In problems involving matrix computations, the concept of leverage has f...

0 Bruno Ordozgoiti, et al. ∙

research

∙ 04/08/2022

Ranking with submodular functions on a budget

Submodular maximization has been the backbone of many important machine-...

0 Guangyi Zhang, et al. ∙

research

∙ 03/02/2022

Optimal deletion-robust coreset for submodular maximization

In recent years we have witnessed an increase on the development of meth...

0 Guangyi Zhang, et al. ∙

research

∙ 02/16/2022

Improved analysis of randomized SVD for top-eigenvector approximation

Computing the top eigenvectors of a matrix is a problem of fundamental i...

0 Ruo-Chun Tzeng, et al. ∙

research

∙ 10/07/2021

Workload-Aware Materialization of Junction Trees

Bayesian networks are popular probabilistic models that capture the cond...

0 Martino Ciaperoni, et al. ∙

research

∙ 06/22/2021

Diversity-aware k-median : Clustering with fair center representation

We introduce a novel problem for diversity-aware clustering. We assume t...

0 Suhas Thejaswi, et al. ∙

research

∙ 02/28/2021

Discovering Dense Correlated Subgraphs in Dynamic Networks

Given a dynamic network, where edges appear and disappear over time, we ...

0 Giulia Preti, et al. ∙

research

∙ 10/16/2020

Restless reachability problems in temporal graphs

We study a family of reachability problems under waiting-time restrictio...

0 Suhas Thejaswi, et al. ∙

research

∙ 07/08/2020

Mining Dense Subgraphs with Similar Edges

When searching for interesting structures in graphs, it is often importa...

0 Polina Rozenshtein, et al. ∙

research

∙ 06/17/2020

Diverse Rule Sets

While machine-learning models are flourishing and transforming many aspe...

0 Guangyi Zhang, et al. ∙

research

∙ 01/26/2020

Improved mixing time for k-subgraph sampling

Understanding the local structure of a graph provides valuable insights ...

0 Ryuta Matsuno, et al. ∙

research

∙ 01/26/2020

Searching for polarization in signed graphs: a local spectral approach

Signed graphs have been used to model interactions in social net-works, ...

0 Han Xiao, et al. ∙

research

∙ 01/20/2020

Finding temporal patterns using algebraic fingerprints

In this paper we study a family of pattern-detection problems in vertex-...

0 Suhas Thejaswi, et al. ∙

research

∙ 01/09/2020

Maximizing diversity over clustered data

Maximum diversity aims at selecting a diverse set of high-quality object...

0 Guangyi Zhang, et al. ∙

research

∙ 10/06/2019

Discovering Polarized Communities in Signed Networks

Signed networks contain edge annotations to indicate whether each intera...

0 Francesco Bonchi, et al. ∙

research

∙ 09/03/2019

Discovering Interesting Cycles in Directed Graphs

Cycles in graphs often signify interesting processes. For example, cycli...

0 Florian Adriaens, et al. ∙

research

∙ 04/06/2019

Density-friendly Graph Decomposition

Decomposing a graph into a hierarchical structure via k-core analysis is...

0 Nikolaj Tatti, et al. ∙

research

∙ 03/29/2019

Query the model: precomputations for efficient inference with Bayesian Networks

We consider a setting where a Bayesian network has been built over a rel...

0 Cigdem Aslay, et al. ∙

research

∙ 02/27/2019

Reconciliation k-median: Clustering with Non-Polarized Representatives

We propose a new variant of the k-median problem, where the objective fu...

0 Bruno Ordozgoiti, et al. ∙

research

∙ 02/05/2019

Inferring the strength of social ties: a community-driven approach

Online social networks are growing and becoming denser. The social conne...

0 Polina Rozenshtein, et al. ∙

research

∙ 02/04/2019

Discovering Nested Communities

Finding communities in graphs is one of the most well-studied problems i...

0 Nikolaj Tatti, et al. ∙

research

∙ 02/04/2019

What is the dimension of your binary data?

Many 0/1 datasets have a very large number of variables; on the other ha...

24 Nikolaj Tatti, et al. ∙

research

∙ 09/13/2018

Explainable time series tweaking via irreversible and reversible temporal transformations

Time series classification has received great attention over the past de...

0 Isak Karlsson, et al. ∙

research

∙ 09/02/2018

Mining Frequent Patterns in Evolving Graphs

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks t...

0 Cigdem Aslay, et al. ∙

research

∙ 08/28/2018

Finding events in temporal networks: Segmentation meets densest-subgraph discovery

In this paper we study the problem of discovering a timeline of events i...

0 Polina Rozenshtein, et al. ∙

research

∙ 05/18/2015

DopeLearning: A Computational Approach to Rap Lyrics Generation

Writing rap lyrics requires both creativity to construct a meaningful, i...

0 Eric Malmi, et al. ∙

research

∙ 06/30/2009

Query Significance in Databases via Randomizations

Many sorts of structured data are commonly stored in a multi-relational ...

0 Markus Ojala, et al. ∙

Aristides Gionis

Featured Co-authors