Sökning: onr:"swepub:oai:DiVA.org:lnu-126305" >
Optimized Machine L...
Optimized Machine Learning Input for Evolutionary Source Code to Architecture Mapping
-
- Olsson, Tobias, 1974- (författare)
- Linnéuniversitetet,Institutionen för datavetenskap och medieteknik (DM)
-
- Ericsson, Morgan, Docent, 1973- (författare)
- Linnéuniversitetet,Institutionen för datavetenskap och medieteknik (DM)
-
- Wingkvist, Anna, PhD, 1976- (författare)
- Linnéuniversitetet,Institutionen för datavetenskap och medieteknik (DM)
-
(creator_code:org_t)
- Springer, 2023
- 2023
- Engelska.
-
Ingår i: Software Architecture. ECSA 2022 Tracks and Workshops. ECSA 2022. - : Springer. - 9783031368882 - 9783031368899 ; , s. 421-435
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Automatically mapping source code to architectural modules is an interesting and difficult problem. Mapping can be considered a classification problem, and machine learning approaches have been used to automatically generate mappings. Feature engineering is an essential element of machine learning. We study which source code features are important for an algorithm to function effectively. Additionally, we examine stemming and data cleaning. We systematically evaluate various combinations of features on five datasets created from JabRef, TeamMates, ProM, and two Hadoop subsystems. The systems are open-source with well-established mappings. We find that no single set of features consistently provides the highest performance, and even the subsystems of Hadoop have varied optimal feature combinations. Stemming provided minimal benefit, and cleaning the data is not worth the effort, as it also provided minimal benefit.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Computer Science
- Datavetenskap
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas