Skip to main content
Figure 1 | Algorithms for Molecular Biology

Figure 1

From: Wrapper-based selection of genetic features in genome-wide association studies through fast matrix operations

Figure 1

Comparison of the greedy RLS implementations. Plot showing the timing comparison (in seconds) for the two variations of greedy RLS. Note the linearity in the greedy RLS curve compared to the quadratic nature of the space-efficient version with respect to the number of selected features. The run was based on randomly sampled datasets with 1,000 training examples and 10,000 features.

Back to article page