Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stephan Raaijmakers

dblp:26/3233 · also Stephan A. Raaijmakers · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
3since 2021 · last 2026
0000-0003-2984-6889ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 83% Data mining · 17%
Artificial intelligence
1 paper
Information extraction and text analysis · 77% Question answering and dialogue systems · 23%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
query log analysis
0.112009
Annotation of URLs: more than the sum of parts · SIGIR 2009
Information retrieval
retrieval models
0.112009
Annotation of URLs: more than the sum of parts · SIGIR 2009
Information retrieval › search interfaces
search result presentation
0.112009
Annotation of URLs: more than the sum of parts · SIGIR 2009
Natural language and speech › Information extraction and text analysis
subjectivity analysis
0.112008
Multimodal Subjectivity Analysis of Multiparty Conversation · EMNLP 2008
Data mining › text mining
text classification
0.012009
Annotation of URLs: more than the sum of parts · SIGIR 2009
Data mining › text mining › text classification
URL classification
0.012009
Annotation of URLs: more than the sum of parts · SIGIR 2009
Natural language and speech › Question answering and dialogue systems
multi-party dialogue
0.012008
Multimodal Subjectivity Analysis of Multiparty Conversation · EMNLP 2008

Methods — techniques the papers use, named apart from their topics

classification experiment · 0.1multimodal analysis · 0.1
YearPublicationVenuePosition
2026 Toward Federated Evaluation-as-a-Service for LLMs: A Preliminary Engineering Blueprint
Giulia Biagioni, Alex Montoya Franco, Julia García Fernández, Edwin Harmsma, Stephan Raaijmakers
CLOSER5
2023 Modeling Human Sequential Behavior with Deep Neural Networks in Emergent Communication
Tom Kouwenhoven, Tessa Verhoef, Stephan Raaijmakers, Roy De Kleijn
CogSci3
2022 Need for Structure and the Emergence of Communication
Tom Kouwenhoven, Roy De Kleijn, Stephan Raaijmakers, Tessa Verhoef
CogSci3
2020 Robustness Verification for Classifier Ensembles
Dennis Gross 0001, Nils Jansen 0001, Guillermo A. Pérez, Stephan Raaijmakers
ATVA4
2018 ICM: An Intuitive Model Independent and Accurate Certainty Measure for Machine Learning
abstract
End-users of machine learning-based systems benefit from measures that quantify the trustworthiness of the underlying models. Measures like accuracy provide for a general sense of model performance, but offer no detailed information on specific model outputs. Probabilistic outputs, on the other hand, express such details, but they are not available for all types of machine learning, and can be heavily influenced by bias and lack of representative training data. Further, they are often difficult to understand for non-experts. This study proposes an intuitive certainty measure (ICM) that produces an accurate estimate of how certain a machine learning model is for a specific output, based on errors it made in the past. It is designed to be easily explainable to non-experts and to act in a predictable, reproducible way. ICM was tested on four synthetic tasks solved by support vector machines, and a real-world task solved by a deep neural network. Our results show that ICM is both more accurate and intuitive than related approaches. Moreover, ICM is neutral with respect to the chosen machine learning model, making it widely applicable
Jasper van der Waa, Jurriaan van Diggelen, Mark A. Neerincx, Stephan Raaijmakers
ICAART (2)4
2011 Learning to rank for why-question answering
abstract
In this paper, we evaluate a number of machine learning techniques for the task of ranking answers to why-questions. We use TF-IDF together with a set of 36 linguistically motivated features that characterize questions and answers. We experiment with a number of machine learning techniques (among which several classifiers and regression techniques, Ranking SVM and SVM map ) in various settings. The purpose of the experiments is to assess how the different machine learning approaches can cope with our highly imbalanced binary relevance data, with and without hyperparameter tuning. We find that with all machine learning techniques, we can obtain an MRR score that is significantly above the TF-IDF baseline of 0.25 and not significantly lower than the best score of 0.35. We provide an in-depth analysis of the effect of data imbalance and hyperparameter tuning, and we relate our findings to previous research on learning to rank for Information Retrieval.
Suzan Verberne, Hans van Halteren, Daphne Theijssen, Stephan Raaijmakers, Lou Boves
Inf. Retr.4
2010 Classifier Calibration for Multi-Domain Sentiment Classification
Stephan Raaijmakers, Wessel Kraaij
ICWSM1
2009 Annotation of URLs: more than the sum of parts
abstract
Recently a number of studies have demonstrated that search engine logfiles are an important resource to determine the relevance relation between URLs and query terms. We hypothesized that the queries associated with a URL could also be presented as useful URL metadata in a search engine result list, e.g. for helping to determine the semantic category of a URL. We evaluated this hypothesis by a classification experiment based on the DMOZ dataset. Our method can also annotate URLs that have no associated queries.
Max Hinne, Wessel Kraaij, Stephan Raaijmakers, Suzan Verberne, Theo P. van der Weide, Maarten van der Heijden
SIGIR3
2008 Multimodal Subjectivity Analysis of Multiparty Conversation
Stephan Raaijmakers, Khiet P. Truong, Theresa Wilson
EMNLP1
2008 A Shallow Approach to Subjectivity Classification
Stephan Raaijmakers, Wessel Kraaij
ICWSM1
2008 Comparing word, character, and phoneme n-grams for subjective utterance recognition
abstract
In this paper, we compare the performance of classifiers trained using word n-grams, character n-grams, and phoneme n-grams for recognizing subjective utterances in multiparty conversation. We show that there is value in using very shallow linguistic representations, such as character n-grams, for recognizing subjective utterances, in particular, gains in the recall of subjective utterances. Copyright © 2008 ISCA.
Theresa Wilson, Stephan Raaijmakers
INTERSPEECH2
2002 Multimodal topic segmentation and classification of news video
abstract
In this paper we describe a model for multimodal topic segmentation and classification of Dutch news video. A focal topic of interest for the research reported here is the interaction between three different modalities (visual, auditory and textual information) in an integrated model for video analysis. We present a fully automated sequential feedback model for video analysis, where linguistic analysis is combined with visual information for the purposes of both segmentation and classification.
Stephan Raaijmakers, Jurgen den Hartog, Jan Baan
ICME (2)1