Combining clickstream analyses and graph-modeled data clustering for identifying common response processes

DOI10.1007/s11336-020-09743-0zbMath1476.62249MaRDI QIDQ823870

Rolf Niedermeier, Steffi Pohl, Qiwei He, Esther Ulitzsch, Hendrik Molter, André Nichterlein, Vincent Ulitzsch

Publication date: 16 December 2021

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11336-020-09743-0

zbMATH Keywords

cluster editing; response times; action sequences; complex problem solving

Mathematics Subject Classification ID

62P15: Applications of statistics to psychology

Related Items

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

Cites Work

• Correlation clustering
• Cluster editing with locally bounded modifications
• NP-hard problems in hierarchical-tree clustering
• A cutting plane algorithm for a clustering problem
• Parameterizing edge modification problems above lower bounds
• Markov decision process measurement model
• Cluster graph modification problems
• Latent feature extraction for process data via multidimensional scaling
• Faster parameterized algorithm for pumpkin vertex deletion set
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
• A mixture hierarchical model for response times and response accuracy
• Cluster Editing
• An exploratory analysis of the latent structure of process data via action sequence autoencoders