Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Selection algorithm

Known as: Hoare's algorithm, Select algorithm, Selection problem 
In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth… Expand
Wikipedia

Related topics

Related topics

42 relations
AlgorithmAmortized analysisArray data structureC++
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Feature Selection with the Boruta Package
This article describes a R package Boruta, implementing a novel feature selection algorithm for finding emph{all relevant… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
Highly Cited
2004
Highly Cited
2004
Feature Selection for Unsupervised Learning
In this paper, we identify two issues involved in developing an automated feature subset selection algorithm for unlabeled data… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation
We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelope-based Selection Algorithm), in which… Expand
  • figure 1
Highly Cited
1998
Highly Cited
1998
Feature Subset Selection Using a Genetic Algorithm
Practical pattern-classification and knowledge-discovery problems require the selection of a subset of attributes or features to… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
1997
Highly Cited
1997
Wrappers for Feature Subset Selection
Abstract In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset… Expand
  • figure I
  • table 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1994
Highly Cited
1994
Irrelevant Features and the Subset Selection Problem
We address the problem of finding a subset of features that allows a supervised induction algorithm to induce small high-accuracy… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1992
Highly Cited
1992
A Practical Approach to Feature Selection
In real-world concept learning problems, the representation of data often uses many features, only a few of which may be related… Expand
Highly Cited
1987
Highly Cited
1987
Reducing Bias and Inefficienry in the Selection Algorithm
A sheet which is a blend of water-insoluble fibers and pieces of film of a dry material which converts to a gel quickly on… Expand
Highly Cited
1977
Highly Cited
1977
A Branch and Bound Algorithm for Feature Subset Selection
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Highly Cited
1973
Highly Cited
1973
Time Bounds for Selection
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by… Expand
  • figure 1
  • figure 3
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE