activity
20142023
most citedMaximizing the Diversity of Exposure in a Social Network

26 citations · 57 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LG2023

ActUp: Analyzing and Consolidating tSNE and UMAP

Andrew Draganov, Jakob Rødsgaard Jørgensen, Katrine Scheel Nellemann +4

tSNE and UMAP are popular dimensionality reduction algorithms due to their speed and interpretable low-dimensional embeddings. Despite their popularity, however, little work has be…

cs.DB2021

Workload-Aware Materialization of Junction Trees

Martino Ciaperoni, Cigdem Aslay, Aristides Gionis +1

Bayesian networks are popular probabilistic models that capture the conditional dependencies among a set of variables. Inference in Bayesian networks is a fundamental task for answ…

cs.SI2021★ 8 cited

Learning Ideological Embeddings from Information Cascades

Corrado Monti, Giuseppe Manco, Cigdem Aslay +1

Modeling information cascades in a social network through the lenses of the ideological leaning of its users can help understanding phenomena such as misinformation propagation and…

cs.DS2021

Efficient and Effective Algorithms for Revenue Maximization in Social Advertising

Kai Han, Benwei Wu, Jing Tang +3

We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment…

cs.DS2019★ 6 cited

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…

cs.DB2019★ 1 cited

Query the model: precomputations for efficient inference with Bayesian Networks

Cigdem Aslay, Martino Ciaperoni, Aristides Gionis +1

Variable Elimination is a fundamental algorithm for probabilistic inference over Bayesian networks. In this paper, we propose a novel materialization method for Variable Eliminatio…

cs.DS2018★ 5 cited

Mining Frequent Patterns in Evolving Graphs

Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales +1

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the -vertex subgraphs that appear with frequency greater than a given threshold. FSM has numer…

cs.SI2018★ 1 cited

Robust Cascade Reconstruction by Steiner Tree Sampling

Han Xiao, Cigdem Aslay, Aristides Gionis

We consider a network where an infection cascade has taken place and a subset of infected nodes has been partially observed. Our goal is to reconstruct the underlying cascade that…

cs.SI2018★ 26 cited

Maximizing the Diversity of Exposure in a Social Network

Cigdem Aslay, Antonis Matakos, Esther Galbrun +1

Social-media platforms have created new ways for citizens to stay informed and participate in public debates. However, to enable a healthy environment for information sharing, soci…

cs.SI2016★ 1 cited

Revenue Maximization in Incentivized Social Advertising

Cigdem Aslay, Francesco Bonchi, Laks V. S. Lakshmanan +1

Incentivized social advertising, an emerging marketing model, provides monetization opportunities not only to the owners of the social networking platforms but also to their influe…

cs.SI2014★ 9 cited

Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret

Cigdem Aslay, Wei Lu, Francesco Bonchi +2

In this paper, we study the problem of allocating ads to users through the viral-marketing lens. Advertisers approach the host with a budget in return for the marketing campaign se…