Search

General type-2 fuzzy logic systems have received wide concerns in current academic subject. Type-reduction is the kernel module for the systems. This paper shows the interpretations for the beginning of Karnik–Mendel (KM) algorithms. According to the famous numerical integration technique, the weighting approaches of enhanced Karnik–Mendel (EKM) algorithms are put forward. Then, the sensible beginning weighted enhanced Karnik–Mendel (SBWEKM) algorithms are put forward to perform the centroid type-reduction. Compared with the EKM algorithms, WEKM algorithms and SBEKM algorithms, this approach helps to improve both the absolute errors and convergence speeds as shown in four computer simulation experiments. [ABSTRACT FROM AUTHOR]

Academic institutions may be edging towards a global uncertainty, recession, and a string of financial difficulties. An effective course timetabling is one of managerial strategies to optimise the operating costs and resource utilisation. This paper presents the first application of firefly algorithm (FA) and its modifications and hybridisations for solving real-world course timetabling problem. A novel bi-objective firefly algorithm (BOFA) with Pareto dominance approach was developed for optimising the operating costs and resource utilisation. Random key technique was applied for adapting the continuous firefly movement to solve discrete timetabling problem. Five constructive heuristics were additionally embedded into the BOFA for initialising feasible timetables. Computational experiments were sequentially conducted using eleven problem instances obtained from a collaborating university. It was found that the proposed hybridisation outperformed particle swarm optimisation, the classical FA, and modified FA (MFA), in terms of the quality of the timetables obtained, computational times and convergent speed. The proposed hybrid bi-objective FA (HBOFA) yielded better Pareto frontiers than the conventional BOFA with less computational times for all problem instances. [ABSTRACT FROM AUTHOR]

Hyperparameter optimization plays a significant role in the overall performance of machine learning algorithms. However, the computational cost of algorithm evaluation can be extremely high for complex algorithm or large dataset. In this paper, we propose a model-based reinforcement learning with experience variable and meta-learning optimization method to speed up the training process of hyperparameter optimization. Specifically, an RL agent is employed to select hyperparameters and treat the k-fold cross-validation result as a reward signal to update the agent. To guide the agent's policy update, we design an embedding representation called "experience variable" and dynamically update it during the training process. Besides, we employ a predictive model to predict the performance of machine learning algorithm with the selected hyperparameters and limit the model rollout in short horizon to reduce the impact of the inaccuracy of the model. Finally, we use the meta-learning technique to pre-train the model for fast adapting to a new task. To prove the advantages of our method, we conduct experiments on 25 real HPO tasks and the experimental results show that with the limited computational resources, the proposed method outperforms the state-of-the-art Bayesian methods and evolution method. [ABSTRACT FROM AUTHOR]

In this paper, an improved particle swarm optimization (IPSO) algorithm is proposed to solve the technician routing and scheduling problem (TRSP). The TRSP consists of the assignment of technicians into teams, the assignment of teams to tasks, the construction of routes, and the selection of the day on which a service is provided by considering the proficiency level of workers and the proficiency requirement of the task. The paper considers the planning horizon as a multi-period covering 5 days, which further increases the complexity of the problem. Then a task can be fulfilled in any one of 5 days. The IPSO algorithm includes a particle swarm optimization (PSO) algorithm and one neighborhood operator. One neighborhood operator is used to avoid the local solution trap since the global best solution found by PSO is falling into a local solution trap. Further, the proposed algorithm's performance is experimentally compared with the branch-and-cut algorithm for the solution of the TRSP, on the benchmark instances generated from the literature. The computational results show that IPSO provides better solutions considering the branch-and-cut algorithm within reasonable computing time. [ABSTRACT FROM AUTHOR]

In the ensemble feature selection method, if the weight adjustment is performed on each feature subset used, the ensemble effect can be significantly different; therefore, how to find the optimized weight vector is a key and challenging problem. Aiming at this optimization problem, this paper proposes an ensemble feature selection approach based on genetic algorithm (EFS-BGA). After each base feature selector generates a feature subset, the EFS-BGA method obtains the optimized weight of each feature subset through genetic algorithm, which is different from traditional genetic algorithm directly processing single features. We divide the EFS-BGA algorithm into two types. The first is a complete ensemble feature selection method; based on the first, we further propose the selective EFS-BGA model. After that, through mathematical analysis, we theoretically explain why weight adjustment is an optimization problem and how to optimize. Finally, through the comparative experiments on multiple data sets, the advantages of the EFS-BGA algorithm in this paper over the previous ensemble feature selection algorithms are explained in practice. [ABSTRACT FROM AUTHOR]

This paper addresses the multi-objective optimization of water–rail–road (WRR) intermodal transport system under uncertainty by explicitly capturing intermodal hub operation activities. Through the use of hub-and-spoke-type network, we formulate an uncertain multi-objective programming model for the WRR intermodal transportation network design problem, in which the cost, time and reliability objectives are simultaneously considered. Subsequently, we turn the original model into a deterministic equivalent multi-objective programming model under mild assumptions. Eventually, we utilize the ε -constraint method to reformulate the crisp multi-objective programming model to a modified mono objective one, which has proven to be NP-hard. Hence, we develop a memetic algorithm (MA) by combining a genetic algorithm and local intensification to solve the proposed problem. When designing the MA, we propose a combination encoding scheme to represent the location of intermodal hubs, the allocation of the demand nodes and the assignment of transportation modes. Moreover, we provide two local intensification operators to enhance exploitation ability. Finally, we implement a series of numerical experiments based on the Turkish network data set to verify the practicability of the proposed model and effectiveness of the solution approach developed in the paper. [ABSTRACT FROM AUTHOR]

In this paper, a new U-shaped assembly line balancing problem is studied. For the first time, the criteria such as equipment cost, number of stations and activity performing quality level are considered to be optimized simultaneously by activity to station and worker to station decisions. For this aim, a multi-objective nonlinear formulation is proposed and its linearized version is also presented. Since, according to the literature, the U-shaped assembly line balancing problem with equipment requirements is an NP-hard problem, the problem of this study is NP-hard too. Because of this complexity, the classical algorithms like simulated annealing, variable neighborhood search, and classical genetic algorithm with a novel encoding/decoding scheme are used as solution approaches. As an extension, two hybrid versions of the proposed classical algorithms are proposed according to the characteristics of the problem. In order to evaluate the proposed meta-heuristics, because the problem is new, some test problems are generated randomly. Computational study of the paper, including sensitivity analysis of the proposed meta-heuristics and final experiments on the test problems, proves the superiority of the hybrid versions of the classical algorithms. [ABSTRACT FROM AUTHOR]

