| A quickstart in frequent structure mining can make a difference S Nijssen, JN Kok Proceedings of the tenth ACM SIGKDD international conference on Knowledge …, 2004 | 747 | 2004 |
| Frequent subtree mining–an overview Y Chi, RR Muntz, S Nijssen, JN Kok Fundamenta Informaticae 66 (1-2), 161-198, 2005 | 346 | 2005 |
| What is frequent in a single graph? B Bringmann, S Nijssen Pacific-Asia Conference on Knowledge Discovery and Data Mining, 858-863, 2008 | 303 | 2008 |
| Itemset mining: A constraint programming perspective T Guns, S Nijssen, L De Raedt Artificial Intelligence 175 (12-13), 1951-1983, 2011 | 255 | 2011 |
| The gaston tool for frequent subgraph mining S Nijssen, JN Kok Electronic Notes in Theoretical Computer Science 127 (1), 77-87, 2005 | 254 | 2005 |
| Decision trees: from efficient prediction to responsible AI H Blockeel, L Devos, B Frénay, G Nanfack, S Nijssen Frontiers in artificial intelligence 6, 1124553, 2023 | 240 | 2023 |
| Constraint programming for itemset mining L De Raedt, T Guns, S Nijssen Proceedings of the 14th ACM SIGKDD international conference on Knowledge …, 2008 | 236 | 2008 |
| Learning optimal decision trees using caching branch-and-bound search G Aglin, S Nijssen, P Schaus Proceedings of the AAAI conference on artificial intelligence 34 (04), 3146-3153, 2020 | 212 | 2020 |
| Effcient discovery of frequent unordered trees S Nijssen Proc. First International Workshop on Mining Graphs, Trees and Sequences …, 2003 | 177 | 2003 |
| Learning optimal decision trees using constraint programming H Verhaeghe, S Nijssen, G Pesant, CG Quimper, P Schaus Constraints 25 (3), 226-250, 2020 | 149 | 2020 |
| Faster association rules for multiple relations S Nijssen, J Kok International joint conference on artificial intelligence 17 (1), 891-896, 2001 | 140 | 2001 |
| Mining optimal decision trees from itemset lattices S Nijssen, E Fromont Proceedings of the 13th ACM SIGKDD international conference on Knowledge …, 2007 | 131 | 2007 |
| Substructure mining using elaborate chemical representation J Kazius, S Nijssen, J Kok, T Bäck, AP IJzerman Journal of Chemical Information and Modeling 46 (2), 597-605, 2006 | 109 | 2006 |
| k-Pattern set mining under constraints T Guns, S Nijssen, L De Raedt IEEE Transactions on Knowledge and Data Engineering 25 (2), 402-418, 2011 | 101 | 2011 |
| Constraint programming for data mining and machine learning L De Raedt, T Guns, S Nijssen Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 1671-1675, 2010 | 101 | 2010 |
| Correlated itemset mining in ROC space: a constraint programming approach S Nijssen, T Guns, L De Raedt Proceedings of the 15th ACM SIGKDD international conference on Knowledge …, 2009 | 99 | 2009 |
| Optimal constraint-based decision tree induction from itemset lattices S Nijssen, E Fromont Data Mining and Knowledge Discovery 21 (1), 9-51, 2010 | 96 | 2010 |
| Pattern-based classification: A unifying perspective B Bringmann, S Nijssen, A Zimmermann arXiv preprint arXiv:1111.6191, 2011 | 87 | 2011 |
| Constrained clustering using column generation B Babaki, T Guns, S Nijssen International Conference on Integration of Constraint Programming …, 2014 | 84 | 2014 |
| Don’t be afraid of simpler patterns B Bringmann, A Zimmermann, L De Raedt, S Nijssen European Conference on Principles of Data Mining and Knowledge Discovery, 55-66, 2006 | 81 | 2006 |
Luc De Raedtprofessor, KU Leuven & guestprofessor, Örebro UniversityVerified email at cs.kuleuven.be
