Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||The k-Feature Set problem is W-complete|
|Abstract:||We prove the W-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.|
|Editor:||Academic Press Inc Elsevier Science|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.