Detecting Compromised Implicit Association Test Results Using Supervised Learning

09/03/2019
by   Brendon Boldt, et al.
0

An implicit association test is a human psychological test used to measure subconscious associations. While widely recognized by psychologists as an effective tool in measuring attitudes and biases, the validity of the results can be compromised if a subject does not follow the instructions or attempts to manipulate the outcome. Compared to previous work, we collect training data using a more generalized methodology. We train a variety of different classifiers to identify a participant's first attempt versus a second possibly compromised attempt. To compromise the second attempt, participants are shown their score and are instructed to change it using one of five randomly selected deception methods. Compared to previous work, our methodology demonstrates a more robust and practical framework for accurately identifying a wide variety of deception techniques applicable to the IAT.

READ FULL TEXT
research
11/29/2022

CUNI Submission in WMT22 General Task

We present the CUNI-Bergamot submission for the WMT22 General translatio...
research
09/15/2023

CAT: a conditional association test for microbiome data using a leave-out approach

In microbiome analysis, researchers often seek to identify taxonomic fea...
research
03/25/2019

On Measuring Social Biases in Sentence Encoders

The Word Embedding Association Test shows that GloVe and word2vec word e...
research
01/09/2020

Supporting supervised learning in fungal Biosynthetic Gene Cluster discovery: new benchmark datasets

Fungal Biosynthetic Gene Clusters (BGCs) of secondary metabolites are cl...
research
08/18/2019

Understanding Undesirable Word Embedding Associations

Word embeddings are often criticized for capturing undesirable word asso...
research
08/02/2018

Likelihood-free inference with an improved cross-entropy estimator

We extend recent work (Brehmer, et. al., 2018) that use neural networks ...
research
08/15/2018

Guided Unfoldings for Finding Loops in Standard Term Rewriting

In this paper, we reconsider the unfolding-based technique that we have ...

Please sign up or login with your details

Forgot password? Click here to reset