关注
Cigdem Aslay
Cigdem Aslay
在 cs.au.dk 的电子邮件经过验证
标题
引用次数
引用次数
年份
Online Topic-aware Influence Maximization Queries.
C Aslay, N Barbieri, F Bonchi, R Baeza-Yates
EDBT, 295-306, 2014
1192014
Viral marketing meets social advertising: Ad allocation with minimum regret
C Aslay, W Lu, F Bonchi, A Goyal, LVS Lakshmanan
Proceedings of the VLDB Endowment 8 (7), 822-833, 2015
732015
Competition-based networks for expert finding
Ç Aslay, N O'Hare, LM Aiello, A Jaimes
Proceedings of the 36th international ACM SIGIR conference on Research and …, 2013
572013
Influence maximization in online social networks
C Aslay, LVS Lakshmanan, W Lu, X Xiao
Proceedings of the eleventh ACM international conference on web search and …, 2018
562018
Revenue Maximization in Incentivized Social Advertising
C Aslay, F Bonchi, LVS Lakshmanan, W Lu
Proceedings of the VLDB Endowment 10 (11), 1238-1249, 2017
512017
Mining frequent patterns in evolving graphs
Ç Aslay, MAU Nasir, G De Francisci Morales, A Gionis
Proceedings of the 27th ACM International Conference on Information and …, 2018
332018
Maximizing the diversity of exposure in a social network
C Aslay, A Matakos, E Galbrun, A Gionis
2018 IEEE international conference on data mining (ICDM), 863-868, 2018
312018
Maximizing the diversity of exposure in a social network
A Matakos, C Aslay, E Galbrun, A Gionis
IEEE Transactions on Knowledge and Data Engineering 34 (9), 4357-4370, 2020
302020
Co-exposure maximization in online social networks
S Tu, C Aslay, A Gionis
Advances in Neural Information Processing Systems 33, 3232-3243, 2020
182020
Querying intimate-core groups in weighted graphs
D Zheng, J Liu, RH Li, C Aslay, YC Chen, X Huang
2017 IEEE 11th International Conference on Semantic Computing (ICSC), 156-163, 2017
162017
Robust cascade reconstruction by steiner tree sampling
H Xiao, C Aslay, A Gionis
2018 IEEE International Conference on Data Mining (ICDM), 637-646, 2018
122018
TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs
MAU Nasir, C Aslay, GDF Morales, M Riondato
ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (3), 1-35, 2021
112021
Efficient and effective algorithms for revenue maximization in social advertising
K Han, B Wu, J Tang, S Cui, C Aslay, LVS Lakshmanan
Proceedings of the 2021 international conference on management of data, 671-684, 2021
92021
Learning ideological embeddings from information cascades
C Monti, G Manco, C Aslay, F Bonchi
Proceedings of the 30th ACM International Conference on Information …, 2021
82021
Discovering Interesting Cycles in Directed Graphs
F Adriaens, C Aslay, T De Bie, A Gionis, J Lijffijt
Proceedings of the 28th ACM International Conference on Information and …, 2019
72019
Actup: Analyzing and consolidating tsne and umap
A Draganov, JR Jørgensen, KS Nellemann, D Mottin, I Assent, T Berry, ...
arXiv preprint arXiv:2305.07320, 2023
62023
Query the model: precomputations for efficient inference with Bayesian Networks
C Aslay, A Gionis, M Mathioudakis
arXiv preprint arXiv:1904.00079, 2019
22019
Workload-Aware Materialization of Junction Trees
M Ciaperoni, C Aslay, A Gionis, M Mathioudakis
arXiv preprint arXiv:2110.03475, 2021
12021
Workload-aware materialization for efficient variable elimination on Bayesian networks
C Aslay, M Ciaperoni, A Gionis, M Mathioudakis
2021 IEEE 37th International Conference on Data Engineering (ICDE), 1152-1163, 2021
12021
TipTap: Approximate Mining of Frequent 𝑘-Subgraph Patterns in Evolving Graphs
MAU NASIR, C ASLAY, GDEF MORALES, M RIONDATO
2020
系统目前无法执行此操作,请稍后再试。
文章 1–20