Explore the vast range of titles available.

Network traffic classification has become more important with the rapid growth of Internet and online applications. Numerous studies have been done on this topic which have led to many different approaches. Most of these approaches use predefined features extracted by an expert in order to classify network traffic. In contrast, in this study, we propose a deep learning -based approach which integrates both feature extraction and classification phases into one system. Our proposed scheme, called “Deep Packet,” can handle both traffic characterization in which the network traffic is categorized into major classes (e.g., FTP and P2P) and application identification in which identifying end-user applications (e.g., BitTorrent and Skype) is desired. Contrary to most of the current methods, Deep Packet can identify encrypted traffic and also distinguishes between VPN and non-VPN network traffic. The Deep Packet framework employs two deep neural network structures, namely stacked autoencoder (SAE) and convolution neural network (CNN) in order to classify network traffic. Our experiments show that the best result is achieved when Deep Packet uses CNN as its classification model where it achieves recall of 0.98 in application identification task and 0.94 in traffic categorization task. To the best of our knowledge, Deep Packet outperforms all of the proposed classification methods on UNB ISCX VPN-nonVPN dataset.

Parameter optimization is an important step for support vector regression (SVR), since its prediction performance greatly depends on values of the related parameters. To solve the shortcomings of traditional grid search algorithms such as too many invalid search ranges and sensitivity to search step, an improved grid search algorithm is proposed to optimize SVR for prediction. The improved grid search (IGS) algorithm is used to optimize the penalty parameter and kernel function parameter of SVR by automatically changing the search range and step for several times, and then SVR is trained for the optimal solution. The available of the method is proved by predicting the values of soil and plant analyzer development (SPAD) in rice leaves. To predict SPAD values more quickly and accurately, some dimension reduction methods such as stepwise multiple linear regressions (SMLR) and principal component analysis (PCA) are processed the training data, and the results show that the nonlinear fitting and prediction performance of accuracy of SMLR-IGS-SVR and PCA-IGS-SVR are better than those of IGS-SVR.

The selection of the mutation strategy for differential evolution (DE) algorithm plays an important role in the optimization performance, such as exploration ability, convergence accuracy and convergence speed. To improve these performances, an improved differential evolution algorithm with neighborhood mutation operators and opposition-based learning, namely NBOLDE, is developed in this paper. In the proposed NBOLDE, the new evaluation parameters and weight factors are introduced into the neighborhood model to propose a new neighborhood strategy. On this basis, a new neighborhood mutation strategy based on DE/current-to-best/1, namely DE/neighbor-to-neighbor/1, is designed in order to replace large-scale global mutation by local neighborhood mutation with high search efficiency. Then, a generalized opposition-based learning is employed to optimize the initial population and select the better solution between the current solution and reverse solution in order to approximate global optimal solution, which can amend the convergence direction, accelerate convergence, improve efficiency, enhance the stability and avoid premature convergence. Finally, the proposed NBOLDE is compared with four state-of-the-art DE variants by 12 benchmark functions with low-dimension and high-dimension. The experiment results indicate that the proposed NBOLDE has a faster convergence speed, higher convergence accuracy, and better optimization capabilities in solving high-dimensional complex functions.

This paper proposes an improved epsilon constraint-handling mechanism and combines it with a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). The proposed constrained multi-objective evolutionary algorithm (CMOEA) is named MOEA/D-IEpsilon. It adjusts the epsilon level dynamically according to the ratio of feasible to total solutions in the current population. In order to evaluate the performance of MOEA/D-IEpsilon, a new set of CMOPs with two and three objectives is designed, having large infeasible regions (relative to the feasible regions), and they are called LIR-CMOPs. Then, the 14 benchmarks, including LIR-CMOP1-14, are used to test MOEA/D-IEpsilon and four other decomposition-based CMOEAs, including MOEA/D-Epsilon, MOEA/D-SR, MOEA/D-CDP and CMOEA/D. The experimental results indicate that MOEA/D-IEpsilon is significantly better than the other four CMOEAs on all of the test instances, which shows that MOEA/D-IEpsilon is more suitable for solving CMOPs with large infeasible regions. Furthermore, a real-world problem, namely the robot gripper optimization problem, is used to test the five CMOEAs. The experimental results demonstrate that MOEA/D-IEpsilon also outperforms the other four CMOEAs on this problem.

