WASTU, KLAUS RAJENDRA (2024) COMPARISON BAGGING AND SUPPORT VECTOR MACHINE FOR CLASSIFICATION SOFTWARE REQUIREMENT. Skripsi thesis, UNIVERSITAS KATOLIK SOEGIJAPRANATA.
|
Text
20.K1.0036-KLAUS RAJENDRA WASTU_COVER_1.pdf Download (973kB) | Preview |
|
Text
20.K1.0036-KLAUS RAJENDRA WASTU_BAB I_1.pdf Restricted to Registered users only Download (973kB) |
||
Text
20.K1.0036-KLAUS RAJENDRA WASTU_BAB II_1.pdf Restricted to Registered users only Download (960kB) |
||
Text
20.K1.0036-KLAUS RAJENDRA WASTU_BAB III_1.pdf Restricted to Registered users only Download (1MB) |
||
Text
20.K1.0036-KLAUS RAJENDRA WASTU_BAB IV_1.pdf Restricted to Registered users only Download (1MB) |
||
Text
20.K1.0036-KLAUS RAJENDRA WASTU_BAB V_1.pdf Restricted to Registered users only Download (944kB) |
||
|
Text
20.K1.0036-KLAUS RAJENDRA WASTU_DAPUS_1.pdf Download (1MB) | Preview |
|
Text
20.K1.0036-KLAUS RAJENDRA WASTU_LAMPIRAN_1.pdf Restricted to Registered users only Download (1MB) |
Abstract
Software Requirements Specifications is a document that describes the requirements that occur in the development of a software system. The category of requirements is defined in two types: Functional Requirements (FR) and Non-Functional Requirements (NFR). Software Requirements Engineering is critical in successfully designing a piece of software. Many studies have examined the classification of software requirements using machine learning, but none have compared bagging algorithms with Support Vector Machine. This study compares text feature extraction techniques with machine learning algorithms Bagging and Support Vector Machine to solve the Software Requirement Classification problem. Using vectorization technique s from word2vec : Continuous Bag of Words and Skip-gram can help produce the best model performance for Bagging and SVM models. In this study, the data used is expansion data from the PROMISE repository, namely PROMISE_exp, the repository is a collection of software requirements data that has been labeled. To measure performance, this study uses an evaluation matrix, namely precision, recall and f1-score. As a result, the two models that have been trained using the Continuous Bag of Words and skip-gram vectorization techniques will be compared to determine the more optimal model for classifying software requirements from the promise_exp repository.
Item Type: | Thesis (Skripsi) |
---|---|
Subjects: | 000 Computer Science, Information and General Works |
Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
Depositing User: | Mr Yosua Norman Rumondor |
Date Deposited: | 05 May 2024 12:15 |
Last Modified: | 05 May 2024 12:15 |
URI: | http://repository.unika.ac.id/id/eprint/35291 |
Actions (login required)
View Item |