Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Biomarker Discovery in the Genome with Applications to
  Antimicrobial Resistance   The Set Covering Machine (SCM) is a greedy learning algorithm that produces
sparse classifiers. We extend the SCM for datasets that contain a huge number
of features. The whole genetic material of living organisms is an example of
such a case, where the number of feature exceeds 10^7. Three human pathogens
were used to evaluate the performance of the SCM at predicting antimicrobial
resistance. Our results show that the SCM compares favorably in terms of
sparsity and accuracy against L1 and L2 regularized Support Vector Machines and
CART decision trees. Moreover, the SCM was the only algorithm that could
consider the full feature space. For all other algorithms, the latter had to be
filtered as a preprocessing step.

29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org