Countries citing papers authored by Siegfried Nijssen
Since
Specialization
Citations
This map shows the geographic impact of Siegfried Nijssen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Siegfried Nijssen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Siegfried Nijssen more than expected).
Fields of papers citing papers by Siegfried Nijssen
This network shows the impact of papers produced by Siegfried Nijssen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Siegfried Nijssen. The network helps show where Siegfried Nijssen may publish in the future.
Co-authorship network of co-authors of Siegfried Nijssen
This figure shows the co-authorship network connecting the top 25 collaborators of Siegfried Nijssen.
A scholar is included among the top collaborators of Siegfried Nijssen based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Siegfried Nijssen. Siegfried Nijssen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Leeuwen, Matthijs van, et al.. (2014). Interactive Learning of Pattern Rankings. International Journal of Artificial Intelligence Tools. 23(6). 1460026–1460026.8 indexed citations
7.
Blockeel, Hendrik, et al.. (2013). Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23-27, 2013. Springer eBooks.2 indexed citations
8.
Guns, Tias, Anton Dries, Guido Tack, Siegfried Nijssen, & Luc De Raedt. (2013). MiningZinc: a modeling language for constraint-based mining. International Joint Conference on Artificial Intelligence. 63(12). 1365–1372.9 indexed citations
9.
Blockeel, Hendrik, Kristian Kersting, Siegfried Nijssen, & Filip Železný. (2013). Machine learning and knowledge discovery in databases, European Conference, ECML PKDD 2013, Proceedings, Part III. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).4 indexed citations
Berendt, Bettina, et al.. (2009). Data mining, interactive semantic structuring, and collaboration: a diversity-aware method for sense-making in search. Lirias (KU Leuven). 1–8.2 indexed citations
13.
Blockeel, Hendrik & Siegfried Nijssen. (2008). Induction of node label controlled graph grammar rules. Lirias (KU Leuven). 1–4.5 indexed citations
14.
Bringmann, Björn & Siegfried Nijssen. (2007). What is frequent in a single graph. Lirias (KU Leuven). 1–4.3 indexed citations
15.
Ramon, Jan & Siegfried Nijssen. (2007). General graph refinement with polynomial delay. Lirias (KU Leuven). 1–4.2 indexed citations
16.
Nijssen, Siegfried & Joost N. Kok. (2006). Frequent subgraph miners: runtimes don't say everything. Lirias (KU Leuven). 173–180.19 indexed citations
17.
Goethals, Bart, Siegfried Nijssen, & Mohammed J. Zaki. (2005). Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).3 indexed citations
18.
Nijssen, Siegfried & Joost N. Kok. (2004). Ideal refinement of Datalog clauses using primary keys. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 520–524.1 indexed citations
19.
Chi, Yün, Richard R. Muntz, Siegfried Nijssen, & Joost N. Kok. (2004). Frequent Subtree Mining - An Overview. Fundamenta Informaticae. 66(1). 161–198.150 indexed citations
20.
Nijssen, Siegfried & Joost N. Kok. (2001). Faster association rules for multiple relations. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 891–896.43 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.