This paper deals with simultaneous scheduling of machines, automated guided vehicles (AGVs) and tools in a multi-machine flexible manufacturing system (FMS) considering the transfer times of jobs to minimize makespan (MSN). Only one copy of each type of tools is made available due to economic restrictions, and the tools are stored in a central tool magazine (CTM) that shares with and serves for several machines. Jobs and tools among machines are carried by AGVs and tool transporter (TT). This simultaneous scheduling problem is highly complex in nature as it involves job operations sequencing on machines, allocation of tools and AGVs to job operations and associated trip operations including the times of dead heading trip and loaded trip of AGVs. This paper presents a nonlinear mixed integer programming (MIP) formulation to model the combined scheduling of machines, AGVs and tools and a flower pollination algorithm (FPA) built on the flowers' pollination process for solving this simultaneous scheduling problem. The results indicate the proposed FPA is superior in terms of final solution quality, efficiency, convergence rate and robustness. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is among the best evolutionary algorithms for global optimization. However, the basic DE has several shortcomings, like the slow convergence speed, and it is more likely to be stuck at local optima. Additionally, DE's performance is sensitive to its mutation strategies and control parameters for mutation and crossover. In this scope, we present in this paper three mechanisms to overcome DE limitations. First, two novel mutations called DE/mean-current/2 and DE/best-mean-current/2 are proposed and integrated in the DE algorithm, and they have both exploration ability and exploitation trend. On the other hand, to avoid being trapped in local minima of hard functions, a new exploration operator has been proposed called Weibull flight based on the Weibull distribution. Finally, new adapted control parameters based on the Weibull distribution are integrated. These parameters contribute to the optimization process by adjusting mutation scale and alleviating the parameter setting problem often encountered in various metaheuristics. The efficacy of the proposed algorithms called meanDE, MDEW, AMDE, and AMDEW is validated through intensive experimentations using classical tests, some challenging tests, the CEC2017, CEC2020, the most recent CEC2022, four constraint engineering problems, and the data clustering problem. Moreover, comparisons with several popular, recent, and high-performance optimization algorithms show a high effectiveness of the proposed algorithms in locating the optimal or near-optimal solutions with higher efficiency. The experiments clearly indicate the effectiveness of the new mutations compared to the standard DE mutations. Moreover, the proposed Weibull flight has a great capacity to deal with the hard composition functions of CEC benchmarks. Finally, the use of adapted control parameters for the mutation scale helps overcome the parameter setting problem commonly encountered in various metaheuristics. [ABSTRACT FROM AUTHOR]

Association rule mining (ARM) is a widely used technique in data mining for pattern discovery. However, association rule mining in numerical data poses a considerable challenge. In recent years, researchers have turned to optimization-based approaches as a potential solution. One particular area of interest in numerical association rules mining (NARM) is controlling the length of itemset intervals. In this paper, we propose a novel evolutionary algorithm based on the multi-objective firefly algorithm for efficiently mining numerical association rules (MOFNAR). MOFNAR utilizes Balance, square of cosine (SOC) and comprehensibility as objectives of evolutionary algorithm to assess rules and achieve a rule set that is both simple and accurate. We introduce the Balance measure to effectively control the intervals of numerical itemsets and eliminate misleading rules. Furthermore, we suggest a penalty approach, and the crowding-distance method is employed to maintain high diversity. Experimental results on five well-known datasets show the effectiveness of our method in discovering a simple rule set with high confidence that covers a significant percentage of the data. [ABSTRACT FROM AUTHOR]

Evaluating large-scale multi-objective problems is usually time-consuming due to the vast number of decision variables. However, most of the existing algorithms for large-scale multi-objective optimization require a significant number of problem evaluations to achieve satisfactory results, which makes the optimization process very inefficient. To address this issue, a fast interpolation-based multi-objective evolutionary algorithm is proposed in this paper for solving large-scale multi-objective optimization problems with high convergence speed and accuracy. In the proposed algorithm, decision variables are generated based on a small number of variables using an interpolation function. With this approach, only a small number of variables need to be optimized, so that the convergence speed can be greatly improved to make it possible to obtain satisfactory results with relatively low computation cost. The experimental results verified the superiority of our proposed algorithm over other state-of-the-art algorithms in terms of convergence speed and convergence accuracy on 108 test instances with up to 1000 decision variables. [ABSTRACT FROM AUTHOR]

In this paper, a Pareto front (PF)-based sampling algorithm, PF-Voronoi sampling method, is proposed to solve computationally intensive multi-objective problems of medium size. The Voronoi diagram is introduced to classify the region containing PF prediction points into Pareto front cells (PFCs). Valid PFCs are screened according to the maximum crowding criterion (MCC), Maximum leave-one-out error criterion (MLEC), and maximum mean mean-square-error (MSE) criterion (MMMSEC). Sampling points are selected among the valid PFCs based on the Euclidean distance. The PF-Voronoi sampling method is applied to the coupled Kriging and NSGA-II models, and its validity is verified on the ZDT mathematical cases. The results show that the MCC criterion helps to improve the distribution diversity of PF. The MLEC criterion and the MMMSEC criterion reduce the number of training samples by 38.9% and 21.7%, respectively. The computational cost of the algorithm is reduced by more than 44.2%, compared to EHVIMOPSO and SAO-MOEA algorithms. The algorithm can be applied to multidisciplinary, multi-objective, and computationally intensive complex systems. [ABSTRACT FROM AUTHOR]

