{"title":"工具,以确定线性组合的预后因素,最大限度地扩大面积下的接受者操作者曲线。","authors":"Nicolae Todor, Irina Todor, Gavril Săplăcan","doi":"10.1186/2043-9113-4-10","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>The linear combination of variables is an attractive method in many medical analyses targeting a score to classify patients. In the case of ROC curves the most popular problem is to identify the linear combination which maximizes area under curve (AUC). This problem is complete closed when normality assumptions are met. With no assumption of normality search algorithm are avoided because it is accepted that we have to evaluate AUC n(d) times where n is the number of distinct observation and d is the number of variables.</p><p><strong>Methods: </strong>For d = 2, using particularities of AUC formula, we described an algorithm which lowered the number of evaluations of AUC from n(2) to n(n-1) + 1. For d > 2 our proposed solution is an approximate method by considering equidistant points on the unit sphere in R(d) where we evaluate AUC.</p><p><strong>Results: </strong>The algorithms were applied to data from our lab to predict response of treatment by a set of molecular markers in cervical cancers patients. In order to evaluate the strength of our algorithms a simulation was added.</p><p><strong>Conclusions: </strong>In the case of no normality presented algorithms are feasible. For many variables computation time could be increased but acceptable.</p>","PeriodicalId":73663,"journal":{"name":"Journal of clinical bioinformatics","volume":"4 ","pages":"10"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/2043-9113-4-10","citationCount":"1","resultStr":"{\"title\":\"Tools to identify linear combination of prognostic factors which maximizes area under receiver operator curve.\",\"authors\":\"Nicolae Todor, Irina Todor, Gavril Săplăcan\",\"doi\":\"10.1186/2043-9113-4-10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background: </strong>The linear combination of variables is an attractive method in many medical analyses targeting a score to classify patients. In the case of ROC curves the most popular problem is to identify the linear combination which maximizes area under curve (AUC). This problem is complete closed when normality assumptions are met. With no assumption of normality search algorithm are avoided because it is accepted that we have to evaluate AUC n(d) times where n is the number of distinct observation and d is the number of variables.</p><p><strong>Methods: </strong>For d = 2, using particularities of AUC formula, we described an algorithm which lowered the number of evaluations of AUC from n(2) to n(n-1) + 1. For d > 2 our proposed solution is an approximate method by considering equidistant points on the unit sphere in R(d) where we evaluate AUC.</p><p><strong>Results: </strong>The algorithms were applied to data from our lab to predict response of treatment by a set of molecular markers in cervical cancers patients. In order to evaluate the strength of our algorithms a simulation was added.</p><p><strong>Conclusions: </strong>In the case of no normality presented algorithms are feasible. For many variables computation time could be increased but acceptable.</p>\",\"PeriodicalId\":73663,\"journal\":{\"name\":\"Journal of clinical bioinformatics\",\"volume\":\"4 \",\"pages\":\"10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/2043-9113-4-10\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of clinical bioinformatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/2043-9113-4-10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2014/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of clinical bioinformatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/2043-9113-4-10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2014/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
Tools to identify linear combination of prognostic factors which maximizes area under receiver operator curve.
Background: The linear combination of variables is an attractive method in many medical analyses targeting a score to classify patients. In the case of ROC curves the most popular problem is to identify the linear combination which maximizes area under curve (AUC). This problem is complete closed when normality assumptions are met. With no assumption of normality search algorithm are avoided because it is accepted that we have to evaluate AUC n(d) times where n is the number of distinct observation and d is the number of variables.
Methods: For d = 2, using particularities of AUC formula, we described an algorithm which lowered the number of evaluations of AUC from n(2) to n(n-1) + 1. For d > 2 our proposed solution is an approximate method by considering equidistant points on the unit sphere in R(d) where we evaluate AUC.
Results: The algorithms were applied to data from our lab to predict response of treatment by a set of molecular markers in cervical cancers patients. In order to evaluate the strength of our algorithms a simulation was added.
Conclusions: In the case of no normality presented algorithms are feasible. For many variables computation time could be increased but acceptable.