Selection Algorithms
Selection Algorithm is a computational method within the divide and conquer paradigm that identifies the k-th smallest or largest element in an unordered list by recursively partitioning the input space to isolate the desired element with optimal efficiency.
1.2K
Publications
85.9K
Citations
3.5K
Authors
1.3K
Institutions
Publications per year
2017–2026
380
Variants
Selection Algorithm
Parents
1.2K
Bradley Efron, Trevor Hastie, Iain M. Johnstone et al. · The Annals of Statistics · 2004 · 9.5K citations · Full text
Purposeful selection of variables in logistic regression
Zoran Bursac, C. Heath Gauss, David Williams et al. · Source Code for Biology and Medicine · 2008 · 3.9K citations · Full text
Method of optimal directions for frame design
Kjersti Engan, S.O. Aase · 1999 · 1.3K citations
1–5 of 1.2K
3.5K
9
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 3.5K
1.3K
Stanford University
Stanford, United States
15 h-index
34 publications
49.1K citations
Arizona State University
Tempe, United States
13 h-index
31 publications
12K citations
The University of Texas at Austin
Austin, United States
12 h-index
25 publications
3.8K citations
Tsinghua University
Beijing, China
12 h-index
36 publications
3.7K citations
Nanyang Technological University
Singapore, Singapore
12 h-index
22 publications
1.6K citations
Princeton University
Princeton, United States
11 h-index
23 publications
1.6K citations

Chinese Academy of Sciences
Beijing, China
11 h-index
22 publications
2.5K citations
University of Science and Technology of China
Hefei, China
11 h-index
28 publications
1.2K citations
1–8 of 1.3K
22 publications · 1.3K citations
16
h-index
15 publications · 1.5K citations
15
h-index
13 publications · 850 citations
13
h-index
TKDE · 14 publications · 3.5K citations
13
h-index
Repository · 15 publications · 1K citations
12
h-index
1–5