The strong generalized minimum label spanning tree problem (SGMLSTP) is to search the minimum label spanning tree (MLST) from an edge-labeled graph (ELG), in which each edge is associated with one or more labels. The SGMLSTP commonly exists in reality and is proven to be NP-hard. In recent years, researchers have proposed some algorithms; however, because the label coexistence relationship is not properly considered, high computing costs and lower efficiency are still severe obstacles, especially when the graphs are large. In this paper, we rewrite the SGMLSTP model and decompose the problem into two sub-problems: one is to search a connected sub-graph with minimum labels from the original graph, and the other is to search a spanning tree from the sub-graph. As the latter sub-problem is solved, we focus on the former and propose a community-based zigzag piloting algorithm. First, a label graph is derived from the original edge-labeled graph. Then, the label graph is partitioned, and some label community (or community combinations) is chosen to form an initial solution. Finally, the zigzag piloting process is applied to adjust the initial solution. Different from current algorithms that do not consider label coexistence relationships, the proposed algorithm partitions labels and finds the initial solution quickly; the zigzag piloting process improves the solution. Experimental results on typical benchmark datasets show better effectiveness and performance of our algorithm than that of the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Digital image technology is penetrating into various fields of people's life, and it has been very mature and can effectively store and transmit data. Moreover, there are still various researches on image recognition, the core of this technology. The algorithm is mainly based on computer technology to obtain the target image for different scene categories, thus completely replacing the traditional classification form. Because of the limitations of traditional identification technology, there are some problems in the actual use. It does not depend on the prior knowledge requirements and can carry out complex feature space division. In this paper, an image recognition computer system is established by introducing an improved neural network algorithm. The algorithm is designed and tested, and the results show it has lower image recognition error rate. Subsequently, this research result is applied to the actual scene for testing. The test results show that the improved neural network optimization algorithm can make the extracted features more accurately expressed in the image processing, which is more effective than the traditional algorithm. [ABSTRACT FROM AUTHOR]

Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results. [ABSTRACT FROM AUTHOR]

This paper focuses on seru scheduling problems considering the sequence-dependent setup time in seru production system, which is a new-type manufacturing system originated in Japanese production practice recently that can better adapt to the fluctuate market demand. A mixed integer programming (MIP) model with the objective of minimizing the sum of the makespan and the total weighted tardiness is constructed for the seru scheduling problem. The branch-and-bound (B&B) algorithm with two main steps is designed subsequently, where the first step solves the assignment of products to serus, while the second step solves the scheduling optimization in each seru. Finally, the computational experiments and comparative analysis with CPLEX 12.8 are made, and the report of results verifies that the effectiveness and practicability of the proposed MIP and B&B algorithm. [ABSTRACT FROM AUTHOR]

In response to the policy development, the manufacturing industry is undergoing intelligent technology transformation. Online orders are characterized by multiple varieties and small batches. Therefore, in order to meet the personalized needs of more customers, it is necessary to transform the traditional production mode into the intelligent factory mode. Intelligent factories can realize green and sustainable development. Using intelligent robot technology to complete programming to design and process is an important research direction in related fields. In this context, this study strives to design a unitary production scheduling algorithm, which is implemented based on artificial intelligence technology. After testing, this algorithm has the best performance, the shortest running time, relatively low power consumption and short product processing cycle. The system design framework includes three parts: the communication design between physical control equipment and PC, the interactive control software design of PC, and the virtual controlled object model design. From the research results, it can be concluded that the realization of production scheduling algorithm design for intelligent manufacturing cells can help enterprises to make rational allocation of order size and resources, so as to improve production efficiency while taking into account the low-carbon production concept widely promoted by the international community. In this paper, a kind of effective production scheduling algorithm is studied by introducing AI technology into the field of intelligent manufacturing cell. [ABSTRACT FROM AUTHOR]

Clustering is a fundamental task in the field of data analysis. With the development of deep learning, deep clustering focuses on learning meaningful representation with neural networks. Ensemble clustering algorithms combine multiple base partitions into a robust and better consensus clustering. Current deep ensemble clustering algorithms usually neglect shallow and original features. Besides, rarel algorithms use graph attention networks to explore clustering structures. This paper proposes a novel Clustering algorithm based on Multi-layer Features and Graph attention Networks (CMFGN). CMFGN obtains multi-layer features through the hierarchical convolutional layers. Moreover, CMFGN combines the co-association matrix with original features as the Graph Attention Networks (GAT) input to obtain consensus clustering, which reuses original information and leverages GAT to inherit a good clustering structure. Extensive experimental results show that CMFGN remarkably outputs competitive methods on four challenging image datasets. In particular, CMFGN achieves the ACC of 82.14% on the Digits dataset, which is almost up to 6% performance improvement compared with the best baseline. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things (IoT) has led to the spread of cloud computing devices in all commercial, industrial and agricultural sectors. The use of cloud computing environment services is increasing exponentially with all technology applications based on IoT. Fog computing has led to addressing issues in cloud computing environments. Fog computing reduces load balancing, processing, bandwidth, and storage as data file replication from the cloud to the network closest to sensors in different geographic locations. There are three critical issues:—what data should be replicated?—when should the data be replicated? and—where the new replicas should be placed? These three main open questions must be tackled for data replication in the cloud environments. This strategy, the identification and mode of the data replication problem are designed as a multi-objective optimization with modern meta-heuristic optimization method. Therefore, a new hybrid method using Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA) is proposed in this paper. Firstly, a new hybrid metaheuristic method, using the Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA), is proposed to handle the problem of selection and placement data replication in fog computing. Secondly, the Floyd algorithm is used to strategy the least cost path, distance, and data transmission in different geographic locations. The performance of the designed AOASSA strategy to tackling the data replication problem is evaluated using different datasets of different sizes. To validate the AOASSA strategy, a set of experiments was carried out to validate the proposed strategy AOASSA. Experiment results show the superiority of AOASSA over its competitors in terms of performance measures, such as least cost path, distance, and bandwidth. [ABSTRACT FROM AUTHOR]

