An approach for optimized feature selection in Software Product Lines using union-find and genetic algorithms
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Abbas, Asad | - |
dc.contributor.author | Wu, Zhiqiang | - |
dc.contributor.author | Siddiqui, Isma farah | - |
dc.contributor.author | Lee, Scott uk jin | - |
dc.date.accessioned | 2021-06-22T18:05:13Z | - |
dc.date.available | 2021-06-22T18:05:13Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2016-05 | - |
dc.identifier.issn | 0974-6846 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/15647 | - |
dc.description.abstract | In Software Product Line (SPL), feature model is highly recommended to manage the commonalities and variability of features under resource constraints of mandatory, optional and alternative. Features with mandatory constraints and high in dependency with other features are identified as crosscutting concerns; reduce the reusability of resources. It is important to find and modularize these concerns at modeling level. With this practice, these concerns do not effect if deletion or addition is required from entire system. In this paper we have applied Union-find algorithm to find crosscutting concerns in feature model. We evaluated our approach by applying on an automobile feature model with various dependencies between features, and found required crosscutting concerns. By this approach, identification of crosscutting concerns and their modularization made easier. Further, we have also applied genetic algorithm to get optimized feature selection under cost constraint with high performance. In SPL, as crosscutting concerns are mandatory features with fix cost and performance, optimization on feature model is necessary under consideration of crosscutting concerns. Our approach found all possible products according to crosscutting concerns, cost and performance at modeling level of an automobile feature model. At last, we found all products from minimum to maximum cost with respect to least maximum performance by using GA optimization technique. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Indian Society for Education and Environment | - |
dc.title | An approach for optimized feature selection in Software Product Lines using union-find and genetic algorithms | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Scott uk jin | - |
dc.identifier.doi | 10.17485/ijst/2016/v9i17/92728 | - |
dc.identifier.scopusid | 2-s2.0-84970038577 | - |
dc.identifier.bibliographicCitation | Indian Journal of Science and Technology, v.9, no.17, pp.1 - 8 | - |
dc.relation.isPartOf | Indian Journal of Science and Technology | - |
dc.citation.title | Indian Journal of Science and Technology | - |
dc.citation.volume | 9 | - |
dc.citation.number | 17 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 8 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Feature model | - |
dc.subject.keywordAuthor | Genetic algorithm | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | Software Product Line | - |
dc.subject.keywordAuthor | Union-find algorithm | - |
dc.identifier.url | https://indjst.org/articles/an-approach-for-optimized-feature-selection-in-software-product-lines-using-union-find-and-genetic-algorithms | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.