World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
4631
World Ranking
13991
National Ranking
129

Overview

Siegfried Nijssen is affiliated with the Université Catholique de Louvain in Belgium. Their main research contributions span the fields of Computer Science and Social Sciences, with a particular focus on Artificial Intelligence, Information Systems, Signal Processing, Computer Networks and Communications, and Sociology and Political Science.

Their research topics include:

  • Data Mining Algorithms and Applications
  • Machine Learning and Data Classification
  • Bayesian Modeling and Causal Inference
  • Constraint Satisfaction and Optimization
  • Data Management and Algorithms
  • Imbalanced Data Classification Techniques
  • Rough Sets and Fuzzy Logic

Among their frequent co-authors are Pierre Schaus, Gaël Aglin, Fredérić Docquier, Lucile Dierckx, and Alex Mattenet.

Siegfried Nijssen's recent publications include the following papers:

  • Decision trees: from efficient prediction to responsible AI, 2023, Frontiers in Artificial Intelligence
  • Learning Optimal Decision Trees Using Caching Branch-and-Bound Search, 2020, Proceedings of the AAAI Conference on Artificial Intelligence
  • Cross-border mobility responses to COVID-19 in Europe: new evidence from facebook data, 2022, Globalization and Health
  • Learning optimal decision trees using constraint programming, 2020, Constraints
  • Generic Constraint-based Block Modeling using Constraint Programming, 2021, Digital Access to Libraries

The research output appears frequently in the following publication venues:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Digital Access to Libraries
  • Frontiers in Artificial Intelligence
  • Globalization and Health

Their book publications include one titled Advances in Intelligent Data Analysis XXI, published by Springer Science+Business Media in 2023.

Best Publications

  • A quickstart in frequent structure mining can make a difference

    Siegfried Nijssen;Joost N. Kok

  • Frequent Subtree Mining - An Overview

    Yun Chi;Richard R. Muntz;Siegfried Nijssen;Joost N. Kok

  • What is frequent in a single graph

    Björn Bringmann;Siegfried Nijssen

  • The Gaston Tool for Frequent Subgraph Mining

    Siegfried Nijssen;Joost N. Kok

  • Itemset mining: A constraint programming perspective

    Tias Guns;Siegfried Nijssen;Luc De Raedt

  • Constraint programming for itemset mining

    Luc De Raedt;Tias Guns;Siegfried Nijssen

  • Efficient discovery of frequent unordered trees

    Siegfried Nijssen;Joost Kok

  • Decision trees: from efficient prediction to responsible AI

    Unknown

  • Faster association rules for multiple relations

    Siegfried Nijssen;Joost Kok

  • Pattern-based classification: a unifying perspective

    Björn Bringmann;Siegfried Nijssen;Albrecht Zimmermann

  • Substructure mining using elaborate chemical representation

    Jeroen Kazius;Siegfried Nijssen;Joost N. Kok;Thomas Bäck

  • Correlated itemset mining in ROC space: a constraint programming approach

    Siegfried Nijssen;Tias Guns;Luc De Raedt

  • Learning Optimal Decision Trees Using Caching Branch-and-Bound Search

    Gaël Aglin;Siegfried Nijssen;Pierre Schaus

  • k-Pattern Set Mining under Constraints

    T. Guns;S. Nijssen;L. De Raedt

  • Constraint programming for data mining and machine learning

    Luc De Raedt;Tias Guns;Siegfried Nijssen

  • Don't be afraid of simpler patterns

    Björn Bringmann;Albrecht Zimmermann;Luc De Raedt;Siegfried Nijssen

  • Mining optimal decision trees from itemset lattices

    Siegfried Nijssen;Elisa Fromont

  • Machine Learning and Knowledge Discovery in Databases

    Unknown

  • Efficient Frequent Query Discovery in Farmer

    Siegfried Nijssen;Joost N. Kok

  • Frequent graph mining and its application to molecular databases

    S. Nijssen;J.N. Kok

  • Constrained Clustering Using Column Generation

    Behrouz Babaki;Tias Guns;Siegfried Nijssen;Siegfried Nijssen

  • Correlated itemset mining in ROC space

    Siegfried Nijssen;Tias Guns;Luc De Raedt

Frequent Co-Authors

Luc De Raedt
Luc De Raedt KU Leuven
Joost N. Kok
Joost N. Kok University of Twente
Kathleen Marchal
Kathleen Marchal Ghent University
Bart Goethals
Bart Goethals University of Antwerp
Kristian Kersting
Kristian Kersting Technical University of Darmstadt
Ian Davidson
Ian Davidson University of California, Davis
Dino Pedreschi
Dino Pedreschi University of Pisa
Mohammed J. Zaki
Mohammed J. Zaki Rensselaer Polytechnic Institute
Christian Bessiere
Christian Bessiere University of Montpellier

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education can unlock new opportunities for students interested in computer science and related fields. For those whose academic records may not reflect their true potential, there are online schools that accept low gpa, making it easier to get started on a technology-focused degree.

Ambitious learners looking to fast-track their studies can consider an accelerated computer science degree program. These intensive options allow you to earn your qualifications in less time, helping you quickly enter the job market or advance your current career.

Computer science isn't the only path; related disciplines like environmental science and engineering are also in high demand. Graduates can find high-paying jobs with environmental science degree in sectors like sustainability, research, and data analysis.

Additionally, if you're interested in technology and sustainability, an online environmental engineering degree can connect you to a growing industry with roles focused on solving real-world problems.

Best Scientists Citing Siegfried Nijssen

Trending Scientists

Recently Published Articles