Climate change and environmental protection have a significant impact on thermal plants. So, the main principles of combined economic-emission dispatch (CEED) problem are indeed to reduce greenhouse gas emissions and fuel costs. Many approaches have demonstrated their efficacy in addressing CEED problem. However, designing a robust algorithm capable of achieving the Pareto optimal solutions under its multimodality and non-convexity natures caused by valve ripple effects is a true challenge. In this paper, chaos-enhanced multi-objective tunicate swarm algorithm (CMOTSA) for CEED problem. To promote the exploration and exploitation abilities of the basic tunicate swarm algorithm (TSA), an exponential strategy based on chaotic logistic map (ESCL) is incorporated. Based on ESCL in CMOTSA, it can improve the possibility of diversification feature to search different areas within the solution space, and then, gradually with the progress of iterative process it converts to emphasize the intensification ability. The efficacy of CMOTSA is approved by applying it to some of multi-objective benchmarking functions which have different Pareto front characteristics including convex, discrete, and non-convex. The inverted generational distance (IGD) and generational distance (GD) are employed to assess the robustness and the good quality of CMOTSA against some successful algorithms. Additionally, the computational time is evaluated, the CMOTSA consumes less time for most functions. The CMOTSA is applied to one of the practical engineering problems such as combined economic and emission dispatch (CEED) with including the valve ripples. By using three different systems (IEEE 30-bus with 6 generators system, 10 units system and IEEE 118-bus with 14 generating units), the methodology validation is made. It can be stated for the large-scale case of 118-bus systems that the results of the CMOTSA are equal to 8741.3 $/h for the minimum cost and 2747.6 ton/h for the minimum emission which are very viable to others. It can be pointed out that the cropped results of the proposed CMOTSA based methodology as an efficient tool for CEED is proven. [ABSTRACT FROM AUTHOR]

The stability of a feature selection (FS) algorithm is one of the most crucial issues when working with a machine learning model. Until now, various stability measures based on a subset of features have been proposed. However, they lack consideration for feature ranking which is equally important to judge the robustness of algorithms. This paper proposes a novel frequency-based stability measure called rank stability (RSt) that evaluates FS algorithms on both criteria, i.e., subsets of features and feature rankings. The proposed measure evaluates the variation of feature rankings generated by FS algorithms after making a small perturbation to the training set. We mathematically justify the proposed measure based on the earlier and newly defined desirable properties. Additionally, we explore various heterogeneous ensemble techniques and compare them with traditional FS algorithms on real-world datasets. We perform extensive experiments to demonstrate that the heterogeneous ensemble techniques perform better than traditional FS algorithms with respect to the proposed measure and other performance metrics. [ABSTRACT FROM AUTHOR]

When evaluating the closeness between the decision matrix given by each expert and the overall decision matrix, we should pay more attention to the consistency of the ranking of candidates rather than the deviation degree of the scoring size. Therefore, in this paper, the modified cosine distance measure, instead of the Euclidean distance measure, is used to calculate the proximity between each expert decision matrix and the overall decision matrix. Furthermore, in order to receive more reasonable weights of experts, a new definition of coordinated expert weights in an optimization way is proposed. And then, the sequential quadratic programming (SQP) algorithm is used to derive the coordinated weights of experts, which is not affected by the selection of the initial value of expert weights and can objectively reflect the scoring level of each expert. Since different sorting methods would have inconsistent sorting results, a combined method based on SQP algorithm to derive the coordinated weights of different sorting methods is proposed to promote the ability of ranking the alternatives. Finally, numerical experiments are used to demonstrate the effectiveness of the SQP algorithm to derive coordinated expert weights with the modified cosine distance measure and the superiority of the combined method to rank alternatives. [ABSTRACT FROM AUTHOR]

This paper proposes a simple and effective optimization algorithm named as "Improved Rao (I-Rao) algorithm". The I-Rao algorithm consists of two phases: the local exploitation phase and the global exploration phase. The local exploitation phase improves the exploitation of the search process of Rao algorithms and enhances the algorithm's convergence speed. The global exploration phase helps the algorithm to get away from the local optimum solutions and enhances the exploration ability of the search process of the algorithm. Like Rao algorithms, the I-Rao algorithm also does not need algorithm-specific control parameters. The effectiveness of the I-Rao algorithm is tested on 25 unconstrained benchmark functions, 45 complex CEC test functions, and 19 real-world constrained mechanical design optimization problems of CEC2020. The comparison of results reveals the effectiveness of the I-Rao algorithm over many state-of-the-art advanced optimization algorithms such as GWO, SCA, PSO, WOA, Jaya, IJAYA, MJAYA, PGJAYA, EJAYA, IUDE, εMAgES, iLSHADEε, and COLSHADE. The Friedman test is also carried out to check the overall performance of the I-Rao algorithm as compared to other advanced optimization algorithms considered. The convergence plots illustrate the convergence speed of the I-Rao algorithm. [ABSTRACT FROM AUTHOR]

The paper deals with a truck scheduling and transshipment problem in a cross-docking terminal, with one inbound gate and one outbound gate. Each inbound truck carries one or more load units possibly of different commodities, and each outbound truck must be loaded with different commodities as well. The problem is to define the sequence of trucks at the inbound and outbound gates and the transshipment plan, so as to minimize the makespan of the whole process. We propose a Lagrangian relaxation scheme and a dual ascent method to optimize the Lagrangian dual that encloses three heuristics aimed at recovering feasible solutions for the problem at hand from the solution of the Lagrangian problem. Computational experiments are also provided, in order to evaluate the effectiveness of the Lagrangian approach. [ABSTRACT FROM AUTHOR]

Binary sequences with low aperiodic autocorrelation play an important role in communication and radar. The search of long low autocorrelation binary sequences (LABS) is a classical but challenging research problem. Exhaustive sequence search is infeasible for large lengths due to its prohibitively high complexity. Albeit many algorithms on LABS search in the literature, they are effective for lengths up to a few hundred only. In this paper, we propose an efficient hybrid algorithm which combines the strength of coordinate descent algorithm and the simulated annealing algorithm. Our proposed hybrid algorithm can efficiently generate long LABS of lengths up to several thousand and outperforms existing approaches in most cases. [ABSTRACT FROM AUTHOR]

