Automatic Rule-Based Generation of Items for Intelligence Tests and Probability Word Problems

Add to your list(s) Download to your calendar using vCal

• Prof. Dr. Heinz Holling, University of Muenster
• Thursday 10 May 2012, 14:00-15:00
• Seminar Room, The Mond Building, New Museums Site.

If you have a question about this talk, please contact Luning Sun.

Automatic rule-based generation of items is a promising method for item cloning that saves a considerable amount of time and money. Items are grouped in families that are created through the application of common rules and cloned from the same parent item. Within a family, the items are assumed to differ only in surface features. Infinitely many items may be developed on the fly, especially suited for adaptive testing. Only the item families have to be calibrated, content validity and test quality criteria of item response models are usually increased. In this presentation, a short overview of the generation of rule-based items is given. Software programs will be shown which adaptively generate tailor-made test items of intelligence and probability word problems. Optimal test designs and hierarchical item response models for rule-based generated items will be introduced. Results from several empirical studies show a good fit to these item response models. Practical implications of these findings for future test development in the assessment of intelligence and probability competencies are discussed.

This talk is part of the Cambridge Psychometrics Centre Seminars series.

This talk is included in these lists:

• Biology
• Cambridge Neuroscience Seminars
• Cambridge Psychometrics Centre Seminars
• Cambridge talks
• Chris Davis' list
• Department of Psychiatry talks stream
• Featured lists
• Life Science
• Life Sciences
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Psychology talks and events
• Seminar Room, The Mond Building, New Museums Site
• Stem Cells & Regenerative Medicine
• Yishu's list
• dh539

Note that ex-directory lists are not shown.