Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data-Reference-Cited by-同舟云学术

Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data

Published:2004 Issue: Volume: Page:21-30
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cotta Carlos,Sloper Christian,Moscato Pablo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24653-4_3.pdf

Reference9 articles.

1. Davies, S., Russell, S.: NP-completeness of searches for smallest possible feature sets. In: Greiner, R., Subramanian, D. (eds.) AAAI Symposium on Intelligent Relevance, New Orleans, pp. 41–43. AAAI Press, Menlo Park (1994)

2. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1998)

3. Lecture Notes in Computer Science;J. Chen,1999

4. Downey, R., Fellows, M.: Fixed parameter tractability and completeness I: Basic theory. SIAM Journal of Computing 24, 873–921 (1995)

5. Cotta, C., Moscato, P.: The k-Feature Set problem is W[2]-complete. Journal of Computer and Systems Science 67, 686–690 (2003)

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An optimization method for characterizing two groups of data;International Transactions in Operational Research;2022-07-27

2. Credit Scoring;Advances in Marketing, Customer Relationship Management, and E-Services;2021

3. Heuristic Solutions for the $${(\alpha , \beta )}$$-k Feature Set Problem;Heuristics for Optimization and Learning;2020-12-16

4. Ant colony optimization for text feature selection in sentiment analysis;Intelligent Data Analysis;2019-02-20

5. An adaptive memetic algorithm for feature selection using proximity graphs;Computational Intelligence;2018-12-04