With the development of science and technology and the improvement of people's quality of life, film and television animation has gradually become an important means to enrich people's daily entertainment and cultural exchanges. The inertial motion capture technology developed on the basis of motion capture has accelerated the development process of film and television animation, making film and television animation effects more colorful and precise in place. This paper presents a method of using inertial sensors to capture human arm motion. Using the quaternion information calculated by the inertial measurement unit, the positions of the joint points of the arm wrist, elbow and shoulder are obtained. The inertial data are transmitted to the host computer through the Bluetooth wireless communication method. The OptiTrack optical motion capture device with millimeter-level motion capture accuracy is used to obtain the position data of the human arm and use it as the reference position data. This paper analyzes the source of the zero-speed detection misdetection combined with experiments, and optimizes the detection algorithm based on the Laida criterion. On this basis, a complete trajectory capture Kalman filtering algorithm framework is constructed. Its embedded attitude depth correction module can effectively suppress the attitude of the angular error diverges. Finally, through physical experiments, the feasibility of the trajectory capture algorithm is verified in terms of accuracy and stability. The test shows that the trajectory capture algorithm described in this article can obtain a higher smoothness of the walking trajectory, so it can reduce the animation complex. The shaking of the human body model during the present process has important engineering significance. [ABSTRACT FROM AUTHOR]

The aim of this paper is to identify the co-expressed potential genes that may serve for the development of the portions of normal or tumor. This paper differentiates the co-expressed genes into normal samples and tumor samples from gene expression dataset GSE25066. Since the dataset has vague boundaries and having common characteristics between the clusters, identifying the subgroups contain similar gene expression is really a tricky task one. Therefore, this paper introduces an effective fuzzy iterative clustering algorithm by incorporating kernel function, possibilistic c-means, fuzzy memberships, neighborhood information, median of neighboring objects and penalty term. The performances of the proposed clustering techniques have been shown through the succession experimental works on GSE25066. The effects of clustering results have been proved through comparing the resulted classes with ground truth. [ABSTRACT FROM AUTHOR]

Formal concept analysis (FCA) is an unsupervised machine learning technique used for knowledge discovery and representation. A major task in FCA is the enumeration of the implications to construct the implication base. Even though there are many efficient classical and parallel algorithms proposed for constructing the implication base, the existing algorithms are not well suited for large formal contexts because of their architectural complexity. All the existing works use either stem-base or proper-premise approach to find the implication base in exponential time. Hence, we introduce a distributed algorithm to find the implication base quickly in larger datasets in polynomial time. In this paper, we propose a scalable algorithm to find the implication base using machine learning technique FP-growth, big data processing framework Apache Spark and executed on large formal contexts. Extensive experiments on the real-world datasets show that the proposed algorithm has an improved gain in performance metrics such as execution time, CPU and memory usage. The statistical validations on the experimental results prove that the proposed algorithm has the better potential to find the implication base. [ABSTRACT FROM AUTHOR]

The partner selection problem (PSP) is a key issue in constituting and reconfiguring strategic alliances. In this paper, we seek to address PSP under time, budget, activity precedence, and resource constraints. Multiple objectives are considered, our proposed approach simultaneously minimizing total cost and project duration while maximizing average quality. For these purposes, we present a novel multi-objective symbiotic organisms search for scheduling (MOSOSS). In this new algorithm, evolutionary operators are completely redesigned for combinatorial optimization. Furthermore, they are specifically adapted for scheduling problems. One notable original aspect of the new MOSOSS algorithm is that it evolves partial (incompletely scheduled) solutions. For this purpose, we propose evolutionary operators specially constructed to deal with both incomplete and complete schedules. Experimental results on randomly generated PSP instances show that MOSOSS offers a better coverage of the Pareto front as compared to the extant multiple objective symbiotic organisms search and NSGA-II. [ABSTRACT FROM AUTHOR]

The expanding approval of e-learning structure has made the need for the customized suggestion prototype which can be utilized to advance the successful learning condition for the learners. Customized suggestion model is a particular sort of data separating framework used to recognize a lot of articles that are applicable to a e-learners. In this paper, we mainly propose the efficient e-learning recommendation (EELR) system for user preferences using hybrid optimization algorithm (HOA). EELR system constructs a HOA with deep recurrent neural network (DRNN) and improved whale optimization (IWO) algorithm. First, DRNN is utilized to order the e-learner types dependent on these e-learner gatherings, clients can acquire course proposal from the gathering's persuasion. Thereafter, the conduct and the inclinations of the learners are examined via completing the mining of the arrangements watched every now and again by the IWO calculation. Rather than a learner effectively looking for data, recommender frameworks give counsel to students about articles they may wish to analyze. At last, the proposal of the e-learning depends on the appraisals comparing to these arrangements watched often. This proposed system is going to implement and validate in numerous e-learning entries against the client inclinations over some undefined time frame and demonstrated to be more proficiency and exactness contrasted with the customary recommender framework. This strategy can help learners to grasp the knowledge system and learning direction, and improve their learning efficiency. Observation results show that the proposed methodology empowers the asset suggestion to singular clients, which is started from different sources. [ABSTRACT FROM AUTHOR]

As one of the evolutionary algorithms, firefly algorithm (FA) has been widely used to solve various complex optimization problems. However, FA has significant drawbacks in slow convergence rate and is easily trapped into local optimum. To tackle these defects, this paper proposes an improved FA combined with extremal optimization (EO), named IFA-EO, where three strategies are incorporated. First, to balance the tradeoff between exploration ability and exploitation ability, we adopt a new attraction model for FA operation, which combines the full attraction model and the single attraction model through the probability choice strategy. In the single attraction model, small probability accepts the worse solution to improve the diversity of the offspring. Second, the adaptive step size is proposed based on the number of iterations to dynamically adjust the attention to the exploration model or exploitation model. Third, we combine an EO algorithm with powerful ability in local-search into FA. Experiments are tested on two group popular benchmarks including complex unimodal and multimodal functions. Our experimental results demonstrate that the proposed IFA-EO algorithm can deal with various complex optimization problems and has similar or better performance than the other eight FA variants, three EO-based algorithms, and one advanced differential evolution variant in terms of accuracy and statistical results. [ABSTRACT FROM AUTHOR]

Presently, the vast digitalization in industries and the advancement of Cyber-Physical systems in manufacturing provide a wide scope for creating an industrial value. To provide an efficient engineering technique, several organizational and technological disputes are to be analyzed. In recent years, there occurs a gradual intervention in networks, and communication that leads to a rapid enhancement in economic potential. This paper aims to propose a vulnerability model that utilizes a dual-stage min–max game for the resource allocation process of CPS. Moreover, a novel Improved Chaotic Elephant Herding Optimization (ICEHO) Algorithm is employed in the allocation of resources, thereby minimizing the damaged cost value. In ICEHO, the random parameters are chaotically tuned to obtain the best optimal value, thereby reducing several computational and complexity issues. In addition to this, the ICEHO is implemented in solving the nonlinear problems that occur during resource allocation. Also, the simulation results describe that the performances of the ICEHO approach provide enhanced system efficiency by using various nine chaotic mapping functions and test functions. [ABSTRACT FROM AUTHOR]

