In the realm of data analysis and machine learning, achieving an optimal balance of feature importance, known as feature weighting, plays a pivotal role, especially when considering the nuanced interplay between the symmetry of data distribution and the need to assign differential weights to individual features. Also, avoiding the dominance of large-scale traits is essential in data preparation. This step makes choosing an effective normalization approach one of the most challenging aspects of machine learning. In addition to normalization, feature weighting is another strategy to deal with the importance of the different features. One of the strategies to measure the dependency of features is the correlation coefficient. The correlation between features shows the relationship strength between the features. The integration of the normalization method with feature weighting in data transformation for classification has not been extensively studied. The goal is to improve the accuracy of classification methods by striking a balance between the normalization step and assigning greater importance to features with a strong relation to the class feature. To achieve this, we combine Min–Max normalization and weight the features by increasing their values based on their correlation coefficients with the class feature. This paper presents a proposed Correlation Coefficient with Min–Max Weighted (CCMMW) approach. The data being normalized depends on their correlation with the class feature. Logistic regression, support vector machine, k-nearest neighbor, neural network, and naive Bayesian classifiers were used to evaluate the proposed method. Twenty UCI Machine Learning Repository and Kaggle datasets with numerical values were also used in this study. The empirical results showed that the proposed CCMMW significantly improves the classification performance through support vector machine, logistic regression, and neural network classifiers in most datasets.
Traditionally, water quality is evaluated using expensive laboratory and statistical procedures, making real-time monitoring ineffective. Poor water quality requires a more practical and cost-effective solution. Water pollution has been a severe issue, hurting water quality in recent years. Therefore, it is crucial to create a model that forecasts water quality to control water pollution and inform consumers in the event of the detection of poor water quality. For effective water quality management, it is essential to accurately estimate the water quality class. Motivated by these considerations, we utilize the benefits of machine learning methods to construct a model capable of predicting the water quality index and water quality class. This study aims to investigate the performance of machine learning models for multiclass classification in the Langat River Basin water quality assessment. Three machine learning models were developed using Artificial Neural Networks (ANN), Decision Trees (DT), and Support Vector Machines (SVM) to classify river water quality. Comparative performance analysis between the three models indicates that the SVM is the best model for predicting river water quality in this study. In addition, there is a statistically significant difference in performance between the SVM, DT, and ANN models at the 0.05 level of confidence. The use of the kernel function, the grid search method, and the multiclass classification technique used in this study significantly impacts the effectiveness of the SVM model. The findings bolster the idea that machine learning models, particularly SVM, can be used to forecast WQI with a high degree of accuracy, hence enhancing water quality management. Consequently, the model based on machine learning lowered the cost and complexity of calculating sub-indices of six water quality parameters and classifying water quality compared to the standard IKA-JAS formula.
29 September 2018 in International Journal on Advanced Science, Engineering and Information Technology
Unemployment is a current issue that happens globally and brings adverse impacts on worldwide. Thus, graduate employability is one of the significant elements to be highlighted in unemployment issue. There are several factors affecting graduate employability, traditionally, excellent academic performance (i.e., cumulative grade point average, CGPA) has been the most dominant element in determining an individual’s employment status. However, researches have shown that not only CGPA determines the graduate employability; in fact other factors may influence the graduate achievement in getting a job. In this work data mining techniques are used to determine what are the factors that affecting the graduates. Therefore, the objective of this study is to identify factors that influence graduates employability. Seven years of data (from 2011 to 2017) are collected through the Malaysia’s Ministry of Education tracer study. Total number of 43863 data instances involved in this employability class model development. Three classification algorithms, Decision Tree, Support Vector Machines and Artificial Neural Networks are used and being compared for the best models. The results show decision tree J48 produces higher accuracy compared to other techniques with classification accuracy of 66.0651% and it increased to 66.1824% after the parameter tuning. Besides, the algorithm is easily interpreted, and time to build the model is small which is 0.22 seconds. This paper identified seven factors affecting graduate employability, namely age, faculty, field of study, co-curriculum, marital status, industrial internship and English skill. Among these factors, attribute age, industrial internship and faculty contain the most information and affect the final class, i.e. employability status. Therefore, the results of this study will help higher education institutions in Malaysia to prepare their graduates with necessary skills before entering the job market.
The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its variants in various domains in the field and proved its value by conducting various literatures. In this paper, a comprehensive review of the SMA is introduced, which is based on 130 articles obtained from Google Scholar between 2022 and 2023. In this study, firstly, the SMA theory is described. Secondly, the improved SMA variants are provided and categorized according to the approach used to apply them. Finally, we also discuss the main applications domains of the SMA, such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, and image segmentation. This review presents some research suggestions for researchers interested in this algorithm, such as conducting additional research on multi-objective and discrete SMAs and extending this to neural networks and extreme learning machining.
Job Shop Scheduling Problem (JSSP) is a well-known NP-hard combinatorial optimization problem. In recent years, many scholars have proposed various metaheuristic algorithms to solve JSSP, playing an important role in solving small-scale JSSP. However, when the size of the problem increases, the algorithms usually take too much time to converge. In this paper, we propose a hybrid algorithm, namely EOSMA, which mixes the update strategy of Equilibrium Optimizer (EO) into Slime Mould Algorithm (SMA), adding Centroid Opposition-based Computation (COBC) in some iterations. The hybridization of EO with SMA makes a better balance between exploration and exploitation. The addition of COBC strengthens the exploration and exploitation, increases the diversity of the population, improves the convergence speed and convergence accuracy, and avoids falling into local optimum. In order to solve discrete problems efficiently, a Sort-Order-Index (SOI)-based coding method is proposed. In order to solve JSSP more efficiently, a neighbor search strategy based on a two-point exchange is added to the iterative process of EOSMA to improve the exploitation capability of EOSMA to solve JSSP. Then, it is utilized to solve 82 JSSP benchmark instances; its performance is evaluated compared to that of EO, Marine Predators Algorithm (MPA), Aquila Optimizer (AO), Bald Eagle Search (BES), and SMA. The experimental results and statistical analysis show that the proposed EOSMA outperforms other competing algorithms.