research
∙
08/28/2023
Rebalancing Social Feed to Minimize Polarization and Disagreement
Social media have great potential for enabling public discourse on impor...
share
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...
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...
research
∙
06/06/2023
Minimizing Hitting Time between Disparate Groups with Shortcut Edges
Structural bias or segregation of networks refers to situations where tw...
research
∙
06/05/2023
Reducing Exposure to Harmful Content via Graph Rewiring
Most media content consumed today is provided by digital platforms that ...
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...
research
∙
01/17/2023
Ranking with submodular functions on the fly
Maximizing submodular functions have been studied extensively for a wide...
research
∙
10/04/2022
Concise and interpretable multi-label rule sets
Multi-label classification is becoming increasingly ubiquitous, but not ...
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...
research
∙
08/23/2022
Regularized impurity reduction: Accurate decision trees with complexity guarantees
Decision trees are popular classification models, providing high accurac...
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...
research
∙
06/16/2022
Generalized Leverage Scores: Geometric Interpretation and Applications
In problems involving matrix computations, the concept of leverage has f...
research
∙
04/08/2022
Ranking with submodular functions on a budget
Submodular maximization has been the backbone of many important machine-...
research
∙
03/02/2022
Optimal deletion-robust coreset for submodular maximization
In recent years we have witnessed an increase on the development of meth...
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...
research
∙
10/07/2021
Workload-Aware Materialization of Junction Trees
Bayesian networks are popular probabilistic models that capture the cond...
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...
research
∙
02/28/2021
Discovering Dense Correlated Subgraphs in Dynamic Networks
Given a dynamic network, where edges appear and disappear over time, we ...
research
∙
10/16/2020
Restless reachability problems in temporal graphs
We study a family of reachability problems under waiting-time restrictio...
research
∙
07/08/2020
Mining Dense Subgraphs with Similar Edges
When searching for interesting structures in graphs, it is often importa...
research
∙
06/17/2020
Diverse Rule Sets
While machine-learning models are flourishing and transforming many aspe...
research
∙
01/26/2020
Improved mixing time for k-subgraph sampling
Understanding the local structure of a graph provides valuable insights ...
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, ...
research
∙
01/20/2020
Finding temporal patterns using algebraic fingerprints
In this paper we study a family of pattern-detection problems in vertex-...
research
∙
01/09/2020
Maximizing diversity over clustered data
Maximum diversity aims at selecting a diverse set of high-quality object...
research
∙
10/06/2019
Discovering Polarized Communities in Signed Networks
Signed networks contain edge annotations to indicate whether each intera...
research
∙
09/03/2019
Discovering Interesting Cycles in Directed Graphs
Cycles in graphs often signify interesting processes. For example, cycli...
research
∙
04/06/2019
Density-friendly Graph Decomposition
Decomposing a graph into a hierarchical structure via k-core analysis is...
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...
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...
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...
research
∙
02/04/2019
Discovering Nested Communities
Finding communities in graphs is one of the most well-studied problems i...
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...
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...
research
∙
09/02/2018
Mining Frequent Patterns in Evolving Graphs
Given a labeled graph, the frequent-subgraph mining (FSM) problem asks t...
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...
research
∙
05/18/2015
DopeLearning: A Computational Approach to Rap Lyrics Generation
Writing rap lyrics requires both creativity to construct a meaningful, i...
research
∙
06/30/2009
