Journal of Intelligent & Fuzzy Systems - Volume 46, issue 4

Authors: Chen, Zhipeng | Liu, Xiao | Qin, Jianhua

Article Type: Research Article

Abstract: To solve the problem that the walking jitter of quadruped robots leads to the degradation of clarity of visual imaging, a quadruped robot visual imaging jitter compensation algorithm based on the theory of walking jitter is proposed. The D-H coordinate transformation method is used to establish the coordinate system of each joint of the leg. The kinetic equations of the leg are derived from the relationship between the rotational velocity and the moment of the leg joint, and the kinetic equilibrium equations of the quadruped robot body are established based on the spatial moment equilibrium theorem; the spring-mass model of …the leg of the quadruped robot is used to construct the kinetic equations of the leg jittering, and the kinetic equations of the body jittering are derived using the moment equilibrium condition of the body center of gravity position and under the effect of the leg and body jitter to obtain the visual imaging device jitter quantity; finally, the tremor quantity is combined with the jitter quantity and rotation matrix to derive the walking jitter mathematical model of the quadruped robot visual imager, and the jitter compensation algorithm of quadruped robot visual imager is verified. The experimental results show that compared with the traditional Wiener filter algorithm for jitter compensation and the BP neural network jitter compensation algorithm, this algorithm improves the visual imaging by 10.8% and 3.3% in the two evaluation indexes of peak signal-to-noise ratio and structural similarity, respectively, and the de-jittering effect is better. Show more

Keywords: Quadruped robot, visual imaging, walking jitter, compensation algorithm

DOI: 10.3233/JIFS-235345

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8771-8782, 2024

Authors: Xiong, Haoyu | Yang, Leixin | Fang, Gang | Li, Junwei | Xiang, Yu | Zhang, Yaping

Article Type: Research Article

Abstract: Test-time augmentation (TTA) has become a widely adopted technique in the computer vision field, which can improve the prediction performance of models by aggregating the predictions of multiple augmented test samples without additional training or hyperparameter tuning. While previous research has demonstrated the effectiveness of TTA in visual tasks, its application in natural language processing (NLP) tasks remains challenging due to complexities such as varying text lengths, discretization of word elements, and missing word elements. These unfavorable factors make it difficult to preserve the label invariance of the standard TTA method for augmented text samples. Therefore, this paper proposes a …novel TTA technique called Defy, which combines nearest-neighbor anomaly detection algorithm and an adaptive weighting network architecture with a bidirectional KL divergence entropy regularization term between the original sample and the aggregated sample, to encourage the model to make more consistent and reliable predictions for various augmented samples. Additionally, by comparing with Defy, the paper further explores the problem that common TTA methods may impair the semantic meaning of the text during augmentation, leading to a shift in the model’s prediction results from correct to corrupt. Extensive experimental results demonstrate that Defy consistently outperforms existing TTA methods in various text classification tasks and brings consistent improvements across different mainstream models. Show more

Keywords: Test-time augmentation, test-time robustification, text classification, language model, anomaly detection

DOI: 10.3233/JIFS-236010

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8783-8798, 2024

Authors: Vijaya Lakshmi, A. | Vaitheki, K. | Suresh Joseph, K.

Article Type: Research Article

Abstract: Over the years, numerous optimization problems have been addressed utilizing meta-heuristic algorithms. Continuing initiatives have always been to create and develop new, practical algorithms. This work proposes a novel meta-heuristic approach employing the slender Loris optimization algorithm (SLOA), miming slender Loris behavior. The behavior includes foraging, hunting, migration and communication with each other. The ultimate goal of the devised algorithm is to replicate the food-foraging behaviour of Slender Loris (SL) and the quick movement of SL when threatened (i.e.) their escape from predators and also mathematically modelled the special communication techniques of SL using their urine scent smell. SLOA modelled …SL’s slow food foraging behaviour as the exploitation phase, and moving between the tree and escaping from a predator is modelled as the exploration phase. The Eyesight of slender Loris plays a vital role in food foraging during nighttime in dim light. The operator’s Eyesight is modelled based on the angle of inclination of SL. The urine scent intensity is used here to be instrumental in preventing already exploited territory activities, which improves algorithm performance. The suggested algorithm is assessed and tested against nineteen benchmark test operations and evaluated for effectiveness with standard widely recognized meta-heuristics algorithms. The result shows SLOA performing better and achieving near-optimal solutions and dominance in exploration–exploitation balance in most cases than the existing state-of-the-art algorithms. Show more

Keywords: Slender loris optimization algorithm, exploitation and exploration, optimization problems, swarm intelligence algorithm, metaheuristic

DOI: 10.3233/JIFS-236737

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8799-8810, 2024

Authors: Chen, Junzhuo | Lu, Zonghan | Kang, Shitong

Article Type: Research Article

