scholarly journals Random Forest-based Fingerprinting Technique for Device-free Indoor Localization System

2021 ◽  
pp. 79-96
Author(s):  
Dwi Suroso ◽  
Refa Rupaksi ◽  
Aditya Krisnawan ◽  
Nur Siddiq
Keyword(s):  
Random Forest ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Random Forest Algorithm ◽  
K Nearest Neighbor ◽  
Received Signal Strength Indicator ◽  
Actual Measurement ◽  
Artificial Neural Network Ann ◽  
Device Free ◽  
Simple Parameter

The device-free indoor localization (DFIL) research is gaining attention due to the popularity of location-based service (LBS)-based advertisement. In DFIL, a user or an object does not need to bring any device to be localized. In this paper, we propose the Wi-Fi-based DFIL and the random forest algorithm for the fingerprint-based technique. The simple parameter commonly used in indoor localization is the Received Signal Strength Indicator (RSSI). We apply the fingerprint technique because of its reliability to handle the RSSI fluctuation and time-varying effect in a static indoor environment. We conducted an actual measurement campaign to observe the DFIL's implementation visibility. The DFIL system works by comparing the database fingerprint in an empty open office with the database in which a person is inside the measurement area without bringing any devices. Thus, we have the device-free RSSI database for fingerprint technique from both empty rooms and RSSI affected by a person inside the room. We validated the random forest algorithm results by comparing them with the k-nearest neighbor (kNN) and artificial neural network (ANN). The results show that our proposed system's accuracy is better than kNN and ANN with a mean error of 0.63 m than kNN with 0.80 m and ANN with 1.01 m. Meanwhile, the precision of the random forest is 0.63 m, whereas kNN and ANN are 0.67 m and 0.80 m, showing that the random forest performed better. We concluded that our simple DFIL system is visible to apply with acceptable accuracy performance.

scholarly journals Machine Learning Based Indoor Localization using Wi-Fi Fingerprinting

2019 ◽  
Vol 8 (3) ◽  
pp. 502-506
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
The Internet ◽  
Location Prediction ◽  
K Nearest Neighbor ◽  
Data Types ◽  
Specific Location ◽  
Web Access

The aim of indoor localization is to locate the objects inside a location wirelessly. This paper reports the models that predict the location along with floor and coordinates from the WAPs (Web Access Points) signal strengths of a user who connects to the internet at a specific location which had three locations. Starting with the cleaning of data, then assigning attributes into proper data types, making subset of dataset for each location, examining each column, and normalizing WAPs rows in order to build models. Different algorithms have been used to predict the location, floor, and coordinates of a logged in user. The models that have been used in this paper are k-Nearest Neighbor (k-NN) for location prediction, random forest for floor prediction and regression with k-NN for coordinate prediction.

scholarly journals Comparative analysis of classification algorithms for critical land prediction in agricultural cultivation areas

2020 ◽  
Vol 8 (4) ◽  
pp. 270-275
Author(s):  
Deden Istiawan
Keyword(s):  
Information System ◽  
Random Forest ◽  
Satellite Images ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Classification Algorithms ◽  
Random Forest Algorithm ◽  
K Nearest Neighbor

Currently, the identification of critical land, that has been physically, chemically, and biologically damaged, uses a geographic information system. However, it requires a high cost to get the high resolution of satellite images. In this study, a comparison framework is proposed to determine the performance of the classification algorithms, namely C.45, ID3, Random Forest, k-Nearest Neighbor, and Naïve Bayes. This research aims to find out the best algorithm for the classification of critical land in agricultural cultivation areas. The results show that the highest accuracy Random Forest algorithm was 93.10 % in predicting critical land, and the naïve Bayes has the lowest performance, with 89.32 % of accuracy in predicting critical land.

scholarly journals WiFi Indoor Localization with CSI Fingerprinting-Based Random Forest

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2869 ◽  
Author(s):  
Yanzhao Wang ◽  
Chundi Xiu ◽  
Xuanli Zhang ◽  
Dongkai Yang
Keyword(s):  
Random Forest ◽  
Nearest Neighbor ◽  
Indoor Localization ◽  
Multipath Fading ◽  
Wireless Channel ◽  
K Nearest Neighbor ◽  
Channel State ◽  
Memory Space ◽  
Positioning Systems ◽  
Localization Performance