In neighborhood rough set theory, attribute reduction based on measure of information has important application significance. The influence of different decision classes was not considered for calculation of traditional conditional neighborhood entropy, and the improvement of algorithm based on conditional neighborhood entropy mainly includes of introducing multi granularity and different levels, while the mutual influence between samples with different labels is less considered. To solve this problem, this paper uses the supervised strategy to improve the conditional neighborhood entropy of three-layer granulation. By using two different neighborhood radii to adjust the mutual influence degree of different label samples, and by considering the mutual influence between conditional attributes through the feature complementary relationship, a neighborhood rough set attribute reduction algorithm based on supervised granulation is proposed. Experiment results on UCI data sets show that the proposed algorithm is superior to the traditional conditional neighborhood entropy algorithm in both aspects of reduction rate and reduction accuracy. Finally, the proposed algorithm is applied to the evaluation of fatigue life influencing factors of titanium alloy welded joints. The results of coupling relationship analysis show that the effect of joint type should be most seriously considered in the calculation of stress concentration factor. The results of influencing factors analysis show that the stress range has the highest weight among all the fatigue life influencing factors of titanium alloy welded joint. [ABSTRACT FROM AUTHOR]

Fluctuations in the output power of photovoltaic (PV) under climate changes such as variations in temperature and radiation is an important challenge for these resources. Therefore, it is very important to keep the output power of solar systems constant without any fluctuation at their maximum power point in the event of climate change. The aim of this paper is to suggest a maximum power point tracking (MPPT) method to cancel the output power oscillation of PV systems in severEe weather conditions, especially under radiation and temperature changes. In order to find the optimal parameters of the MPPT controller, the improved shuffled frog-leaping algorithm (ISFLA) and fuzzy controller are used. In addition, to fine-tune the member functions (MFs) of FLC, the combination of the fuzzy logic controller (FLC) and the ISFLA algorithm are employed. The ISFLA is an effective solution to cope with the stochastic behavior of the PV system under changing the radiation and ambient temperature. A storage system is also used to provide more stability and reliability for the system. Simulation results show that the recommended scheme provides excellent tracking efficiency from 98.1 to 99.6%. The case study under partial shading conditions also confirms the 16% improvement in the efficiency of the proposed method and more stability compared to the conventional P&O MPPT controller. [ABSTRACT FROM AUTHOR]

Wireless mesh networks are a special class of wireless networks that are implemented as a collection of radio nodes in a mesh pattern or topology. Unlike MANETs, the mobility of nodes is very less in the topology. Quality of service is an essential metric in the performance of mesh networks which are attributed to several parameters including optimal routing through shortest path, ability for other nodes to communicate even if a particular node in the mesh fails, minimization of packet loss and time delay, computational complexity and cost, energy. This research paper is focused toward minimization of energy taken as the objective function and a five-stage neural network is used and trained after optimizing with a genetic algorithm. The experiments have been conducted in NS2 and Qualnet environment with a varying number of mesh routers and energy computed. The performance of energy savings has been compared against conventional routing techniques like AODV and a bee colony optimization technique presented in the literature. An energy savings of 51% have been reported in the paper justifying the superiority of the hybrid G-ANN algorithm. [ABSTRACT FROM AUTHOR]

In this paper, the single-variable fuzzy polynomial equations are studied. We firstly define two solution types for the equations, called solution and r-cut solution. Then, sufficient and necessary conditions are proposed for existence of the solution and r-cut solution of the equations, respectively. Also, a new algorithm is designed to find all the solutions and r-cut solutions of the equations using algebraic computations. Based on Descartes' rule of signs, we express and prove a fuzzy version of fundamental theorem of algebra to obtain the number of real roots of a single-variable fuzzy polynomial. Moreover, we present an upper bound on the number of solutions of the equations and show that each single-variable fuzzy polynomial equation has at most two distinct solutions. [ABSTRACT FROM AUTHOR]

This paper presents a detailed study of the discrete particle swarm optimization algorithm (DPSO) applied to solve the dynamic traveling salesman problem which has many practical applications in planning, logistics and chip manufacturing. The dynamic version is especially important in practical applications in which new circumstances, e.g., a traffic jam or a machine failure, could force changes to the problem specification. The DPSO algorithm was enriched with a pheromone memory which is used to guide the search process similarly to the ant colony optimization algorithm. The paper extends our previous work on the DPSO algorithm in various ways. Firstly, the performance of the algorithm is thoroughly tested on a set of newly generated DTSP instances which differ in the number and the size of the changes. Secondly, the impact of the pheromone memory on the convergence of the DPSO is investigated and compared with the version without a pheromone memory. Moreover, the results are compared with two ant colony optimization algorithms, namely the MAX-MIN ant system (MMAS) and the population-based ant colony optimization (PACO). The results show that the DPSO is able to find high-quality solutions to the DTSP and its performance is competitive with the performance of the MMAS and the PACO algorithms. Moreover, the pheromone memory has a positive impact on the convergence of the algorithm, especially in the face of dynamic changes to the problem’s definition. [ABSTRACT FROM AUTHOR]

Machine learning (ML) algorithms, such as neural networks, random forest, and more recent deep learning, are illustrating their utility for waste recycling. The increasing computational power of ML makes waste generation prediction, even at municipal level, possible with satisfying accuracy. ML is so critical and efficient and yet it is severely under-researched in recycling business. Also, the ML application in the recycling business is still a niche area judged by the limitations in its literature sources, the research domains, the ML algorithms' use and benefits involved or reported in the literature. To unlock the value of ML in recycling business, this paper reviewed 51 related articles systematically and presents the current obstacles and future directions in applying ML to waste recycling industries. [ABSTRACT FROM AUTHOR]

