| Subjectively interesting connecting trees and forests F Adriaens, J Lijffijt, T De Bie Data Mining and Knowledge Discovery 33 (4), 1088-1124, 2019 | 15 | 2019 |
| Subjectively interesting connecting trees F Adriaens, J Lijffijt, T De Bie Machine Learning and Knowledge Discovery in Databases: European Conference …, 2017 | 9 | 2017 |
| 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, 611-651, 2020 | 7* | 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 | 6* | 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 | 6 | 2019 |
| Minimizing Hitting Time between Disparate Groups with Shortcut Edges F Adriaens, H Wang, A Gionis Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and …, 2023 | 4 | 2023 |
| Testing Cluster Properties of Signed Graphs F Adriaens, S Apers Proceedings of the ACM Web Conference 2023, 49-59, 2023 | 2* | 2023 |
| Diameter Minimization by Shortcutting with Degree Constraints F Adriaens, A Gionis IEEE International Conference on Data Mining (ICDM 2022), 2022 | 2 | 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 |
| Mining and modeling graphs using patterns and priors F Adriaens Ghent University, 2020 | | 2020 |
Tijl De BieFull Professor, Ghent UniversityVerified email at ugent.be
