Are Relational Implicit Measures Sensitive to Relational Information?

نویسندگان

چکیده

Evidence increasingly suggests that information about the relation between stimuli can impact responses on implicit measures, but those measures were not designed to capture this in a controlled manner. Relational have therefore been developed assess such relational more specific Such used beliefs variety of contexts. However, despite numerous theoretical inferences having made under premise these validly measure content, assumption has directly tested. Across four preregistered experiments (N = 747) participants learned different relations two fictitious social groups and traits (e.g., Niffites are kind, Luupites should be kind). We then tested whether (the RRT, aIAT, PEP) reflected information. Overall, only mousetracking variant PEP effectively produced expected effects for both are- should-based Our results suggest many (as currently used) sensitive ways previously assumed, although use alternative scoring methods incorporate accuracy may represent step towards improving sensitivity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarity Measures for Relational Databases

We enrich sets with an integrated notion of similarity, measured in a (complete) lattice, special cases of which are reflexive sets and bounded metric spaces. Relations and basic relational operations of traditional relational algebra are interpreted in such richer structured environments. An canonical similarity measure between relations is introduced. In the special case of reflexive sets it ...

متن کامل

Aggregation in Relational Databases: Controlled Disclosure of Sensitive Information

It has been observed that often the release of a limited part of an information resource poses no security risks, but the relase of a sufficiently large part of that resource might pose such risks. This problem of controlled disclosure of sensitive information is an example of what is known as the aggregation problem. In this paper we argue that it should be possible to articulate specific secr...

متن کامل

mLynx: Relational Mutual Information

This paper represents a further steps in combining Information Theory tools with relational learning. We show how mutual information can be used to find relevant relational features.

متن کامل

Information and Relational Contracts

We investigate the use of information in repeated principal-agent game and report three results. First, consistent with Kandori (1992), garbling signals within each period hurts the e¢ ciency of the game. Second, contrary to Abreu, Milgrom, and Pearce (1991), bundling signals across periods and then fully revealing them never increases the e¢ ciency of the game. Third, and most importantly, we ...

متن کامل

Exploring Implicit Relationships In a Relational Database

The Google search engine [BP98] has brought the enormous web pages an order that well reflects the degree of relevance and importance of the web pages with respect to search keywords. The technique used to determine the order is called PageRank [PBMW97], which origins from the idea of academic citation: a paper should receive more attention if it is cited by many (important) papers. By analyzin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Collabra

سال: 2022

ISSN: ['2474-7394']

DOI: https://doi.org/10.1525/collabra.38621