8 citations · 8 across the 3 of their papers we have counts for
7 papers
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…
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…
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…
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…
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…
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…