WiFi fingerprinting indoor positioning systems have extensive applied prospects. However, a vast amount of data in a particular environment has to be gathered to establish a fingerprinting database. Deficiencies of these systems are the lack of universality of multipath effects and a burden of heavy workload on fingerprint storage. Thus, this paper presents a novel Random Forest fingerprinting localization (RFFP) method using channel state information (CSI), which utilizes the Random Forest model trained in the offline stage as fingerprints in order to economize memory space and possess a good anti-multipath characteristic. Furthermore, a series of specific experiments are conducted in a microwave anechoic chamber and an office to detail the localization performance of RFFP with different wireless channel circumstances, system parameters, algorithms, and input datasets. In addition, compared with other algorithms including K-Nearest-Neighbor (KNN), Weighted K-Nearest-Neighbor (WKNN), REPTree, CART, and J48, the RFFP method provides far greater classification accuracy as well as lower mean location error. The proposed method offers outstanding comprehensive performance including accuracy, robustness, low workload, and better anti-multipath-fading.

scholarly journals Random Forest Algorithm for Enhanced Prediction of Drug Target Interactions

2020 ◽  
Vol 9 (4) ◽  
pp. 2008-2012
Keyword(s):  
Random Forest ◽  
Drug Target ◽  
Nearest Neighbor ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Random Forest Algorithm ◽  
K Nearest Neighbor ◽  
In Vivo Experiments

Identification of drug-target interaction (DTI) is an important challenge for research and development in the pharmaceutical industry. Biomedicine researchers have stepped from in vitro and in vivo experiments to in-silico methods for fast results. In the recent past, machine learning algorithms have become very popular for DTI predictions. This paper presents an ensemble approach- Random forest algorithm for DTI predictions. The performance of proposed approach is evaluated with respect to Matrix factorization, genetic algorithm, Support vector machines, K-nearest neighbor, Decision Trees and Logistic Regression over 4 benchmark datasets with diverse properties. The algorithm is evaluated over Accuracy and average ranking. Results establish that random forest algorithm is more suitable or DTI predictions as compared to other algorithms.

scholarly journals Classification and Prediction of Student Academic Performance using Gray Wolf Optimization Based Relief-F Budget Random Forest

2019 ◽  
Vol 8 (3) ◽  
pp. 4411-4418
Keyword(s):  
Random Forest ◽  
Prediction Model ◽  
Student Performance ◽  
Nearest Neighbor ◽  
Gray Wolf ◽  
K Nearest Neighbor ◽  
Efficient Prediction ◽  
Ranking Order ◽  
Artificial Neural Network Ann ◽  
The University

The student academic prediction model helps to predict the student performance that helps the university to provide necessary care to the particular students. Efficient prediction model helps to encourage the student for better performance in the academic. In this research, the Relief-F Budget Tree Random Forest with Gray Wolf Optimization (RFBTRF-GWO) method is proposed for the feature selection. The Gray Wolf Optimization (GWO) helps to scale the relevant feature with ranking order from the features selected by the Relief-F Budget Tree Random Forest (RFBTRF). The selected features are given as input to the classifier for the effective prediction. The k-Nearest Neighbor (kNN) and Artificial Neural Network (ANN) are used for the classification. The proposed RFBTRF-GWO method is evaluated on the three datasets such as two UCI datasets and one collected dataset. The RFBTRF-GWO has a higher performance accuracy of 96.2 % while the existing method RFBTRF has an accuracy of 70.88 %.

scholarly journals Evaluation of Three Different Machine Learning Methods for Object-Based Artificial Terrace Mapping—A Case Study of the Loess Plateau, China

2021 ◽  
Vol 13 (5) ◽  
pp. 1021
Author(s):  
Hu Ding ◽  
Jiaming Na ◽  
Shangjing Jiang ◽  
Jie Zhu ◽  
Kai Liu ◽  
...  
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Loess Plateau ◽  
Water Conservation ◽  
Nearest Neighbor ◽  
Gradient Boosting ◽  
K Nearest Neighbor ◽  
The Loess Plateau ◽  
Object Based ◽  
Extreme Gradient Boosting