Abstract: In the wake of the global spread of monkeypox, accurate disease recognition has become crucial. This study introduces an improved SE-InceptionV3 model, embedding the SENet module and incorporating L2 regularization into the InceptionV3 framework to enhance monkeypox disease detection. Utilizing the Kaggle monkeypox dataset, which includes images of monkeypox and similar skin conditions, our model demonstrates a noteworthy accuracy of 96.71% on the test set, outperforming conventional methods and deep learning models. The SENet module’s channel attention mechanism significantly elevates feature representation, while L2 regularization ensures robust generalization. Extensive experiments validate the model’s superiority in precision, recall, and F1 score, …highlighting its effectiveness in differentiating monkeypox lesions in diverse and complex cases. The study not only provides insights into the application of advanced CNN architectures in medical diagnostics but also opens avenues for further research in model optimization and hyperparameter tuning for enhanced disease recognition. Show more

Keywords: CNN, InceptionV3, SENet, L2 regularization, monkeypox disease, deep learning

DOI: 10.3233/JIFS-237232

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8811-8828, 2024

Authors: Zhou, Yinwei | Hu, Jun

Article Type: Research Article

Abstract: The rough set model has been extended to interval rough number decision systems, but the existing studies do not consider interval rough number decision systems with missing values. To this end, a rough set model of incomplete interval rough number decision systems (IIRNDSs) is proposed, and its uncertainty measures are investigated. Firstly, the similarity of two incomplete interval rough numbers (IIRNs) are defined by calculating their optimistic and pessimistic distances of the lower and upper approximation intervals of IIRNs. Then, the rough sets in IIRNDSs are constructed by the induced similarity relation. Next, four uncertainty measures, including approximation accuracy, approximation …roughness, conditional entropy, and decision rough entropy are given, which exhibit a monotonic variation with changes in the size of attribute sets, α, and θ. Finally, the experimental results demonstrate the proposed rough set model of IIRNDSs is feasible and effective. Show more

Keywords: Incomplete interval rough number decision systems, interval rough number, similarity relation, uncertainty measure, rough sets

DOI: 10.3233/JIFS-237320

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8829-8843, 2024

Authors: Guo, Hong | Yang, Jin | Yang, Jun

Article Type: Research Article

Abstract: This paper proposes a method of using machine learning and an evolutionary algorithm to solve the flexible job shop problem (FJSP). Specifically, a back propagation (BP) neural network is used as the machine learning method, the most widely used genetic algorithm (GA) is employed as the optimized object to address the machine-selection sub-problem of the FJSP, and particle swarm optimization (PSO) is utilized to solve the operation-order sub-problem of the FJSP. At present, evolutionary algorithms such as the GA, PSO, ant colony algorithm, simulated annealing algorithm, and their optimization algorithms are widely used to solve the FJSP; however, none of …them optimizes the initial solutions. Because each of these algorithms only focuses on solving a single FJSP, they can only use randomly generated initial solutions and cannot determine whether the initial solutions are good or bad. Based on these standard evolutionary algorithms and their optimized versions, the JSON object was introduced in this study to cluster and reconstruct FJSPs such that the machine learning strategies can be used to optimize the initial solutions. Specifically, the BP neural networks are trained so that the generalization of BP neural networks can be used to judge whether the initial solutions of the FJSPs are good or bad. This approach enables the bad solutions to be filtered out and the good solutions to be maintained as the initial solutions. Extensive experiments were performed to test the proposed algorithm. They demonstrated that it was feasible and effective. The contribution of this approach consists of reconstructing the mathematical model of the FJSP so that machine learning strategies can be introduced to optimize the algorithms for the FJSP. This approach seems to be a new direction for introducing more interesting machine learning methodologies to solve the FJSP. Show more

Keywords: Flexible job shop scheduling problem, mechanical engineering, evolutionary algorithms, machine learning

DOI: 10.3233/JIFS-224021

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8845-8863, 2024

Authors: Wang, Tianxiong | Xu, Mengmeng | Yang, Liu | Zhou, Meiyu | Sun, Xin

Article Type: Research Article

Abstract:  Kansei Engineering (KE) is a product design method that aims to develop products to meet users’ emotional preferences. However, traditional KE faces the problem that the acquisition of Kansei factors does not represent the real consumers demands based on manual and reports, and using traditional methods to calculate relationship between Kansei factors and specific design elements, which can lead to the omission of key information. To address these problems, this study adopts text mining and backward propagation neural networks (BPNN) to propose a product form design method from a multi-objective optimization perspective. Firstly, Term Frequency-Inverse Document Frequency (TF-IDF) and WordNet …are used to extract key user Kansei requirements from online review texts to obtain more accurate Kansei knowledge. Secondly, the BPNN is used to establish the non-linear relationship between product Kansei factors and specific design elements, and a preference mapping prediction model is constructed. Finally, BPNN is transformed into an iterative prediction value of non-dominated sorting genetic algorithm-II (NSGA-II), and the model is solved through multi-objective evolutionary algorithm (MOEA) to obtain the Pareto optimal solution set that satisfies the user’s multiple emotional needs, and the fuzzy Delphi method is used to obtain the best product form design scheme that meets the user’s multiple emotional images. Using the example of electric bicycle form design could show that this proposed method can effectively complete multi-objective product solutions innovation design. Show more

