Sustainability Performance Assessment Using Self-Organizing Maps (SOM) and Classification and Ensembles of Regression Trees (CART)

Unveiling IoT Customer Behaviour: Segmentation and Insights for Enhanced IoT-CRM Strategies: A Real Case Study

In today's competitive landscape, achieving customer-centricity is paramount for the sustainable growth and success of organisations. This research is dedicated to understanding customer preferences in the context of the Internet of things (IoT) and employs a two-part modeling approach tailored to this digital era. In the first phase, we leverage the power of the self-organizing map (SOM) algorithm to segment IoT customers based on their connected device usage patterns. This segmentation approach reveals three distinct customer clusters, with the second cluster demonstrating the highest propensity for IoT device adoption and usage. In the second phase, we introduce a robust decision tree methodology designed to prioritize various factors influencing customer satisfaction in the IoT ecosystem. We employ the classification and regression tree (CART) technique to analyze 17 key questions that assess the significance of factors impacting IoT device purchase decisions. By aligning these factors with the identified IoT customer clusters, we gain profound insights into customer behaviour and preferences in the rapidly evolving world of connected devices. This comprehensive analysis delves into the factors contributing to customer retention in the IoT space, with a strong emphasis on crafting logical marketing strategies, enhancing customer satisfaction, and fostering customer loyalty in the digital realm. Our research methodology involves surveys and questionnaires distributed to 207 IoT users, categorizing them into three distinct IoT customer groups. Leveraging analytical statistical methods, regression analysis, and IoT-specific tools and software, this study rigorously evaluates the factors influencing IoT device purchases. Importantly, this approach not only effectively clusters the IoT customer relationship management (IoT-CRM) dataset but also provides valuable visualisations that are essential for understanding the complex dynamics of the IoT customer landscape. Our findings underscore the critical role of logical marketing strategies, customer satisfaction, and customer loyalty in enhancing customer retention in the IoT era. This research offers a significant contribution to businesses seeking to optimize their IoT-CRM strategies and capitalize on the opportunities presented by the IoT ecosystem.

Detecting the Minimum Limit on Wheat Stripe Rust in the Latent Period Using Proximal Remote Sensing Coupled with Duplex Real-Time PCR and Machine Learning

Wheat stripe rust (WSR) is an airborne disease that causes severe damage to wheat. The rapid and early detection of WSR is essential for the prevention and control of this disease. The minimum detection limit (MDL) is one of the most important characteristics of quantitative methods that can be used to determine the scope and applicability of a measurement technique. Three wheat cultivars were inoculated with Puccinia striiformis f.sp. tritici (Pst), and a spectrometer was used to collect the canopy hyperspectral data, and the Pst content was obtained via a duplex real-time polymerase chain reaction (PCR) during the latent period, respectively. The disease index (DI) and molecular disease index (MDI) were calculated. The regression tree algorithm was used to determine the MDL of the Pst based on hyperspectral feature parameters. The logistic, IBK, and random committee algorithms were used to construct the classification model based on the MDL. The results showed that when the MDL was 0.7, IBK had the best recognition accuracy. The optimal model, which used the spectral feature R_2nd.dv ((the second derivative of the original hyperspectral value)) and the modeling ratio 2:1, had an accuracy of 91.67% on the testing set and 90.67% on the 10-fold cross-validation. Thus, during the latent period, the MDL of Pst was determined using hyperspectral technology as 0.7.

Electroencephalography (EEG) eye state classification using learning vector quantization and bagged trees

The analysis of Electroencephalography (EEG) signals has been an effective way of eye state identification. Its significance is highlighted by studies that examined the classification of eye states using machine learning techniques. In previous studies, supervised learning techniques have been widely used in EEG signals analysis for eye state classification. Their main goal has been the improvement of classification accuracy through the use of novel algorithms. The trade-off between classification accuracy and computation complexity is an important task in EEG signals analysis. In this paper, a hybrid method that can handle multivariate signals and non-linear is proposed with supervised and un-supervised learning to achieve a fast EEG eye state classification with high prediction accuracy to provide real-time decision-making applicability. We use the Learning Vector Quantization (LVQ) technique and bagged tree techniques. The method was evaluated on a real-world EEG dataset which included 14976 instances after the removal of outlier instances. Using LVQ, 8 clusters were generated from the data. The bagged tree was applied on 8 clusters and compared with other classifiers. Our experiments revealed that LVQ combined with the bagged tree provides the best results (Accuracy = 0.9431) compared with the bagged tree, CART (Classification And Regression Tree) (Accuracy = 0.8200), LDA (Linear Discriminant Analysis) (Accuracy = 0.7931), Random Trees (Accuracy = 0.8311), Naïve Bayes (Accuracy = 0.8331) and Multilayer Perceptron (Accuracy = 0.7718), which demonstrates the effectiveness of incorporating ensemble learning and clustering approaches in the analysis of EEG signals. We also provided the time complexity of the methods for prediction speed (Observation/Second). The result showed that LVQ + Bagged Tree provides the best result for prediction speed (58942 Obs/Sec) in relation to Bagged Tree (28453 Obs/Sec), CART (27784 Obs/Sec), LDA (26435 Obs/Sec), Random Trees (27921), Naïve Bayes (27217) and Multilayer Perceptron (24163).

Parkinson’s Disease Diagnosis Using Laplacian Score, Gaussian Process Regression and Self-Organizing Maps

Parkinson’s disease (PD) is a complex degenerative brain disease that affects nerve cells in the brain responsible for body movement. Machine learning is widely used to track the progression of PD in its early stages by predicting unified Parkinson’s disease rating scale (UPDRS) scores. In this paper, we aim to develop a new method for PD diagnosis with the aid of supervised and unsupervised learning techniques. Our method is developed using the Laplacian score, Gaussian process regression (GPR) and self-organizing maps (SOM). SOM is used to segment the data to handle large PD datasets. The models are then constructed using GPR for the prediction of the UPDRS scores. To select the important features in the PD dataset, we use the Laplacian score in the method. We evaluate the developed approach on a PD dataset including a set of speech signals. The method was evaluated through root-mean-square error (RMSE) and adjusted R-squared (adjusted R²). Our findings reveal that the proposed method is efficient in the prediction of UPDRS scores through a set of speech signals (dysphonia measures). The method evaluation showed that SOM combined with the Laplacian score and Gaussian process regression with the exponential kernel provides the best results for R-squared (Motor-UPDRS = 0.9489; Total-UPDRS = 0.9516) and RMSE (Motor-UPDRS = 0.5144; Total-UPDRS = 0.5105) in predicting UPDRS compared with the other kernels in Gaussian process regression.