Follow
Florian Adriaens
Florian Adriaens
Verified email at kth.se
Title
Cited by
Cited by
Year
Subjectively interesting connecting trees
F Adriaens, J Lijffijt, TD Bie
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2017
102017
Subjectively interesting connecting trees and forests
F Adriaens, J Lijffijt, T De Bie
Data Mining and Knowledge Discovery 33 (4), 1088-1124, 2019
92019
Relaxing the strong triadic closure problem for edge strength inference
F Adriaens, T De Bie, A Gionis, J Lijffijt, A Matakos, P Rozenshtein
Data Mining and Knowledge Discovery 34 (3), 611-651, 2020
4*2020
Block-Approximated Exponential Random Graphs
F Adriaens, A Mara, J Lijffijt, T De Bie
2020 IEEE 7th International Conference on Data Science and Advanced …, 2020
4*2020
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
42019
Diameter Minimization by Shortcutting with Degree Constraints
F Adriaens, A Gionis
arXiv preprint arXiv:2209.00370, 2022
2022
Improved analysis of randomized SVD for top-eigenvector approximation
RC Tzeng, PA Wang, F Adriaens, A Gionis, CJ Lu
International Conference on Artificial Intelligence and Statistics, 2045-2072, 2022
2022
Testing properties of signed graphs
F Adriaens, S Apers
arXiv preprint arXiv:2102.07587, 2021
2021
Mining and modeling graphs using patterns and priors
F Adriaens
Ghent University, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–9