• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.154-161
• /
• 2018

As the number of smartphone users increases, research on indoor location recognition service is necessary. Access to indoor locations is predominantly WiFi, Bluetooth, etc., but in most quarters, WiFi is equipped with WiFi functionality, which uses WiFi features to provide WiFi functionality. The study uses the random forest algorithm, which employs the fingerprint index of the acquired WiFi and the use of the multI-value classification method, which employs the receiver signal strength of the acquired WiFi. As the data of the fingerprint, a total of 4 radio maps using the Mac address together with the received signal strength were used. The experiment was conducted in a limited indoor space and compared to an indoor location recognition system using an existing random forest, similar to the method proposed in this study for experimental analysis. Experiments have shown that the system's positioning accuracy as suggested by this study is approximately 5.8 % higher than that of a conventional indoor location recognition system using a random forest, and that its location recognition speed is consistent and faster than that of a study.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.3
• /
• pp.397-411
• /
• 2023

The number of deteriorated bridges with a service period of more than 30 years has been rapidly increasing in Korea. Accordingly, the importance of advanced maintenance technologies through the predictions of age-induced deterioration degree, condition, and performance of bridges is more and more noticed. The prediction method of the safety grade of bridges was proposed in this study using the classification models of the Decision Tree and the Random Forest based on machine learning. As a result of analyzing these models for the 8,850 bridges located in national roads with various evaluation indexes such as confusion matrix, balanced accuracy, recall, ROC curve, and AUC, the Random Forest largely showed better predictive performance than that of the Decision Tree. In particular, random under-sampling in the Random Forest showed higher predictive performance than that of other sampling techniques for the C and D grade bridges, with the recall of 83.4%, which need more attention to maintenance because of the significant deterioration degree. The proposed model can be usefully applied to rapidly identify the safety grade and to establish an efficient and economical maintenance plan of bridges that have not recently been inspected.

• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.165-172
• /
• 2015

The inactive student rate is becoming a major problem in most open universities worldwide. In Indonesia, roughly 36% of students were found to be inactive, in 2005. Data mining had been successfully employed to solve problems in many domains, such as for educational purposes. We are proposing a method for preventing inactive students by mining knowledge from student record systems with several state of the art ensemble methods, such as Bagging, AdaBoost, Random Subspace, Random Forest, and Rotation Forest. The most influential attributes, as well as demographic attributes (marital status and employment), were successfully obtained which were affecting student of being inactive. The complexity and accuracy of classification techniques were also compared and the experimental results show that Rotation Forest, with decision tree as the base-classifier, denotes the best performance compared to other classifiers.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.123-130
• /
• 2022

Recently, studies on the detection and classification of Android malware based on API Call sequence have been actively carried out. However, API Call sequence based malware classification has serious limitations such as excessive time and resource consumption in terms of malware analysis and learning model construction due to the vast amount of data and high-dimensional characteristic of features. In this study, we analyzed various classification models such as LightGBM, Random Forest, and k-Nearest Neighbors after significantly reducing the dimension of features using PCA(Principal Component Analysis) for CICAndMal2020 dataset containing vast API Call information. The experimental result shows that PCA significantly reduces the dimension of features while maintaining the characteristics of the original data and achieves efficient malware classification performance. Both binary classification and multi-class classification achieve higher levels of accuracy than previous studies, even if the data characteristics were reduced to less than 1% of the total size.

• Journal of the Korean Geotechnical Society
• /
• v.39 no.6
• /
• pp.5-12
• /
• 2023

Proactive assessment of landslide susceptibility is necessary for minimizing casualties. This study proposes a methodology for classifying the landslide safety factor using a classification algorithm based on machine learning techniques. The high-risk area model is adopted to perform the classification and eight geotechnical parameters are adopted as inputs. Four classification algorithms-namely decision tree, k-nearest neighbor, logistic regression, and random forest-are employed for comparing classification accuracy for the safety factors ranging between 1.2 and 2.0. Notably, a high accuracy is demonstrated in the safety factor range of 1.2~1.7, but a relatively low accuracy is obtained in the range of 1.8~2.0. To overcome this issue, the synthetic minority over-sampling technique (SMOTE) is adopted to generate additional data. The application of SMOTE improves the average accuracy by ~250% in the safety factor range of 1.8~2.0. The results demonstrate that SMOTE algorithm improves the accuracy of classification algorithms when applied to geotechnical data.

• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.355-362
• /
• 2016

Ensemble methods often help increase prediction ability in various predictive models by combining multiple weak learners and reducing the variability of the final predictive model. In this work, we demonstrate that ensemble methods also enhance the accuracy of prediction under kernel ridge regression and kernel logistic regression classification. Here we apply bagging and random forests to two kernel-based predictive models; and present the procedure of how bagging and random forests can be embedded in kernel-based predictive models. Our proposals are tested under numerous synthetic and real datasets; subsequently, they are compared with plain kernel-based predictive models and their subsampling approach. Numerical studies demonstrate that ensemble approach outperforms plain kernel-based predictive models.

• Journal of Korean Society of Forest Science
• /
• v.65 no.1
• /
• pp.68-73
• /
• 1984

The purpose of this paper was to figure out the efficiencies of two sampling techniques, a simple random sampling and a two-stage P.P.S. (probability proportional to size) sampling, in estimating the volume of the mature coniferous stands near Salzburg, Austria. With black-and-white infrared photographs at a scale 1:10,000, the following four classes were considered; non-forest, young stands less than 40 years, mature beech and mature coniferous stands. After the classification, a field survey was carried out using a relascope with a BAF (basal area factor) 4. For the simple random sampling, 99 points were sampled, while for the P.P.S. sampling, 75 points were sampled in the mature coniferous stands. The following results were obtained. 1) The mean standing coniferous volume estimate was $422.0m^3/ha$ for the simple random sampling and $433.5m^3/ha$ for the P.P.S. sampling method. However, the difference was not statistically significant. 2) The required number of sampling points for a 5% sampling error were 170 for the two stage P.P.S. sampling, but 237 for the simple random sampling. 3) The two stage P.P.S. method reduced field survey time by 17% as compared to the simple random sampling.

• Journal of Korea Multimedia Society
• /
• v.21 no.5
• /
• pp.617-625
• /
• 2018

Phishing website has become a crucial concern in cyber security applications. It is performed by fraudulently deceiving users with the aim of obtaining their sensitive information such as bank account information, credit card, username, and password. The threat has led to huge losses to online retailers, e-business platform, financial institutions, and to name but a few. One way to build anti-phishing detection mechanism is to construct classification algorithm based on machine learning techniques. The objective of this paper is to compare different classifier ensemble approaches, i.e. random forest, rotation forest, gradient boosted machine, and extreme gradient boosting against single classifiers, i.e. decision tree, classification and regression tree, and credal decision tree in the case of website phishing. Area under ROC curve (AUC) is employed as a performance metric, whilst statistical tests are used as baseline indicator of significance evaluation among classifiers. The paper contributes the existing literature on making a benchmark of classifier ensembles for web phishing detection.

• Journal of Multimedia Information System
• /
• v.5 no.2
• /
• pp.99-104
• /
• 2018

Phishing website has become a crucial concern in cyber security applications. It is performed by fraudulently deceiving users with the aim of obtaining their sensitive information such as bank account information, credit card, username, and password. The threat has led to huge losses to online retailers, e-business platform, financial institutions, and to name but a few. One way to build anti-phishing detection mechanism is to construct classification algorithm based on machine learning techniques. The objective of this paper is to compare different classifier ensemble approaches, i.e. random forest, rotation forest, gradient boosted machine, and extreme gradient boosting against single classifiers, i.e. decision tree, classification and regression tree, and credal decision tree in the case of website phishing. Area under ROC curve (AUC) is employed as a performance metric, whilst statistical tests are used as baseline indicator of significance evaluation among classifiers. The paper contributes the existing literature on making a benchmark of classifier ensembles for web phishing detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.9
• /
• pp.1153-1158
• /
• 2018

Online customer evaluations and social media information among a variety of information sources are critical for businesses as it influences the customer's decision making. There are limitations on the time and money that the survey will ask to identify a variety of customers' needs and complaints. The customer review data at online shopping malls provide the ideal data sources for analyzing customer sentiment about their products. In this study, we collected product reviews data on the smartphone of Samsung and Apple from Amazon. We applied five classification algorithms which are used as representative sentiment analysis techniques in previous studies. The five algorithms are based on support vector machines, bagging, random forest, classification or regression tree and maximum entropy. In this study, we proposed entropy score which can comprehensively evaluate the performance of classification algorithm. As a result of evaluating five algorithms using an entropy score, the SVMs algorithm's entropy score was ranked highest.