Algorithm 1.
Input: F ∈ ℝS×B c ∈ ℤS N | ||
Output: n ∈ ℤN | ||
1: | n = ∅ | |
2: | while |n| ≤ N do //while features <N | |
3: | j = 1 | |
4: | while j ≤ B do | |
5: | find j such that eqn (1) is maximized | |
6: | append j to n | |
7: | end while | |
8: | end while |
Input: F ∈ ℝS×B c ∈ ℤS N | ||
Output: n ∈ ℤN | ||
1: | n = ∅ | |
2: | while |n| ≤ N do //while features <N | |
3: | j = 1 | |
4: | while j ≤ B do | |
5: | find j such that eqn (1) is maximized | |
6: | append j to n | |
7: | end while | |
8: | end while |