The k-feature set problem is W[2]-complete

  • Authors:
  • Carlos Cotta;Pablo Moscato

  • Affiliations:
  • Dept. Lenguajes y Ciencias de la Computación, Universidad de Málaga ETSI Informática (3.2.49), Campus de Teatinos, 29071 Málaga, Spain;Grupo de Engenharia de Computação em Sistemas Complexos, Departamento de Engenharia de Computação e Automação Industrial, Universidade Estadual de Campinas, C.P. 6101 ...

  • Venue:
  • Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove the W[2]-completeness of the feature subset selection problem when the cardinality of the subset is the parameter. Aside from the many applications the problem has in data mining literature, the problem is highly relevant in Computational Biology since it arises in differential gene expression analysis using microarray technologies. It is also related to genetic-based prognosis and regulatory interaction discovery using DNA chip technologies.