Methodology最新文献

筛选
英文 中文
The Vuong-Lo-Mendell-Rubin test for latent class and latent profile analysis: A note on the different implementations in Mplus and LatentGOLD 用于潜类和潜特征分析的 Vuong-Lo-Mendell-Rubin 检验:关于 Mplus 和 LatentGOLD 中不同实现方法的说明
Methodology Pub Date : 2024-03-22 DOI: 10.5964/meth.12467
Jeroen K. Vermunt
{"title":"The Vuong-Lo-Mendell-Rubin test for latent class and latent profile analysis: A note on the different implementations in Mplus and LatentGOLD","authors":"Jeroen K. Vermunt","doi":"10.5964/meth.12467","DOIUrl":"https://doi.org/10.5964/meth.12467","url":null,"abstract":"Mplus and LatentGOLD implement the Vuong-Lo-Mendell-Rubin test (comparing models with K and K + 1 latent classes) in slightly differ manners. While LatentGOLD uses the formulae from Vuong (1989; https://doi.org/10.2307/1912557), Mplus replaces the standard parameter variance-covariance matrix by its robust version. Our small simulation study showed why such a seemingly small difference may sometimes yield rather different results. The main finding is that the Mplus approximation of the distribution of the likelihood-ratio statistic is much more data dependent than the LatentGOLD one. This data dependency is stronger when the true model serves as the null hypothesis (H0) with K classes than when it serves as the alternative hypothesis (H1) with K + 1 classes, and it is also stronger for low class separation than for high class separation. Another important finding is that neither of the two implementations yield uniformly distributed p-values under the correct null hypothesis, indicating this test is not the best model selection tool in mixture modeling.","PeriodicalId":511881,"journal":{"name":"Methodology","volume":" 18","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140215528","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}
引用次数: 1
A general framework for planning the number of items/subjects for evaluating Cronbach’s alpha: Integration of hypothesis testing and confidence intervals 规划用于评估 Cronbach's alpha 的项目/受试者数量的总体框架:假设检验与置信区间的整合
Methodology Pub Date : 2024-03-22 DOI: 10.5964/meth.10449
W. Luh
{"title":"A general framework for planning the number of items/subjects for evaluating Cronbach’s alpha: Integration of hypothesis testing and confidence intervals","authors":"W. Luh","doi":"10.5964/meth.10449","DOIUrl":"https://doi.org/10.5964/meth.10449","url":null,"abstract":"Cronbach’s alpha, widely used for measuring reliability, often operates within studies with sample information, suffering insufficient sample sizes to have sufficient statistical power or precise estimation. To address this challenge and incorporate considerations of both confidence intervals and cost-effectiveness into statistical inferences, our study introduces a novel framework. This framework aims to determine the optimal configuration of measurements and subjects for Cronbach’s alpha by integrating hypothesis testing and confidence intervals. We have developed two R Shiny apps capable of considering up to nine probabilities, which encompass width, validity, and/or rejection events. These apps facilitate obtaining the required number of measurements/subjects, either by minimizing overall cost for a desired probability or by maximizing probability for a predefined cost.","PeriodicalId":511881,"journal":{"name":"Methodology","volume":" 19","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140218938","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 modified tucker’s congruence coefficient for factor matching 用于因子匹配的修正塔克一致系数
Methodology Pub Date : 2020-04-06 DOI: 10.5964/meth.2813
Aniko Lovik, V. Nassiri, G. Verbeke, G. Molenberghs
{"title":"A modified tucker’s congruence coefficient for factor matching","authors":"Aniko Lovik, V. Nassiri, G. Verbeke, G. Molenberghs","doi":"10.5964/meth.2813","DOIUrl":"https://doi.org/10.5964/meth.2813","url":null,"abstract":"Since factor analysis is one of the most often used techniques in psychometrics, comparing or combining solutions from different factor analyses is often needed. Several measures to compare factors exist, one of the best known is Tucker’s congruence coefficient, which is enjoying newly found popularity thanks to the recent work of Lorenzo-Seva and ten Berge (2006), who established cut-off values for factor congruence. While this coefficient is in most cases very good in comparing factors in general, it also has some disadvantages, which can cause trouble when one needs to compare or combine many analyses. In this paper, we propose a modified Tucker’s congruence coefficient to address these issues.","PeriodicalId":511881,"journal":{"name":"Methodology","volume":"107 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141216520","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}
引用次数: 3
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学术文献互助群
群 号:481959085
Book学术官方微信