A Modified Kendall Rank-Order Association Test For Evaluating The Repeatability Of Two Studies With A Large Number Of Objects.

T. Zheng, S. Lo
{"title":"A Modified Kendall Rank-Order Association Test For Evaluating The Repeatability Of Two Studies With A Large Number Of Objects.","authors":"T. Zheng, S. Lo","doi":"10.1142/9789812708298_0025","DOIUrl":null,"url":null,"abstract":"Assessing the reproducibility of research studies can be difficult, especially when the number of objects involved is large. In such situations, there is only a small set of those objects that are truly relevant to the scientific questions. For example, in microarray analysis, despite data sets containing expression levels for tens of thousands of genes, it is expected that only a small fraction of these genes are regulated by the treatment in a single experiment. In such cases, it is acknowledged that reproducibility of two studies is high only for objects with real signals. One way to assess reproducibility is to measure the associations between the two sets of data. The traditional association methods suffered from the lack of adequate power to detect the real signals, however. We propose in this article the use of a modified Kendall rank-order test of association, based on truncated ranks. Simulation results show that the proposed procedure increases the capacity to detect the real signals considerably.","PeriodicalId":93329,"journal":{"name":"Lecture notes-monograph series","volume":"3 1","pages":"515-528"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/9789812708298_0025","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lecture notes-monograph series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812708298_0025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Assessing the reproducibility of research studies can be difficult, especially when the number of objects involved is large. In such situations, there is only a small set of those objects that are truly relevant to the scientific questions. For example, in microarray analysis, despite data sets containing expression levels for tens of thousands of genes, it is expected that only a small fraction of these genes are regulated by the treatment in a single experiment. In such cases, it is acknowledged that reproducibility of two studies is high only for objects with real signals. One way to assess reproducibility is to measure the associations between the two sets of data. The traditional association methods suffered from the lack of adequate power to detect the real signals, however. We propose in this article the use of a modified Kendall rank-order test of association, based on truncated ranks. Simulation results show that the proposed procedure increases the capacity to detect the real signals considerably.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
评价两项具有大量对象的研究的可重复性的改进肯德尔秩序关联检验。
评估研究的可重复性可能是困难的,特别是当涉及的对象数量很大时。在这种情况下,只有一小部分对象与科学问题真正相关。例如,在微阵列分析中,尽管数据集包含成千上万个基因的表达水平,但预计在单个实验中只有一小部分基因受到治疗的调节。在这种情况下,人们承认,只有对具有真实信号的对象,两项研究的可重复性才高。评估再现性的一种方法是测量两组数据之间的关联。然而,传统的关联方法存在检测真实信号的能力不足的问题。在本文中,我们建议使用基于截断秩的改进肯德尔秩序关联检验。仿真结果表明,该方法大大提高了对真实信号的检测能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Semi-supervised Machine Learning with MixMatch and Equivalence Classes Federated Gradient Averaging for Multi-Site Training with Momentum-Based Optimizers. Semi-supervised Machine Learning with MixMatch and Equivalence Classes. Distanced LSTM: Time-Distanced Gates in Long Short-Term Memory Models for Lung Cancer Detection A Modified Kendall Rank-Order Association Test For Evaluating The Repeatability Of Two Studies With A Large Number Of Objects.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1