A polynomial algorithm for best-subset selection problem.

导出 OA

翻译打印收藏纠错

第一作者： Junxian,Zhu

第一单位： School of Mathematics, Sun Yat-sen University, Guangzhou, Guangdong 510275, China.

作者： Junxian,Zhu ^[1] ; Canhong,Wen ^[2] ; Jin,Zhu ^[1] ; Heping,Zhang ^[3] ; Xueqin,Wang ^[4]

作者单位： School of Mathematics, Sun Yat-sen University, Guangzhou, Guangdong 510275, China. ^[1] School of Management, University of Science and Technology of China, Hefei, Anhui 230026, China. ^[2] Department of Biostatistics, Yale University School of Public Health, New Haven, CT 06525 heping.zhang@yale.edu wangxq20@ustc.edu.cn. ^[3] School of Management, University of Science and Technology of China, Hefei, Anhui 230026, China; heping.zhang@yale.edu wangxq20@ustc.edu.cn. ^[4]

关键词 best-subset selection high dimensional splicing

主题词模型, 统计学(Models, Statistical)

DOI 10.1073/pnas.2014241117

PMID 33328272

发布时间 2021-09-20

翻译满意度评价：

准确一般字义偏差语意偏离译文作用小提交

浏览0

Proceedings of the National Academy of Sciences of the United States of America

2020年117卷52期

33117-33123页

相似文献

中文期刊
外文期刊
学位论文
会议论文

检索历史清除

A polynomial algorithm for best-subset selection problem.

Proceedings of the National Academy of Sciences of the United States of America

相似文献

Proceedings of the National Academy of Sciences of the United States of America

相关期刊

参考文献：
指定格式：	NoteExpress EndNote RefWorks NoteFirst

检索历史 清除

A polynomial algorithm for best-subset selection problem.

Proceedings of the National Academy of Sciences of the United States of America

相似文献

Proceedings of the National Academy of Sciences of the United States of America

相关期刊

检索历史清除