Countries citing papers authored by Kurt Driessens
Since
Specialization
Citations
This map shows the geographic impact of Kurt Driessens'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 Kurt Driessens with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kurt Driessens more than expected).
This network shows the impact of papers produced by Kurt Driessens. 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 Kurt Driessens. The network helps show where Kurt Driessens may publish in the future.
Co-authorship network of co-authors of Kurt Driessens
This figure shows the co-authorship network connecting the top 25 collaborators of Kurt Driessens.
A scholar is included among the top collaborators of Kurt Driessens 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 Kurt Driessens. Kurt Driessens is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zhou, Shuang, et al.. (2015). Largest Source Subset Selection for Instance Transfer. Research Publications (Maastricht University). 423–438.4 indexed citations
6.
Ammar, Haitham Bou, Eric Eaton, Matthew E. Taylor, et al.. (2014). An automated measure of MDP similarity for transfer in reinforcement learning. National Conference on Artificial Intelligence. 31–37.29 indexed citations
7.
Ammar, Haitham Bou, Karl Tuyls, Matthew E. Taylor, Kurt Driessens, & Gerhard Weiß. (2012). Reinforcement learning transfer via sparse coding. Adaptive Agents and Multi-Agents Systems. 383–390.32 indexed citations
8.
Broeck, Guy Van den & Kurt Driessens. (2011). Automatic discretization of actions and states in Monte-Carlo tree search. Lirias (KU Leuven). 1–12.6 indexed citations
Labeeuw, Wouter, Kurt Driessens, Danny Weyns, Tom Holvoet, & Geert Deconinck. (2009). Prediction of Congested Traffic on the Critical Density Point Using Machine Learning and Decentralised Collaborating Cameras. Lirias (KU Leuven). 15–26.4 indexed citations
11.
Croonenborghs, Tom, Kurt Driessens, & Maurice Bruynooghe. (2008). Learning a transfer function for reinforcement learning problems. Lirias (KU Leuven). 15–16.4 indexed citations
12.
Ponsen, Marc, Jan Ramon, Tom Croonenborghs, Kurt Driessens, & Karl Tuyls. (2008). Bayes-relational learning of opponent models from incomplete information in no-limit poker. TU/e Research Portal. 1485–1486.15 indexed citations
13.
Driessens, Kurt, Jan Ramon, & Tom Croonenborghs. (2006). Transfer learning for reinforcement learning through goal and policy parametrization. Lirias (KU Leuven). 1–4.8 indexed citations
14.
Driessens, Kurt & Sašo Džeroski. (2005). Combining Model-Based and Instance-Based Learning for First Order Regression.. 341–342.3 indexed citations
Ramon, Jan & Kurt Driessens. (2004). On the numeric stability of Gaussian processes regression for relational reinforcement learning. Lirias (KU Leuven). 10–14.14 indexed citations
17.
Driessens, Kurt & Jan Ramon. (2003). Relational instance based regression for relational reinforcement learning. Lirias (KU Leuven). 123–130.34 indexed citations
18.
Driessens, Kurt & Sašo Džeroski. (2002). Integrating Experimentation and Guidance in Relational Reinforcement Learning. Lirias (KU Leuven). 115–122.19 indexed citations
19.
Blockeel, Hendrik, Kurt Driessens, Jan Ramon, et al.. (2001). First order models for the predictive toxicology challenge. Lirias (KU Leuven). 1–12.2 indexed citations
20.
Driessens, Kurt & Hendrik Blockeel. (2001). Learning digger using hierarchical reinforcement learning for concurrent goals. Lirias (KU Leuven). 11–12.5 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.