Artificial terraces are of great importance for agricultural production and soil and water conservation. Automatic high-accuracy mapping of artificial terraces is the basis of monitoring and related studies. Previous research achieved artificial terrace mapping based on high-resolution digital elevation models (DEMs) or imagery. As a result of the importance of the contextual information for terrace mapping, object-based image analysis (OBIA) combined with machine learning (ML) technologies are widely used. However, the selection of an appropriate classifier is of great importance for the terrace mapping task. In this study, the performance of an integrated framework using OBIA and ML for terrace mapping was tested. A catchment, Zhifanggou, in the Loess Plateau, China, was used as the study area. First, optimized image segmentation was conducted. Then, features from the DEMs and imagery were extracted, and the correlations between the features were analyzed and ranked for classification. Finally, three different commonly-used ML classifiers, namely, extreme gradient boosting (XGBoost), random forest (RF), and k-nearest neighbor (KNN), were used for terrace mapping. The comparison with the ground truth, as delineated by field survey, indicated that random forest performed best, with a 95.60% overall accuracy (followed by 94.16% and 92.33% for XGBoost and KNN, respectively). The influence of class imbalance and feature selection is discussed. This work provides a credible framework for mapping artificial terraces.

Quantifying the Influence of Achievement Emotions for Student Learning in MOOCs

2020 ◽  
pp. 073563312096731
Author(s):  
Bowen Liu ◽  
Wanli Xing ◽  
Yifang Zeng ◽  
Yonghe Wu
Keyword(s):  
Random Forest ◽  
Nearest Neighbor ◽  
Online Courses ◽  
Learning Performance ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Achievement Emotions ◽  
Integrative Framework ◽  
Emotional Interaction ◽  
Performance Results

Massive Open Online Courses (MOOCs) have become a popular tool for worldwide learners. However, a lack of emotional interaction and support is an important reason for learners to abandon their learning and eventually results in poor learning performance. This study applied an integrative framework of achievement emotions to uncover their holistic influence on students’ learning by analyzing more than 400,000 forum posts from 13 MOOCs. Six machine-learning models were first built to automatically identify achievement emotions, including K-Nearest Neighbor, Logistic Regression, Naïve Bayes, Decision Tree, Random Forest, and Support Vector Machines. Results showed that Random Forest performed the best with a kappa of 0.83 and an ROC_AUC of 0.97. Then, multilevel modeling with the “Stepwise Build-up” strategy was used to quantify the effect of achievement emotions on students’ academic performance. Results showed that different achievement emotions influenced students’ learning differently. These findings allow MOOC platforms and instructors to provide relevant emotional feedback to students automatically or manually, thereby improving their learning in MOOCs.

scholarly journals Similarity-based error prediction approach for real-time inflow forecasting

2013 ◽  
Vol 45 (4-5) ◽  
pp. 589-602 ◽  
Author(s):  
Mahmood Akbari ◽  
Abbas Afshar
Keyword(s):  
Real Time ◽  
Nearest Neighbor ◽  
Prediction Models ◽  
Error Prediction ◽  
K Nearest Neighbor ◽  
Forecasting Models ◽  
Main Challenge ◽  
Inflow Forecasting ◽  
Artificial Neural Network Ann ◽  
Prediction Approach

Regardless of extensive researches on hydrologic forecasting models, the issue of updating the outputs from forecasting models has remained a main challenge. Most of the existing output updating methods are mainly based on the presence of persistence in the errors. This paper presents an alternative approach to updating the outputs from forecasting models in order to produce more accurate forecast results. The approach uses the concept of the similarity in errors for error prediction. The K nearest neighbor (KNN) algorithm is employed as a similarity-based error prediction model and improvements are made by new data, and two other forms of the KNN are developed in this study. The KNN models are applied for the error prediction of flow forecasting models in two catchments and the updated flows are compared to those of persistence-based methods such as autoregressive (AR) and artificial neural network (ANN) models. The results show that the similarity-based error prediction models can be recognized as an efficient alternative for real-time inflow forecasting, especially where the persistence in the error series of flow forecasting model is relatively low.

Sign in / Sign up

Export Citation Format

Share Document