On the value of combining feature subset selection with genetic algorithms: Faster learning of coverage models

ACM International Conference Proceeding Series

Volumn , Issue , 2009, Pages

  Andrews, James H ^a   Menzies, Tim ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

feature subset selection; genetic algorithms; software testing

Indexed keywords

COMMUNITY IS; CONTROL STRUCTURE; COVERAGE MODELS; FEATURE SUBSET SELECTION; MODEL GENERATION; RANDOMIZED TESTS; RUNTIMES; SCALING-UP; SOFTWARE DEVELOPMENT PROJECTS; TEST CASE COVERAGE; TIME CONSTRAINTS;

FEATURE EXTRACTION; GENETIC ALGORITHMS; GENETIC ENGINEERING; HIGHWAY ACCIDENTS; LEARNING ALGORITHMS; MODELS; SET THEORY; SOFTWARE DESIGN; SOFTWARE TESTING;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 77953792009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1540438.1540456     Document Type: Conference Paper

References (23)

1. J. Andrews, F. Li, and T. Menzies. Nighthawk: A two-level genetic-random unit test data generator. In IEEE ASE'07, 2007. Available from http://menzies.us/pdf/07ase-nighthawk.pdf.
2. S. Antoy and R. G. Hamlet. Automatically checking an implementation against its formal specification. IEEE Transactions on Software Engineering, 26(1):55-69, January 2000.
3. J. Bentley. K-d trees for semidynamic point sets. In Proceedings Proceedings of the 6th Annual Symposium on Computational Geometry, Berkley, California, United States, pages 187-197, 1990.
4. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML'06, 2006. Available from http://hunch.net/~jl/projects/cover- tree/cover-tree.html.
5. F. Brooks. No silver bullet: Essence and accidents of software engineering. IEEE Computer, 20(4):34-42, 1987.
6. K. Claessen and J. Hughes. QuickCheck: A lightweight tool for random testing of Haskell programs. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), pages 268-279, Montreal, Canada, September 2000.
7. Cobertura Development Team. Cobertura web site. cobertura.sourceforge. net, accessed February 2007.
8. S. Cornett. Minimum acceptable code coverage. http://www.bullseye.com/ minimum.html, 2006.
9. K. A. DeJong and W. M. Spears. An analysis of the interacting roles of population size and crossover in genetic algorithms. In First Workshop on Parallel Problem Solving from Nature, pages 38-47. Springer, 1990.
10. R.-K. Doong and P. G. Frankl. The ASTOOT approach to testing object-oriented programs. ACM Transactions on Software Engineering and Methodology, 3(2):101-130, April 1994.
11. E. Frank, M. Hall, and B. Pfahringer. Locally weighted naive bayes. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 249-256. Morgan Kaufmann, 2003.
12. M. Hall and G. Holmes. Benchmarking attribute selection techniques for discrete class data mining. IEEE Transactions On Knowledge And Data Engineering, 15(6):1437-1447, 2003.
13. K. Kira and L. Rendell. A practical approach to feature selection. In The Ninth International Conference on Machine Learning, pages pp. 249-256. Morgan Kaufmann, 1992.
14. R. Kohavi and G. H. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
15. I. Kononenko. Estimating attributes: Analysis and extensions of relief. In The Seventh European Conference on Machine Learning, pages pp. 171-182. Springer-Verlag, 1994.
16. I. Kononenko, E. Simec, and M. Robnik-Sikonja. Overcoming the myopia of inductive learning algorithms with relieff. Applied Intelligence, 7:39-55, 1997. Available from http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4740.
17. A. Marcus and J. Maletic. Recovering documentation-to-source code traceability links using latent semantic indexing. In Proceedings of the Twenty-Fifth International Conference on Software Engineering, 2003.
18. T. Menzies, J. Greenwald, and A. Frank. Data mining static code attributes to learn defect predictors. IEEE Transactions on Software Engineering, January 2007. Available from http://menzies.us/pdf/06learnPredict. pdf.
19. C. C. Michael, G. McGraw, and M. A. Schatz. Generating software test data by evolution. IEEE Transactions on Software Engineering, 27(12), December 2001.
20. A. Miller. Subset Selection in Regression (second edition). Chapman & Hall, 2002.
21. C. Pacheco, S. K. Lahiri, M. D. Ernst, and T. Ball. Feedback-directed random test generation. In Proceedings of the 29th International Conference on Software Engineering (ICSE 2007), pages 75-84, Minneapolis, MN, May 2007.
22. W. Visser, C. S. Pǎšareanu, and R. Pelánek. Test input generation for Java containers using state matching. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2006), pages 37-48, Portland, Maine, July 2006.
23. A. Watkins and E. M. Hufnagel. Evolutionary test data generation: A comparison of fitness functions. Software Practice and Experience, 36:95-116, January 2006.