The production function has always been an active field in the research and application of economics. Researchers generally use the production function of constant elasticity of substitution, i.e., the C–D (Cobb–Douglas) production function and the CES (Constant Elasticity of Substitution) production function, to explore economic growth, but rarely use the VES (Variable Elasticity of Substitution) production function. The paper gives an extended VES production function model in the case the elasticity of substitution is a time linear function. With regard to the parameter estimation, the paper uses a modern intelligent algorithm, i.e., the PSO (Particle Swarm Optimization) algorithm. The conventional PSO algorithm has a low rate and the poor accuracy of convergence, so the paper proposes an improved PSO algorithm. In the final part, the paper calculates the contribution rates of influencing factors to Chinese economic growth, and the results are consistent with the actual situation. [ABSTRACT FROM AUTHOR]

Multi-objective evolutionary algorithms (MOEAs) have been successfully employed to solve many scientific and engineering problems. However, many algorithms perform ill in maintaining diversity and convergence simultaneously. In this paper, we devised a novel operator selection framework based on two collaborative indicators, generational distance (GD) and maximum spread (MS) to improve the diversity while maintaining a good convergence. By calculating the variation of GDs and MSs over the past 7 iterations, an instruction is conveyed to select a proper operator to execute next 7 iterations. This process is repeated until it reaches the maximum iteration. Two operators are embedded in this algorithm which are differential evolution operator (DE/rand/1) and our proposed crow search operator which is deemed to be efficient in explorating the search space. MOEA/D is utilized as the basis framework of our proposed algorithm. Experiments indicate that our proposed algorithm is valid and outperforms other famous algorithms in terms of diversity and convergence. In the end, a particular aeroengine maintenance scheduling problem is solved by our proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper considers a passive target localization problem based on the noisy time of arrival measurements obtained from multiple receivers and a single transmitter. The maximum likelihood (ML) estimator for this localization problem is formulated as a highly nonlinear and non-convex optimization problem, where conventional optimization methods are not suitable for solving such a problem. Consequently, this paper proposes an improved adaptive hybrid firefly differential evolution (AHFADE) algorithm, based on hybridization of firefly algorithm (FA) and differential evolution (DE) algorithm to estimate the unknown position of the target. The proposed AHFADE algorithm dynamically adjusts the control parameters, thus maintaining high population diversity during the evolution process. This paper aims to improve the accuracy of the global optimal solution by incorporating evolutionary operators of the DE in different searching stages of the FA. In this regard, an adaptive parameter is employed to select an appropriate mutation operator for achieving a proper balance between global exploration and local exploitation. In order to efficiently solve the ML estimation problem, this paper proposes the well-known semidefinite programming (SDP) method to convert the non-convex problem into a convex one. The simulation results obtained from the proposed AHFADE algorithm and well-known algorithms, such as SDP, DE and FA, are compared against Cramér–Rao lower bound (CRLB). The statistical analysis has been performed to compare the performance of the proposed AHFADE algorithm with several well-known algorithms on CEC2014 benchmark problems. The obtained simulation results show that the proposed AHFADE algorithm is more robust in high-noise environments compared to existing algorithms. [ABSTRACT FROM AUTHOR]

The Internet of Vehicles (IoV) is an Intelligent Transportation System, which in its turn is an application of the Internet of Things. The IoV is a network of connected vehicles that sends/receives messages. However, the moving nature of the vehicles in IoV networks raises a dynamic topology issue. Therefore, establishing effective and dependable communication pathways among vehicular nodes, contingent upon traffic density conditions, presents a growing challenge. As a result, the main contribution of this paper is to propose an efficient network optimization system involving a cluster-based network routing optimizer. The proposed method is a metaheuristic algorithm adapted as a clustering algorithm. For this purpose, the JAYA Algorithm (JAYA) was utilized and integrated with two clustering concepts extracted from K-means Clustering and Automatic Clustering, resulting in proposing JAYA Clustering Algorithm for IoV (JAYACIoV). Subsequently, the performance of the proposed algorithm was investigated utilizing 176 network testing scenarios, and extensive comparative evaluations were conducted against five algorithms from the literature. The results confirmed the superiority of the proposed system with a percentage of 64.82%, where the algorithms were ranked according to the percentage achievement of best results. [ABSTRACT FROM AUTHOR]

This paper proposes a new and improved one-dimensional chaotic system (1DL-SCS). After performance testing, it is verified to have better chaotic performance and a larger range of parameters. Based on this, a new image encryption algorithm is proposed. First, the chaotic sequences generated by the hyper-chaotic Chen system are used to perform twice circular rotations for achieving efficient global scrambling. Then we index scramble the image by row using 1DL-SCS and redistribute the pixel points by column, which further breaks the correlation between image pixels and prepares for diffusion. In the diffusion stage, the plaintext is divided into four parts for processing with the improved generalized Feistel structure, and the plaintext sequence in the round function is further divided into two parts, which greatly improves the diffusion efficiency. Through two rounds of iterative operations, a good diffusion effect can be achieved efficiently. Simulation experiment and performance analysis indicates that the algorithm has outstanding advantages such as excellent ciphertext statistical characteristics, and strong resistance to chosen plaintext attacks. [ABSTRACT FROM AUTHOR]

In recent years, the convergence of the Internet of Things (IoT) and machine learning technologies has instigated advancements in IoT, and machine learning has revolutionized SMEs, reshaping their role in regional economic growth. These technologies provide SMEs with innovative tools, fostering connectivity within regional ecosystems. This transformation is crucial for China's economic realignment in its 'new normal' phase, with enterprises driving social and economic progress. This study proposed the XGBoost algorithm and IoT data enhance collaboration among SMEs in regional economies, fostering innovation and driving economic development. The role of IoT and machine learning in promoting sustainable regional economic prosperity. Technological innovation is essential for enterprise survival and growth in a competitive landscape. This paper examines the influence of environmental factors and geography on economic development across China's regions. It focuses on SME coupling and coordination, contributing to regional economic progress through performance evaluation. IoT integration provides SMEs with abundant real-time data, enabling deep insights into customer behavior, supply chains, and production. Simultaneously, the XGBoost algorithm efficiently processes and extracts actionable insights from this data. Data from 11 provinces in the Yangtze River economic belt highlights Jiangsu Province's leadership in regional innovation performance for 2015 and 2020. The empirical results, grounded in datasets amalgamating information from these provinces, attest to the potential of this IoT and XGBoost-driven approach. Boasting an impressive accuracy rate of 91.7%, surpassing alternative machine learning techniques like SVM, KNN, DT, RF, and LR, this research underscores the effectiveness of this integrated strategy in optimizing SME operations. Additionally, it computes the coupling coordination degree, innovation environment ranking, mean value, and numerical changes from 2010 to 2020, with an average innovation coupling coordination degree of 0.1624 across 30 Chinese provinces. [ABSTRACT FROM AUTHOR]