Keywords: Text mining, Back propagation neural network (BPNN), Multi-objective evolutionary algorithm (MOEA), Non-dominated sorting genetic algorithm-II (NSGA-II), Kansei engineering

DOI: 10.3233/JIFS-230668

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8865-8885, 2024

Authors: Maleki, Monavareh | Ebrahimi, Mohamad | Davvaz, B.

Article Type: Research Article

Abstract: The concept of entropy and information gain of BE-algebras in scientific disciplines such as information theory, data science, supply chain and machine learning assists us to calculate the uncertanity of the scientific processes of phenomena. In this respect the notion of filter entropy for a transitive BE-algebra is introduced and its properties are investigated. The notion of a dynamical system on a transitive BE-algebra is introduced. The concept of the entropy for a transitive BE-algebra dynamical system is developed and, its characteristics are considered. The notion of equivalent transitive BE-algebra dynamical systems is defined, and it is proved the fact …that two equivalent BE-algebra dynamical systems have the same entropy. Theorems to help calculate the entropy are given. Specifically, a new version of Kolmogorov– Sinai Theorem has been proved. The study introduces the concept of information gain of a transitive BE-algebra with respect to its filters and investigates its properties. This study proposes the use of filter entropy to approximate the level of risk introduced by a BE-algebra dynamical system. This aim is reached by defining the information gain with respect to the filters of a BE-algebra. This methodology is well developed for use in engineering, especially in industrial networks. This paper proposes a novel approach to assess the quantity of uncertainty, and the impact of information gain of a BE-algebra dynamical system. Show more

Keywords: Generator, transitive BE-algebra, dynamical system, entropy, information gain

DOI: 10.3233/JIFS-232363

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8887-8901, 2024

Authors: Ma, Ping | Ni, Zhengwei

Article Type: Research Article

Abstract: Time series forecasting has a wide range of applications in various fields. To eliminate the need for time series data volume, a meta-learning-based few-shot time series forecasting method is proposed. This method uses a residual stack module as its backbone and connects the residuals forward and backward through a multilayer fully connected network so that the model and the meta-learning framework can be seamlessly combined. The Empirical knowledge of different time-sequence tasks is obtained through meta-training. To enable fast adaptation to new prediction tasks, a small meta-network is introduced to adaptively and dynamically generate the learning rate and weight decay …coefficient of each step in the network. This method can use sequences of different data distribution characteristics for cross-task learning, and each training task only needs a small number of time series to achieve sequence prediction for the target task. The results show that compared with the two baselines, the proposed method has improved performance on 67.07% and 58.53% of the evaluated tasks. Thus, this method can effectively alleviate the problems caused by insufficient data during training and has broad application prospects in the field of time series. Show more

Keywords: Time series forecasting, few-shot learning, meta learning, residual stack model

DOI: 10.3233/JIFS-233520

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8903-8916, 2024

Authors: Gul, Rimsha | Bashir, Maryam

Article Type: Research Article

Abstract: As the volume of data continues to grow, the significance of text classification is on the rise. This vast amount of data majorly exists in the form of texts. Effective data preparation is essential to extract sentiment data from this vast amount of text, as irrelevant and redundant information can impede valuable insights. Feature selection is an important step in the data preparation phase as it eliminates irrelevant and insignificant features from the huge features set. There exist a large body of work related to feature selection for image processing but limited research is done for text data. While some …studies recognize the significance of feature selection in text classification, but there is still need for more efficient sentiment analysis models that optimize feature selection and reduce computational. This manuscript aims to bridge these gaps by introducing a hybrid multi-objective evolutionary algorithm as a feature selection mechanism, combining the power of multiple objectives and evolutionary processes. The approach combines two feature selection techniques within a binary classification model: a filter method, Information Gain (IG), and an evolutionary wrapper method, Binary Multi-Objective Grey Wolf Optimizer (BMOGWO). Experimental evaluations are conducted across six diverse datasets. It achieves a reduction of over 90 percent in feature size while improving accuracy by nearly nine percent. These results showcase the model’s efficiency in terms of computational time and its efficacy in terms of higher classification accuracy which improves sentiment analysis performance. This improvement can be beneficial for various applications, including recommendation systems, reviews analysis, and public opinion observation. However, it’s crucial to acknowledge certain limitations of this study. These encompass the need for broader classifier evaluation, and scalability considerations with larger datasets. These identified limitations serve as directions for future research and the enhancement of the proposed approach. Show more

Keywords: Feature selection, sentiment analysis, multi-objective optimization, evolutionary algorithms

DOI: 10.3233/JIFS-234615

Citation: Journal of Intelligent & Fuzzy Systems, vol. 46, no. 4, pp. 8917-8932, 2024