Non-predictive or inaccurate weather forecasting can severely impact the community of users such as farmers. Numerical weather prediction models run in major weather forecasting centers with several supercomputers to solve simultaneous complex nonlinear mathematical equations. Such models provide the medium-range weather forecasts, i.e., every 6 h up to 18 h with grid length of 10–20 km. However, farmers often depend on more detailed short-to medium-range forecasts with higher-resolution regional forecasting models. Therefore, this research aims to address this by developing and evaluating a lightweight and novel weather forecasting system, which consists of one or more local weather stations and state-of-the-art machine learning techniques for weather forecasting using time-series data from these weather stations. To this end, the system explores the state-of-the-art temporal convolutional network (TCN) and long short-term memory (LSTM) networks. Our experimental results show that the proposed model using TCN produces better forecasting compared to the LSTM and other classic machine learning approaches. The proposed model can be used as an efficient localized weather forecasting tool for the community of users, and it could be run on a stand-alone personal computer.

Naïve Bayes (NB) is a well-known probabilistic classification algorithm. It is a simple but efficient algorithm with a wide variety of real-world applications, ranging from product recommendations through medical diagnosis to controlling autonomous vehicles. Due to the failure of real data satisfying the assumptions of NB, there are available variations of NB to cater general data. With the unique applications for each variation of NB, they reach different levels of accuracy. This manuscript surveys the latest applications of NB and discusses its variations in different settings. Furthermore, recommendations are made regarding the applicability of NB while exploring the robustness of the algorithm. Finally, an attempt is given to discuss the pros and cons of NB algorithm and some vulnerabilities, with related computing code for implementation.

Advances in information and communication technology have created innovator technologies such as cloud computing, Internet of Things, big data analysis and artificial intelligence. These technologies have penetrated production systems and converted them smart. However, this transformation did not only affect production systems, but also differentiated supplier selection processes. In the supplier selection process, the usage of new technologies along with traditional and green criteria extensively has been investigated in recent years. This paper aims to develop a new group decision-making approach based on Industry 4.0 components for selecting the best green supplier by integrating AHP and TOPSIS methods under the Pythagorean fuzzy environment. In the proposed approach, judgments of different experts are expressed by linguistic terms based on Pythagorean fuzzy numbers. The interval-valued Pythagorean Fuzzy AHP method is utilized to determine the criteria weights. The Pythagorean Fuzzy TOPSIS method based on the distances of suppliers is applied to obtain the ranking of the suppliers and determine the most suitable one. Finally, a real case study on an agricultural tools and machinery company is presented to indicate the effectiveness and accuracy of the proposed selection approach.

Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approximation-based algorithms. We also compare these algorithms based on different criteria such as metamodeling technique and evolutionary algorithm used, type and dimensions of the problem solved, handling constraints, training time and the type of evolution control. Furthermore, we identify and discuss some promising elements and major issues among algorithms in the literature related to using an approximation and numerical settings used. In addition, we discuss selecting an algorithm to solve a given computationally expensive multiobjective optimization problem based on the dimensions in both objective and decision spaces and the computation budget available.

Reasonable and effective assessment of express service quality can help express company discover its own shortcomings and overcome them, which is crucial significant to enhance its service quality. When considering the decision assessment of express company, the key issue that emerge powerful ambiguity. Pythagorean fuzzy set as an efficient math tool can capture the indeterminacy successfully. The major focus of this manuscript is to explore various interactive Hamacher power aggregation operators for Pythagorean fuzzy numbers. Firstly, we defined novel interactive Hamacher operation, on this basis we presented some Pythagorean fuzzy interactive Hamacher power aggregation operators such as Pythagorean fuzzy interactive Hamacher power average, weighted average (PFIHPWA), ordered weighted average, Pythagorean fuzzy interactive Hamacher power geometric, weighted geometric (PFIHPWG) and ordered geometric operators,respectively. Meanwhile, we verified their general properties and specific cases as well. The salient feature of proposed operators is that they can not only reduce the impact of negative data and consider the interactions between membership and nonmembership degrees, but also provide more general results through a parameter. Secondly, we defined a Pythagorean fuzzy entropy measure, and then establish a method to determine the attribute weights. Further, based on the conceived PFIHPWA and PFIHPWG operators we explored a novel approach to manage multiple attribute decision making problems. At last, the proposed techniques are carried out in a real application concerning on the assessment of express service quality to display the applicability and effectiveness, as well as the influence of changed parameters on the results. In addition, its advantages are displayed by a systematic comparison with relevant approaches.

The extensions of ordinary fuzzy sets such as intuitionistic fuzzy sets, Pythagorean fuzzy sets, and neutrosophic sets, whose membership functions are based on three dimensions, aim at collecting experts’ judgments more informatively and explicitly. In the literature, generalized three-dimensional spherical fuzzy sets have been introduced by Kutlu Gündoğdu and Kahraman (J Intell Fuzzy Syst 36(1):337–352, 2019a ), including their arithmetic operations, aggregation operators, and defuzzification operations. In this paper, our aim is to extend classical analytic hierarchy process (AHP) to spherical fuzzy AHP (SF-AHP) method and to show its applicability and validity through a renewable energy location selection example and a comparative analysis between neutrosophic AHP and SF-AHP.