This paper presents a solution for the security of few-detail images in real-time applications over open or unsecure networks depending on diffusion and confusion operations. The diffusion and confusion operations are both performed based on Henon and Baker chaotic maps. XOR and permutation operations are used to allow diffusion and confusion in the algorithm. In the proposed algorithm, a high-detail image is used as a key. The computer simulation results and security analysis are given to ensure the validity and strength of the proposed algorithm. In the security analysis, we have performed key-space analysis, cropping attack analysis, noise attack analysis, and differential attack analysis. Some statistical analyses based on entropy, histogram, and correlation coefficient estimation are also given to check the strength of the presented algorithm. [ABSTRACT FROM AUTHOR]

Spectral clustering has become a prevalent option for data clustering as it performs well on non-convex spatial datasets with sophisticated structures. The spectral clustering effects depend on the construction of the similarity graph matrix. In this paper, in order to further enhance the clustering performance, we propose a novel similarity measure function based on neighbor relations. The proposed method is called SC-NR. It uses the Gaussian kernel function to measure the similarity between two objects. Since Euclidean distance cannot fully reflect the relation between data, this method adds a weight related to the order of nearest neighbors to the distance between two points. The similarity is better expressed by weighted-Euclidean distance. In experiments, we compared the proposed method with the previous works via the external indexes, that is, clustering accuracy (ACC), normalized mutual information (NMI), and F-measure. The comparison of indexes with state-of-the-art methods demonstrates the superiority of our algorithm. The experiment includes six synthetic datasets and twelve real-world datasets. For instance, in the PenDigits dataset F-measure metric is 16.50% higher than the current algorithms. [ABSTRACT FROM AUTHOR]

Infrared small and dim target has posed great challenges on the target detection and tracking, especially for early warning, navigation and guidance. However, most common tracking algorithms are inefficient for infrared small target due to huge computation, and complicated feature analysis on such target is useless and needless. As such, a fast and useful algorithm based on the kernel correlation filter (KCF) is proposed in this paper. It supplies a solution for target without clear characteristic, target missing and analog interference in complex backgrounds. The proposed algorithm focuses on model update and scale update rules, fusion feature expression and multi-cues constrained re-detection module; all of the ideas aim to optimize process and improve practicability. Firstly, the improved ridge regression model with solving boundary effect and model consistency can get more precise results. Secondly, a useful strengthened feature description (SFD) including the fused feature extraction and complete confidence indicator is proposed to improve the reliability of tracking. Thirdly, the stabilized re-detection (SR) strategy is designed based on motion rules, which can cope with abnormal disturbance and missing states. Fourthly, an adaptive model update is proposed, which can reduce the error accumulation. The experiment results and the comparative studies with some common algorithms show that the proposed algorithm achieves the success rate of tracking above 98%, RMSE of center location below 5 pixels and speed above 120 fps and tends to be more effective. [ABSTRACT FROM AUTHOR]

Automatic generation control is extensively used to regulate power plants in a modern area of the power system network. In this paper, automatic generation and frequency control in interconnected power system is presented. A multisource such as thermal, hydro, and gas-based power plant is considered in this study, which is carried out by incorporating nonlinearity like generation rate constants, HVDC link, and the conventional PID controller design. Further, an optimal setting of the PID controller is performed by employing evolutionary, and metaheuristic algorithm-based approaches such as differential evolution and firefly algorithm, respectively. With these algorithms, the proposed model has been tested with their performance evaluation and comparison characteristics are discoursed. The robustness of the proposed controllers is assessed based on comparative analyses to regulate the interconnected power network's frequency profile under different loading conditions. The stability analysis is performed using the Eigen and Nyquist plots to assess the proposed controllers' efficacy. Besides, the frequency control study is summarized with comparative assessment through various performance indices such as settling time, peak overshoot and undershoots under different operating conditions. Finally, the proposed control scheme, in the interconnected power system, is validated through a real-time digital simulation platform, i.e., OPAL-RT 5142. The comparison of simulation and real-time results demonstrates the effectiveness of the FA-optimized PID controller in comparison with that of the DE-optimized PID controller. [ABSTRACT FROM AUTHOR]

In the private cloud data center, security participated a fundamental position amid the storage of a voluminous amount of information that is intended to share among various nodes. On the other hand, the challenges in moving object detection and movement-based sub-sequences are significant segments of numerous PC apparition functions that incorporate acknowledgment of objects, assessment of interchange, and manufacturing mechanization. In this paper, we propose to actualize hearty moving object detection and following calculation that can recognize quick-paced moving objects in an assortment of testing constant quick-moving applications like traffic reconnaissance, etc. For the detection of moving objects, we utilize a Gaussian Mixture Design Background Subtraction Methodology. To remove noise, morphological processes are concerned with the resultant forefront pretence. Kalman Filter is utilized for movement-based monitoring and the detected object functions carry out movement segmentation using a foreground detector. Ultimately, blob analysis recognizes clusters of associated picture elements that are known to be moving objects, and the values are stored in a private cloud data center. [ABSTRACT FROM AUTHOR]

A relation system, as an extension of information systems, is a significant form of representation and discovery of knowledge in rough set theory. Each relation system can induce a topological space. Topology is an invaluable tool for knowledge discovery in relation systems. In this paper, we use topological methods to study attribute reduction problems in relation systems. In the past studies, the topological reduction algorithm applied to arbitrary binary relations had not been proposed. To fill the gap, we propose the concept of topological reduction of relation systems based on binary relations without any other additional constraints. To identify all reductions, we define a discernibility matrix for this kind of reduction and develop its corresponding reduction algorithm. Finally, we conducted several experiments on five UCI datasets using six classification algorithms and two clustering algorithms to check our theoretical results. The experimental results show that our proposed algorithm is effective and practicable. [ABSTRACT FROM AUTHOR]