Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JOURNAL OF APPLIED INFORMATICS AND COMPUTING

Optimization of Random Forest Algorithm with Backward Elimination Method in Classification of Academic Stress Levels Amalia, Salsabila Dani; Barata, Mula Agung; Yuwita, Pelangi Eka
Journal of Applied Informatics and Computing Vol. 9 No. 3 (2025): June 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i3.9280

Abstract

Stress is a phenomenon experienced by all individuals as a natural response to pressure, which can impact mental and physical health. In an academic setting, the stress experienced by students is known as academic stress, which can affect their performance and mental well-being. Therefore, there is a need for effective prediction methods to aid in the management and prevention of academic stress. Therefore, there is a need to predict the level of academic stress to aid more effective management and prevention. This study uses a public dataset categorized based on the Student-life Stress Inventory (SSI), which includes psychological, physiological, social, environmental, and academic factors. Data mining is often used to detect diseases, one of which is the Random Forest algorithm. The Random Forest algorithm is applied as a classification technique for academic stress levels, with optimization using the Backward Elimination method for feature selection to improve model accuracy. The results showed that the accuracy of the Random Forest algorithm without feature selection obtained an accuracy of 86%, compared to the random forest algorithm with feature selection using the Backward Elimination method obtained a higher accuracy of 88%. This increase shows that the feature selection method can optimize model performance by selecting more relevant features. Thus, this research is expected to contribute to the management of student academic stress against the risk of academic stress.
A Improving House Price Clustering Results with K-means through the Implementation of One-hot Encoding Pre-processing Technique Maulani, Vicka Rizqi; Barata, Mula Agung; Yuwita, Pelangi Eka
Journal of Applied Informatics and Computing Vol. 9 No. 3 (2025): June 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i3.9481

Abstract

Basic human needs include a house that serves as a place to live and a shelter from everything. In Indonesia, owning a house is still a challenging aspect due to its high price. Information on house prices is needed for prospective buyers or consumers, so that buyers can adjust their needs and finances, and for producers or sellers it is used as a way to determine the segmentation of targeted market groups. House prices are influenced by several factors including, building area, number of bedrooms, number of bathrooms, location, condition and the presence of a garage. This research aims to improve the quality of house price clustering with K-means and the application of one-hot encoding in the data pre-processing process in representing categorical data. The dataset used has two types of data, namely numeric and categorical. The cluster evaluation is based on the silhouette score matrix and the determination of k is based on the elbow graph. The results showed an increase in the silhouette score value after applying one-hot encoding 0.15 which was previously 0.09, with the number of k = 3. The 0.15 matrix result is relatively low, which is caused by the overlap of house price values in the dataset, but it has been shown that one-hot encoding can represent categorical data well in the data pre-processing process so that the data can be processed with the k-means algorithm.