A Baseline Method For Search-Based Software Engineering

Gay, Gregory
2010
Thumbnail Image

View/Download File

10baseline.pdf (814.1 KB)

Persistent link to this item

https://hdl.handle.net/11299/217408
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A Baseline Method For Search-Based Software Engineering

Authors

Published Date

2010

Publisher

Type

Report

Abstract

Background: Search-based Software Engineering (SBSE) uses a variety of techniques such as evolutionary algorithms or meta-heuristic searches but lacks a standard baseline method. Aims: The KEYS2 algorithm meets the criteria of a baseline. It is fast, stable, easy to understand, and presents results that are competitive with standard techniques. Method: KEYS2 operates on the theory that a small sub-set of variables control the majority of the search space. It uses a greedy search and a Bayesian ranking heuristic to fix the values of these variables, which rapidly forces the search towards stable high-scoring areas. Results: KEYS2 is faster than standard techniques, presents competitive results (assessed with a rank-sum test), and offers stable solutions. Conclusions: KEYS2 is a valid candidate to serve as a baseline technique for SBSE research.

Keywords

Description

Associated research group: Critical Systems Research Group

Related to

Replaces

License

Collections

University of Minnesota Software Engineering Center (UMSEC) Publications

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

PROMISE '10 Proceedings of the 6th International Conference on Predictive Models in Software Engineering

Suggested citation

Gay, Gregory. (2010). A Baseline Method For Search-Based Software Engineering. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/217408.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.