David Graus
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David Graus has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Jens-Joris Decorte
TechWolf, Ghent, Belgium
3 shared publications - Maarten de Rijke
University of Amsterdam, Amsterdam, Netherlands
3 shared publications Manos Tsagkias
904Labs, Amsterdam, Netherlands
3 shared publications- Toine Bogers
IT University of Copenhagen, Copenhagen, Denmark
3 shared publications - Chris Johnson
Indeed, USA
2 shared publications David van Dijk
University of Amsterdam, Amsterdam, Netherlands
2 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 933-938
WorkRB: A Community-Driven Evaluation Framework for AI in the Work Domain
Today’s evolving labor markets rely increasingly on recommender systems for hiring, talent management, and workforce analytics, with natural language processing (NLP) capabilities at the core. Yet, research in this area remains highly fragmented. Studies employ divergent ontologies (ESCO, O*NET, national taxonomies), heterogeneous task formulations, and diverse model families, making cross-study comparison and reproducibility exceedingly difficult. General-purpose benchmarks lack coverage of work-specific tasks, and the inherent sensitivity of employment data further limits open evaluation. We present WorkRB (Work Research Benchmark), the first open-source, community-driven benchmark tailored to work-domain AI. WorkRB organizes 13 diverse tasks from 7 task groups as unified recommendation and NLP tasks, including job / skill recommendation, candidate recommendation, similar item recommendation, and skill extraction and normalization. WorkRB enables both monolingual and cross-lingual evaluation settings through dynamic loading of multilingual ontologies. Developed within a multi-stakeholder ecosystem of academia, industry, and public institutions, WorkRB has a modular design for seamless contributions and enables integration of proprietary tasks without disclosing sensitive data. WorkRB is available under the Apache 2.0 license at https://github.com/techwolf-ai/WorkRB.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 933-938
Open AccessWorkRB: A Community-Driven Evaluation Framework for AI in the Work Domain
Today’s evolving labor markets rely increasingly on recommender systems for hiring, talent management, and workforce analytics, with natural language processing (NLP) capabilities at the core. Yet, research in this area remains highly fragmented. Studies employ divergent ontologies (ESCO, O*NET, national taxonomies), heterogeneous task formulations, and diverse model families, making cross-study comparison and reproducibility exceedingly difficult. General-purpose benchmarks lack coverage of work-specific tasks, and the inherent sensitivity of employment data further limits open evaluation. We present WorkRB (Work Research Benchmark), the first open-source, community-driven benchmark tailored to work-domain AI. WorkRB organizes 13 diverse tasks from 7 task groups as unified recommendation and NLP tasks, including job / skill recommendation, candidate recommendation, similar item recommendation, and skill extraction and normalization. WorkRB enables both monolingual and cross-lingual evaluation settings through dynamic loading of multilingual ontologies. Developed within a multi-stakeholder ecosystem of academia, industry, and public institutions, WorkRB has a modular design for seamless contributions and enables integration of proprietary tasks without disclosing sensitive data. WorkRB is available under the Apache 2.0 license at https://github.com/techwolf-ai/WorkRB.
- Top Cited PapersOpen Access
- 3 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (1) , 1-54
Fairness and Bias in Algorithmic Hiring: A Multidisciplinary Survey
Employers are adopting algorithmic hiring technology throughout the recruitment pipeline. Algorithmic fairness is especially applicable in this domain due to its high stakes and structural inequalities. Unfortunately, most work in this space provides partial treatment, often constrained by two competing narratives, optimistically focused on replacing biased recruiter decisions or pessimistically pointing to the automation of discrimination. Whether, and more importantly what types of , algorithmic hiring can be less biased and more beneficial to society than low-tech alternatives currently remains unanswered, to the detriment of trustworthiness. This multidisciplinary survey caters to practitioners and researchers with a balanced and integrated coverage of systems, biases, measures, mitigation strategies, datasets, and legal aspects of algorithmic hiring and fairness. Our work supports a contextualized understanding and governance of this technology by highlighting current opportunities and limitations, providing recommendations for future work to ensure shared benefits for all stakeholders.
- 3 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (1) , 1-54
Top Cited PapersOpen AccessFairness and Bias in Algorithmic Hiring: A Multidisciplinary Survey
Employers are adopting algorithmic hiring technology throughout the recruitment pipeline. Algorithmic fairness is especially applicable in this domain due to its high stakes and structural inequalities. Unfortunately, most work in this space provides partial treatment, often constrained by two competing narratives, optimistically focused on replacing biased recruiter decisions or pessimistically pointing to the automation of discrimination. Whether, and more importantly what types of , algorithmic hiring can be less biased and more beneficial to society than low-tech alternatives currently remains unanswered, to the detriment of trustworthiness. This multidisciplinary survey caters to practitioners and researchers with a balanced and integrated coverage of systems, biases, measures, mitigation strategies, datasets, and legal aspects of algorithmic hiring and fairness. Our work supports a contextualized understanding and governance of this technology by highlighting current opportunities and limitations, providing recommendations for future work to ensure shared benefits for all stakeholders.
- Open Access
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1222-1226
Fourth Workshop on Recommender Systems for Human Resources (RecSys in HR 2024)
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1222-1226
Open AccessFourth Workshop on Recommender Systems for Human Resources (RecSys in HR 2024)
- Open Access
- 14 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 1244-1247
Third Workshop on Recommender Systems for Human Resources (RecSys in HR 2023)
- 14 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 1244-1247
Open AccessThird Workshop on Recommender Systems for Human Resources (RecSys in HR 2023)
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 751-755
Improving Automated Segmentation of Radio Shows with Audio Embeddings
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 751-755
Improving Automated Segmentation of Radio Shows with Audio Embeddings
- Open Access
- 5 February 2018
- Published by Wiley in Journal of the Association for Information Science and Technology
- Vol. 69 (6) , 773-786
The birth of collective memories: Analyzing emerging entities in text streams
We study how collective memories are formed online. We do so by tracking entities that emerge in public discourse, that is, in online text streams such as social media and news streams, before they are incorporated into Wikipedia, which, we argue, can be viewed as an online place for collective memory. By tracking how entities emerge in public discourse, that is, the temporal patterns between their first mention in online text streams and subsequent incorporation into collective memory, we gain insights into how the collective remembrance process happens online. Specifically, we analyze nearly 80,000 entities as they emerge in online text streams before they are incorporated into Wikipedia. The online text streams we use for our analysis comprise of social media and news streams, and span over 579 million documents in a time span of 18 months. We discover two main emergence patterns: entities that emerge in a “bursty” fashion, that is, that appear in public discourse without a precedent, blast into activity and transition into collective memory. Other entities display a “delayed” pattern, where they appear in public discourse, experience a period of inactivity, and then resurface before transitioning into our cultural collective memory.
- 5 February 2018
- Published by Wiley in Journal of the Association for Information Science and Technology
- Vol. 69 (6) , 773-786
Open AccessThe birth of collective memories: Analyzing emerging entities in text streams
We study how collective memories are formed online. We do so by tracking entities that emerge in public discourse, that is, in online text streams such as social media and news streams, before they are incorporated into Wikipedia, which, we argue, can be viewed as an online place for collective memory. By tracking how entities emerge in public discourse, that is, the temporal patterns between their first mention in online text streams and subsequent incorporation into collective memory, we gain insights into how the collective remembrance process happens online. Specifically, we analyze nearly 80,000 entities as they emerge in online text streams before they are incorporated into Wikipedia. The online text streams we use for our analysis comprise of social media and news streams, and span over 579 million documents in a time span of 18 months. We discover two main emergence patterns: entities that emerge in a “bursty” fashion, that is, that appear in public discourse without a precedent, blast into activity and transition into collective memory. Other entities display a “delayed” pattern, where they appear in public discourse, experience a period of inactivity, and then resurface before transitioning into our cultural collective memory.
- Open Access
- 13 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 7-15
Analyzing and Predicting Task Reminders
Automated personal assistants such as Siri, Cortana, and Google Now provide services to help users accomplish tasks, including tools to set reminders. We study how people specify and use reminders. Our study analyzes a sample of six months of logs of user-specified reminders from Cortana (Microsoft's intelligent personal assistant), the first large-scale analysis of such reminders. We focus our analyses on time-based reminders, the most common type of reminder found in the logs. We perform a data-driven analysis to identify common categories of tasks that give rise to these reminders across a large number of users, and we arrange these tasks into a taxonomy. We identify temporal patterns linked to the type of task, time of creation, and terms in the reminder text. Finally, we show that these patterns generalize by addressing a prediction task. Specifically, we show that a reminder's creation time is a strong feature in predicting the notification time, and that including the reminder text further improves prediction accuracy. The results have implications for the design of systems aimed at helping people to complete tasks and to plan future activities.
- 13 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 7-15
Open AccessAnalyzing and Predicting Task Reminders
Automated personal assistants such as Siri, Cortana, and Google Now provide services to help users accomplish tasks, including tools to set reminders. We study how people specify and use reminders. Our study analyzes a sample of six months of logs of user-specified reminders from Cortana (Microsoft's intelligent personal assistant), the first large-scale analysis of such reminders. We focus our analyses on time-based reminders, the most common type of reminder found in the logs. We perform a data-driven analysis to identify common categories of tasks that give rise to these reminders across a large number of users, and we arrange these tasks into a taxonomy. We identify temporal patterns linked to the type of task, time of creation, and terms in the reminder text. Finally, we show that these patterns generalize by addressing a prediction task. Specifically, we show that a reminder's creation time is a strong feature in predicting the notification time, and that including the reminder text further improves prediction accuracy. The results have implications for the design of systems aimed at helping people to complete tasks and to plan future activities.
- Open Access
- 8 February 2016
- Published by Association for Computing Machinery (ACM)
- p. 595-604
Dynamic Collective Entity Representations for Entity Ranking
Entity ranking, i.e., successfully positioning a relevant entity at the top of the ranking for a given query, is inherently difficult due to the potential mismatch between the entity's description in a knowledge base, and the way people refer to the entity when searching for it. To counter this issue we propose a method for constructing dynamic collective entity representations. We collect entity descriptions from a variety of sources and combine them into a single entity representation by learning to weight the content from different sources that are associated with an entity for optimal retrieval effectiveness. Our method is able to add new descriptions in real time and learn the best representation as time evolves so as to capture the dynamics of how people search entities. Incorporating dynamic description sources into dynamic collective entity representations improves retrieval effectiveness by 7% over a state-of-the-art learning to rank baseline. Periodic retraining of the ranker enables higher ranking effectiveness for dynamic collective entity representations
- 8 February 2016
- Published by Association for Computing Machinery (ACM)
- p. 595-604
Open AccessDynamic Collective Entity Representations for Entity Ranking
Entity ranking, i.e., successfully positioning a relevant entity at the top of the ranking for a given query, is inherently difficult due to the potential mismatch between the entity's description in a knowledge base, and the way people refer to the entity when searching for it. To counter this issue we propose a method for constructing dynamic collective entity representations. We collect entity descriptions from a variety of sources and combine them into a single entity representation by learning to weight the content from different sources that are associated with an entity for optimal retrieval effectiveness. Our method is able to add new descriptions in real time and learn the best representation as time evolves so as to capture the dynamics of how people search entities. Incorporating dynamic description sources into dynamic collective entity representations improves retrieval effectiveness by 7% over a state-of-the-art learning to rank baseline. Periodic retraining of the ranker enables higher ranking effectiveness for dynamic collective entity representations
- Open Access
- 3 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 1079-1082
Recipient recommendation in enterprises using communication graphs and email content
We address the task of recipient recommendation for emailing in enterprises. We propose an intuitive and elegant way of modeling the task of recipient recommendation, which uses both the communication graph (i.e., who are most closely connected to the sender) and the content of the email. Additionally, the model can incorporate evidence as prior probabilities. Experiments on two enterprise email collections show that our model achieves very high scores, and that it outperforms two variants that use either the communication graph or the content in isolation.
- 3 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 1079-1082
Open AccessRecipient recommendation in enterprises using communication graphs and email content
We address the task of recipient recommendation for emailing in enterprises. We propose an intuitive and elegant way of modeling the task of recipient recommendation, which uses both the communication graph (i.e., who are most closely connected to the sender) and the content of the email. Additionally, the model can incorporate evidence as prior probabilities. Experiments on two enterprise email collections show that our model achieves very high scores, and that it outperforms two variants that use either the communication graph or the content in isolation.
- 1 January 2014
- Published by Springer Nature
- p. 286-298
Generating Pseudo-ground Truth for Predicting New Concepts in Social Streams
- 1 January 2014
- Published by Springer Nature
- p. 286-298
Generating Pseudo-ground Truth for Predicting New Concepts in Social Streams