Abstract
SBSE researchers often use an evolutionary algorithm to solve various software engineering problems. This paper explores an alternate approach of sampling. This approach is called SWAY (Samplying WAY) and finds the (near) optimal solutions to the problem by (i) creating a larger initial population and (ii) intelligently sampling the solution space to find the best subspace. Unlike evolutionary algorithms, SWAY does not use mutation or cross-over or multi-generational reasoning to find interesting subspaces but relies on the underlying dimensions of the solution space. Experiments with Software Engineering (SE) models shows that SWAY’s performance improvement is competitive with standard MOEAs while, terminating over an order of magnitude faster.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use these NSGA-II and SPEA2 since, in his survey of the SSBE literature in the period 2004 to 2013, Sayyad [24] found 25 different algorithms. Of those, NSGA-II [7] or SPEA2 [32] were used four times as often as anything else. For comments on newer algorithms (NSGA-III and MOEA/D) see our Future Work section.
References
Boehm, B., Turner, R.: Using risk to balance agile and plan-driven methods. Computer 36, 57–66 (2003)
Boehm, B.W., Horowitz, E., Madachy, R., Reifer, D., Clark, B.K., Steece, B., Winsor Brown, A., Chulani, S., Abts, C.: Software Cost Estimation with COCOMO II. Prentice Hall, Upper Saddle River (2000)
Boehm, B., Turner, R.: Balancing Agility and Discipline: A Guide for the Perplexed. Addison-Wesley Longman Publishing Co., Inc., Boston (2003)
Cannings, T.I., Samworth, R.J.: Random projection ensemble classification. arXiv preprint arXiv:1504.04595 (2015)
Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: 40th ACM Symposium on Theory of Computing (2008)
Dasgupta, S., Sinha, K.: Randomized partition trees for nearest neighbor search. Algorithmica 72(1), 237–263 (2015)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2000)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multi-Objective Optimization. TIK report 1990, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, July 2001
Durrant, R.J., Kabán, A.: Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions. In: Asian Conference on Machine Learning (2013)
Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. CRC, Boca Raton (1993)
Faloutsos, C., Lin, K.-I. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: ACM SIGMOD International Conference on Management of Data (1995)
Ghotra, B., McIntosh, S., Hassan, A.E.: Revisiting the impact of classification techniques on the performance of defect prediction models. In: 37th IEEE International Conference on Software Engineering, May 2015
Joseph Krall. Faster Evolutionary Multi-Objective Optimization via GALE, the Geometric Active Learner. Ph.d thesis, West Virginia University (2014). http://goo.gl/u8ganF
Krall, J., Menzies, T., Davies, M.: Gale: geometric active learning for search-based software engineering. IEEE Trans. Softw. Eng. 41(10), 1001–1018 (2015)
McFee, B., Lanckriet, G.: Large-scale music similarity search with spatial trees. In: 12th International Society for Music Information Retrieval Conference (2011)
Menzies, T., El-Rawas, O., Hihn, J., Feather, M., Madachy, R., Boehm, B.: The business case for automated software engineerng. In: 22nd IEEE/ACM International Conference on Automated Software Engineering (2007)
Menzies, T., Williams, S., El-Rawas, O., Baker, D., Boehm, B., Hihn, J., Lum, K., Madachy, R.: Accurate estimates without local data? Softw. Process Improv. Pract. 14, 213–225 (2009)
Menzies, T., Williams, S., El-Rawas, O., Boehm, B., Hihn, J.: How to avoid drastic software process change (using stochastic stability). In: 31st International Conference on Software Engineering (2009)
Mittas, N., Angelis, L.: Ranking and clustering software cost estimation models through a multiple comparisons algorithm. IEEE Trans. Softw. Eng. 39(4), 537–551 (2013)
Mkaouer, W., Kessentini, M., Bechikh, S., Deb, K., Cinnelde, M.O. High dimensional search-based software engineering: finding tradeoffs among 15 objectives for automating software refactoring using NSGA-III. In: ACM Genetic and Evolutionary Computation Conference (2014)
Port, D., Olkov, A., Menzies, T.: Using simulation to investigate requirements prioritization strategies. In: 23rd International Conference on Automated Software Engineering (2008)
Reed, P., Kollat, J.B., Devireddy, V.K.: Using interactive archives in evolutionary multiobjective optimization: a case study for long-term groundwater monitoring design. Environ. Model. Softw. 22(5), 683–692 (2007)
Sayyad, A., Ingram, J., Menzies, T., Ammar, H. Scalable product line configuration: a straw to break the camel’s back. In: 28th International Conference on Automated Software Engineering (2013)
Sayyad, A., Ammar, H.: Pareto-optimal search-based software engineering (POSBSE): a literature survey. In: 2nd International Workshop on Realizing Artificial Intelligence Synergies in Software Engineering (2013)
Sayyad, A.S., Menzies, T., Ammar, H.: On the value of user preferences in search-based software engineering: a case study in software product lines. In: 35th International Conference for Software Engineering (2013)
Tantithamthavorn, C., McIntosh, S., Hassan, A.E., Matsumoto, K.: Automated parameter optimization of classification techniques for defect prediction models. In: 38th International Conference on Software Engineering (2016)
Vargha, A., Delaney, H.D.: A critique and improvement of the CL common language effect size statistics of McGraw and Wong. J. Educ. Behav. Stat. 25(2), 101–132 (2000)
Wang, T., Harman, M., Jia, Y., Krinke, J.: Searching for better configurations: a rigorous approach to clone evaluation. In: 9th Joint Meeting on Foundations of Software Engineering, ACM (2013)
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Zhang, Y., Harman, M., Mansouri, S.A.: The multi-objective next release problem. In: ACM Genetic and Evolutionary Computation Conference (2007)
Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30217-9_84
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou, K., Fogarty, T. (eds.) Evolutionary Methods for Design Optimisation, and Control. CIMNE, Barcelona (2002)
Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms — a comparative case study. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292–301. Springer, Heidelberg (1998). doi:10.1007/BFb0056872
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Nair, V., Menzies, T., Chen, J. (2016). An (Accidental) Exploration of Alternatives to Evolutionary Algorithms for SBSE. In: Sarro, F., Deb, K. (eds) Search Based Software Engineering. SSBSE 2016. Lecture Notes in Computer Science(), vol 9962. Springer, Cham. https://doi.org/10.1007/978-3-319-47106-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-47106-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47105-1
Online ISBN: 978-3-319-47106-8
eBook Packages: Computer ScienceComputer Science (R0)