A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization ProblemsInternational Journal of Computational Intelligence Systems - Tập 7 - Trang 827-852 - 2014
Cigdem Alabas-Uslu, Berna Dengiz
This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem. For this purpose, a modified local search algorithm free from parameter tuning, called Self-Adaptive Local Search (SALS), is proposed for obtaining qualified solutions to combinatorial problems within reasonable amount of computer times. SALS is applied to several combinatorial optimization problems, namely, classical vehicle routing, permutation flow-shop scheduling, quadratic assignment, and topological design of networks. It is observed that self-adaptive structure of SALS provides implementation simplicity and flexibility to the considered combinatorial optimization problems. Detailed computational studies confirm the performance of SALS on the suit of test problems for each considered problem type especially in terms of solution quality.
Common Sports Injuries of Track and Field Athletes Using Cloud Computing and Internet of ThingsInternational Journal of Computational Intelligence Systems - Tập 16 - Trang 1-9 - 2023
Quantao He, Xiongfei Li, Wenjuan Li
Cloud computing and the Internet of Things (IoT), are popular technologies on the Internet. They can connect everything with the Internet and have a huge role in promoting social development. This paper aimed to conduct an in-depth study on the common sports injuries of track and field athletes by studying the related algorithms of cloud computing and the IoT, and selected the cluster analysis method, so that it can better serve the analysis of human movement. The problem studied in this paper is to find out how to improve the efficiency of clustering algorithms, especially the ability to process high-dimensional data. A motion algorithm system that is suitable for analyzing human sports injuries. This paper gave a general introduction to the cluster analysis algorithm in cloud computing and IoT, made a detailed analysis of the common sports injuries of track and field athletes, and applied the cluster analysis method to the analysis of human sports injuries. The basic principle is to use mathematical methods to quantitatively determine the relationship between samples based on their own attributes and certain similarity or difference indicators, and cluster the samples according to the degree of this relationship. The introduction of this method greatly enhances the efficiency of clustering algorithms, especially the ability to process high-dimensional data, which is suitable for analyzing human sports injuries. Based on the experiments in this paper, it can see that this paper took 70 track and field athletes from a high school as the research object, and conducted a more detailed analysis of the nature, location and causes of their common sports injuries. The computational and Internet of Things (IoT) based research method for common athletic injuries among track and field athletes proposed in this article is higher than the multi-level model method, with a speed of about 10% faster and an accuracy of 18% higher than the multi-level model method. The experimental results in this paper showed that using cloud computing and IoT as the basic methods to study common sports injuries of track and field athletes can obtain richer experimental data and make the analysis of results more scientific and credible, which has practical significance for the study of human sports injuries.
A Novel Fuzzy Rough Granular Neural Network for ClassificationInternational Journal of Computational Intelligence Systems - Tập 4 - Trang 1042-1051 - 2011
Avatharam Ganivada, Sankar K. Pal
A novel fuzzy rough granular neural network (NFRGNN) based on the multilayer perceptron using back-propagation algorithm is described for fuzzy classification of patterns. We provide a development strategy of knowledge extraction from data using fuzzy rough set theoretic techniques. Extracted knowledge is then encoded into the network in the form of initial weights. The granular input vector is presented to the network while the target vector is provided in terms of membership values and zeros. The superiority of NFRGNN is demonstrated on several real life data sets.
Learning Style Integrated Deep Reinforcement Learning Framework for Programming Problem Recommendation in Online Judge SystemInternational Journal of Computational Intelligence Systems -
Yuhui Xu, Qin Ni, Shuang Liu, Yifei Mi, Yangze Yu, Yujia Hao
AbstractExercise recommendation is an integral part of enabling personalized learning. Giving appropriate exercises can facilitate learning for learners. The programming problem recommendation is a specific application of the exercise recommendation. Therefore, an innovative recommendation framework for programming problems that integrate learners’ learning styles is proposed. In addition, there are some difficulties to be solved in this framework, such as quantifying learning behavior, representing programming problems, and quantifying learning strategies. For the difficulties in quantifying learning behavior and quantifying learning strategies, a programming problem recommendation algorithm based on deep reinforcement learning (DRLP) is proposed. DRLP includes the specific design of action space, action-value Q-network, and reward function. Learning style is embedded into DRLP through action space to make recommendations more personalized. To represent the programming problem in DRLP, a multi-dimensional integrated programming problem representation model is proposed to quantify the difficulty feature, knowledge point feature, text description, input description, and output description of programming problems. In particular, Bi-GRU is introduced to learn texts’ contextual semantic association information from both positive and negative directions. Finally, a simulation experiment is carried out with the actual learning behavior data of 47,147 learners in the LUOGU Online Judge system. Compared with the optimal baseline model, the recommendation effect of DRLP has improved (HR, MRR, and Novelty have increased by 4.35%, 1.15%, and 1.1%), which proves the rationality of the programming problem representation model and action-value Q-network.
Pure linguistic PROMETHEE I and II methods for heterogeneous MCGDM problemsInternational Journal of Computational Intelligence Systems - Tập 8 - Trang 250-264 - 2015
M. Espinilla, N. Halouani, H. Chabchoub
The PROMETHEE methods basic principle is focused on a pairwise comparison of alternatives for each criterion, selecting a preference function type that often requires parameters in order to obtain a preference value. When a MCGDM problem is defined in an heterogeneous context, an adequate and common approach is to unify the involved information in linguistic values. However, for each criterion, there is a difficulty to select the specific preference function and define its parameters because they are expressed by crisp values in the unit interval, when the information involved in the problem has been unified into linguistic values. In this paper, a methodology for modeling linguistic preference functions in order to facilitate the selecting of each linguistic preference function type and the definition of its parameters is proposed, providing a more realistic definition of the criteria. Therefore, a generic linguistic preference function is proposed whose inputs and outputs are linguistic values. According to the generic linguistic preference function, six basic preference function types are extended for linguistic values. To do so, a linguistic difference function between linguistic values is defined, being its output, the input of the linguistic preference function. Furthermore, the proposed methodology is integrated in linguistic PROMETHEE I and II for heterogeneous MCGDM problems to obtain partial rankings and a full ranking of alternatives. So, the methodology provides pure linguistic PROMETHEE I and II that offer interpretability and understandability. Finally, the feasibility and applicability of pure linguistic PROMETHEE I and II are illustrated in a case study for the selection of a green supplier.
Bandwidth Prediction based on Nu-Support Vector Regression and Parallel Hybrid Particle Swarm OptimizationInternational Journal of Computational Intelligence Systems - - 2010
Liang Hu, Xilong Che, Xiaochun Cheng
This paper addresses the problem of generating multi-step-ahead bandwidth prediction. Variation of bandwidth is modeled as a Nu-Support Vector Regression (Nu-SVR) procedure. A parallel procedure is proposed to hybridize constant and binary Particle Swarm Optimization (PSO) together for optimizing feature selection and hyper-parameter selection. Experimental results on benchmark data set show that the Nu-SVR model optimized achieves better accuracy than BP neural network and SVR without optimization. As a combination of feature selection and hyper-parameter selection, parallel hybrid PSO achieves better convergence performance than individual ones, and it can improve the accuracy of prediction model efficiently.
WPMSD: A Malicious Script Detection Method Inspired by the Process of Immunoglobulin SecretionInternational Journal of Computational Intelligence Systems - Tập 4 - Trang 788-796 - 2011
Zhao hui, Chen wen, Zeng Jie, Shi Yuanquan, Qin Jian
Inspired by the process of immunoglobulin secretion in biological body, we present a Web Page Malicious Script Detection Method (WPMSD). In this paper, Firstly, the basic definitions of artificial immune items are given. Secondly, according to the spreading range of malicious script, the immunoglobulin number is changed as the detector clone proliferation is stimulated by malicious scripts. Further more, the nonlinear dynamics of antibody number is discussed. Thirdly, we propose a probability approach to trigger alarms to inform that the detected scripts are harmful. Finally, the WPMSD collects the effective immunoglobulin set based on Hidden Markov Model (HMM) to update the detector gene library. Compared with the traditional immune based detection methods, such as Negative Selection Algorithm (NSA), Dynamic Colonel Selection (DynamiCS), and Variable size Detector (V-detector), the false alarm rate of WPMSD has been reduced by 18.09%, 12.6%, and 7.47% respectively.
Detection of Serrated Adenoma in NBI Based on Multi-Scale Sub-Pixel ConvolutionInternational Journal of Computational Intelligence Systems - Tập 17 Số 1
Jiading Xu, Shuheng Tao, Chiye Ma
AbstractColorectal cancer ranks third in global malignancy incidence, and serrated adenoma is a precursor to colon cancer. However, current studies primarily focus on polyp detection, neglecting the crucial discrimination of polyp nature, hindering effective cancer prevention. This study established a static image dataset for serrated adenoma (SA) and developed a deep learning SA detection model. The proposed MSSDet (Multi-Scale Sub-pixel Detection) innovatively modifies each layer of the original feature pyramid’s structure to retain high-resolution polyp features. Additionally, feature fusion and optimization modules were incorporated to enhance multi-scale information utilization, leveraging the narrow-band imaging endoscope’s ability to provide clearer colonoscopy capillary and texture images. This paper utilized 639 cases of colonic NBI endoscopic images to construct the model, achieving a mean average precision (mAP) of 86.3% for SA in the test set. The SA detection rate via this approach has significantly surpassed conventional object detection methods.
Exponential stability analysis for delayed stochastic Cohen-Grossberg neural networkInternational Journal of Computational Intelligence Systems - Tập 3 Số 1 - Trang 96-102 - 2010
Wang, Guanjun, Liang, Jinling
In this paper, the exponential stability problems are addressed for a class of delayed Cohen-Grossberg neural networks which are also perturbed by some stochastic noises. By employing the Lyapunov method, stochastic analysis and some inequality techniques, sufficient conditions are acquired for checking the pth(p > 1) and the 1st moment exponential stability of the network. Finally, One example is given to show the effectiveness of the proposed results.
Simulation Analysis on Driving Behavior during Traffic Sign RecognitionInternational Journal of Computational Intelligence Systems - Tập 4 - Trang 353-360 - 2011
Lishan Sun, Liya Yao, Jian Rong, Jinyan Lu, Bohua Liu, Shuwei Wang
The traffic signs transfer trip information to drivers through vectors like words, graphs and numbers. Traffic sign with excessive information often makes the drivers have no time to read and understand, leading to risky driving. It is still a problem of how to clarify the relationship between traffic sign recognition and risky driving behavior. This paper presents a study that is reflective of such an effort. Twenty volunteers participated in the dynamic visual recognition experiment in driving simulator, and the data of several key indicators are obtained, including visual cognition time, vehicle acceleration and the offset distance from middle lane, etc. Correlations between each indicator above are discussed in terms of risky driving. Research findings directly show that drivers’ behavior changes a lot during their traffic sign recognition.