Quantitative and Computational Methods in Behavioral Sciences最新文献

筛选
英文 中文
Chain graph reduction into Power Chain Graphs 链图约简成权力链图
Quantitative and Computational Methods in Behavioral Sciences Pub Date : 2021-08-23 DOI: 10.31234/osf.io/rw95u
V. R. Franco, Guilherme Wang Barros, M. Wiberg, J. Laros
{"title":"Chain graph reduction into Power Chain Graphs","authors":"V. R. Franco, Guilherme Wang Barros, M. Wiberg, J. Laros","doi":"10.31234/osf.io/rw95u","DOIUrl":"https://doi.org/10.31234/osf.io/rw95u","url":null,"abstract":"Reduction of graphs is a class of procedures used to decrease the dimensionality of a given graph in which the properties of the reduced graph are to be induced from the properties of the larger original graph. This paper introduces both a new method for reducing chain graphs to simpler directed acyclic graphs (DAGs), that we call power chain graphs (PCG), as well as a procedure for structure learning of this new type of graph from correlational data of a Gaussian Graphical model (GGM). A definition for PCGs is given, directly followed by the reduction method. The structure learning procedure is a two-step approach: first, the correlation matrix is used to cluster the variables; and then, the averaged correlation matrix is used to discover the DAGs using the PC-stable algorithm. The results of simulations are provided to illustrate the theoretical proposal, which demonstrate initial evidence for the validity of our procedure to recover the structure of power chain graphs. The paper ends with a discussion regarding suggestions for future studies as well as some practical implications.","PeriodicalId":314301,"journal":{"name":"Quantitative and Computational Methods in Behavioral Sciences","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134635540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Reproducible Data Analysis Workflow 一个可重复的数据分析工作流
Quantitative and Computational Methods in Behavioral Sciences Pub Date : 2021-05-11 DOI: 10.5964/QCMB.3763
Aaron Peikert, A. Brandmaier
{"title":"A Reproducible Data Analysis Workflow","authors":"Aaron Peikert, A. Brandmaier","doi":"10.5964/QCMB.3763","DOIUrl":"https://doi.org/10.5964/QCMB.3763","url":null,"abstract":"In this tutorial, we describe a workflow to ensure long-term reproducibility of R-based data analyses. The workflow leverages established tools and practices from software engineering. It combines the benefits of various open-source software tools including R Markdown, Git, Make, and Docker, whose interplay ensures seamless integration of version management, dynamic report generation conforming to various journal styles, and full cross-platform and long-term computational reproducibility. The workflow ensures meeting the primary goals that 1) the reporting of statistical results is consistent with the actual statistical results (dynamic report generation), 2) the analysis exactly reproduces at a later point in time even if the computing platform or software is changed (computational reproducibility), and 3) changes at any time (during development and post-publication) are tracked, tagged, and documented while earlier versions of both data and code remain accessible. While the research community increasingly recognizes dynamic document generation and version management as tools to ensure reproducibility, we demonstrate with practical examples that these alone are not sufficient to ensure long-term computational reproducibility. Combining containerization, dependence management, version management, and dynamic document generation, the proposed workflow increases scientific productivity by facilitating later reproducibility and reuse of code and data.","PeriodicalId":314301,"journal":{"name":"Quantitative and Computational Methods in Behavioral Sciences","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115322936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
A note on a computationally efficient implementation of the EM algorithm in item response models 关于EM算法在项目响应模型中计算效率实现的说明
Quantitative and Computational Methods in Behavioral Sciences Pub Date : 2020-05-28 DOI: 10.31234/osf.io/xsm2f
A. Robitzsch
{"title":"A note on a computationally efficient implementation of the EM algorithm in item response models","authors":"A. Robitzsch","doi":"10.31234/osf.io/xsm2f","DOIUrl":"https://doi.org/10.31234/osf.io/xsm2f","url":null,"abstract":"This note sketches two computational shortcuts for estimating unidimensional item response models and multidimensional item response models with between-item dimensionality utilizing an expectation-maximization (EM) algorithm that relies on numerical integration with fixed quadrature points. It is shown that the number of operations required in the E-step can be reduced in situations of many cases and many items by appropriate shortcuts. Consequently, software implementations of a modified E-step in the EM algorithm could benefit from gains in computation time.","PeriodicalId":314301,"journal":{"name":"Quantitative and Computational Methods in Behavioral Sciences","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130778790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A tutorial for joint modeling of longitudinal and time-to-event data in R 纵向和事件时间数据在R中的联合建模教程
Quantitative and Computational Methods in Behavioral Sciences Pub Date : 2019-09-12 DOI: 10.5964/QCMB.2979
Sezen Cekic, Stephen R. Aichele, A. Brandmaier, Ylva Kohncke, P. Ghisletta
{"title":"A tutorial for joint modeling of longitudinal and time-to-event data in R","authors":"Sezen Cekic, Stephen R. Aichele, A. Brandmaier, Ylva Kohncke, P. Ghisletta","doi":"10.5964/QCMB.2979","DOIUrl":"https://doi.org/10.5964/QCMB.2979","url":null,"abstract":"In biostatistics and medical research, longitudinal data are often composed of repeated assessments of a variable and dichotomous indicators to mark an event of interest. Consequently, joint modeling of longitudinal and time-to-event data has generated much interest in these disciplines over the previous decade. In behavioural sciences, too, often we are interested in relating individual trajectories and discrete events. Yet, joint modeling is rarely applied in behavioural sciences more generally. This tutorial presents an overview and general framework for joint modeling of longitudinal and time-to-event data, and fully illustrates its application in the context of a behavioral study with the JMbayes R package. In particular, the tutorial discusses practical topics, such as model selection and comparison, choice of joint modeling parameterization and interpretation of model parameters. In the end, this tutorial aims at introducing didactically the theory related to joint modeling and to introduce novice analysts to the use of the JMbayes package.","PeriodicalId":314301,"journal":{"name":"Quantitative and Computational Methods in Behavioral Sciences","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信