Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: The k-Feature Set problem is W[2]-complete
Author: Cotta, C
Moscato, P
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. (C) 2003 Elsevier Science (USA). All rights reserved.
Country: EUA
Editor: Academic Press Inc Elsevier Science
Rights: fechado
Identifier DOI: 10.1016/S0022-0000(03)00081-3
Date Issue: 2003
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000187019400003.pdf127.99 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.