Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

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

Published: 01 December 2003 Publication History

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.

References

[1]
{1} T. Akutsu, S. Miyano, S. Kuhara, Algorithms for identifying boolean networks and related biological networks based on matrix multiplication and fingerprint function, J. Comput. Biol. 7 (2000) 331-343.
[2]
{2} P.O. Brown, D. Botstein, Exploring the new world of the genome with DNA microarrays, Nat. Genet. 21 (1999) 33-37.
[3]
{3} S. Davies, S. Russell, NP-completeness of searches for smallest possible feature sets, in: R. Greiner, D. Subramanian (Eds.), Proceedings of the AAAI Symposium on Relevance, New Orleans, AAAI Press, Menlo Park, CA, 1994, pp. 41-43.
[4]
{4} R. Downey, M. Fellows, Fixed parameter tractability and completeness I: basic theory, SIAM J. Comput. 24 (1995) 873-921.
[5]
{5} R. Downey, M. Fellows, Parameterized Complexity, Springer, Berlin, 1998.
[6]
{6} T.E. Ideker, V. Thorsson, R.M. Karp, Discovery of regulatory interactions through perturbation: inference and experimental design, Pacific Symposium on Biocomput. 5 (2000) 302-313.
[7]
{7} E.V. Koonin, The emerging paradigm and open problems in comparative genomics, Bioinformatics 15 (1999) 265-266.
[8]
{8} J. Marx, DNA Arrays reveal cancer in its many forms, Science 289 (2000) 1670-1672.
[9]
{9} P. Moscato, C. Cotta, A gentle introduction to memetic algorithms, in: F. Glover, G. Kochenberger (Eds.), Handbook of Metaheuristics, Kluwer Academic Publishers, Boston, MA, USA, 2003, pp. 105-144.
[10]
{10} E.F. Nuwaysir, M. Bittner, J. Trent, J.C. Barrett, C.A. Afshari, Microarray and toxicology: the advent of toxicogenomics, Mol. Carcinogenesis 24 (1999) 153-159.
[11]
{11} J. Weston, S. Mukherjee, O. Chapelle, M. Pontil, T. Poggio, V. Vapnik, Feature selection for SVMs, in: S.A. Solla, T.K. Leen, K.-R. Muller (Eds.), Advances in Neural Information Processing Systems, Vol. 13, MIT Press, Cambridge, MA, 2001.
[12]
{12} J.C. Wooley, Trends in computational biology: a summary based on RECOMB plenary lecture, J. Comput. Biol. 6 (1999) 459-474.

Cited By

View all
  • (2024)A novel grey wolf optimization algorithm based on geometric transformations for gene selection and cancer classificationThe Journal of Supercomputing10.1007/s11227-023-05643-z80:4(4808-4840)Online publication date: 1-Mar-2024
  • (2021)The complexity of dependency detection and discovery in relational databasesTheoretical Computer Science10.1016/j.tcs.2021.11.020900:C(79-96)Online publication date: 30-Dec-2021
  • (2020)Neuronal Communication Genetic Algorithm-Based Inductive LearningJournal of Information Technology Research10.4018/JITR.202004010913:2(141-154)Online publication date: 1-Apr-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences
Journal of Computer and System Sciences  Volume 67, Issue 4
Special issue on Parameterized computation and complexity
December 2003
195 pages

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 December 2003

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A novel grey wolf optimization algorithm based on geometric transformations for gene selection and cancer classificationThe Journal of Supercomputing10.1007/s11227-023-05643-z80:4(4808-4840)Online publication date: 1-Mar-2024
  • (2021)The complexity of dependency detection and discovery in relational databasesTheoretical Computer Science10.1016/j.tcs.2021.11.020900:C(79-96)Online publication date: 30-Dec-2021
  • (2020)Neuronal Communication Genetic Algorithm-Based Inductive LearningJournal of Information Technology Research10.4018/JITR.202004010913:2(141-154)Online publication date: 1-Apr-2020
  • (2018)Feature Subset Selection Using Ant Colony Optimization for a Decision Trees Classification of Medical DataInternational Journal of Information Retrieval Research10.4018/IJIRR.20181001038:4(39-50)Online publication date: 1-Oct-2018
  • (2017)Target curricula via selection of minimum feature setsThe Journal of Machine Learning Research10.5555/3122009.317685818:1(4070-4095)Online publication date: 1-Jan-2017
  • (2016)Exploiting hidden structure in selecting dimensions that distinguish vectorsJournal of Computer and System Sciences10.1016/j.jcss.2015.11.01182:3(521-535)Online publication date: 1-May-2016
  • (2016)A fast meta-heuristic approach for the (α,β)-k-feature set problemJournal of Heuristics10.1007/s10732-015-9307-022:2(199-220)Online publication date: 1-Apr-2016
  • (2008)Complexity Aspects of Image ClassificationMedical Imaging and Informatics10.1007/978-3-540-79490-5_1(1-4)Online publication date: 1-Jan-2008
  • (2005)The electronic primariesProceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 3810.5555/1082161.1082202(371-379)Online publication date: 1-Jan-2005
  • (2005)Integer programming models and algorithms for molecular classification of cancer from microarray dataProceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 3810.5555/1082161.1082201(361-370)Online publication date: 1-Jan-2005
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media