•An enhanced genetic algorithm (EGA) is proposed to reduce text dimensionality.•The proposed EGA outperformed the traditional genetic algorithm.•The EGA is incorporated with six filter feature ...selection methods to create hybrid feature selection approaches.•The proposed hybrid approaches outperformed the single filtering methods.
This paper proposes hybrid feature selection approaches based on the Genetic Algorithm (GA). This approach uses a hybrid search technique that combines the advantages of filter feature selection methods with an enhanced GA (EGA) in a wrapper approach to handle the high dimensionality of the feature space and improve categorization performance simultaneously. First, we propose EGA by improving the crossover and mutation operators. The crossover operation is performed based on chromosome (feature subset) partitioning with term and document frequencies of chromosome entries (features), while the mutation is performed based on the classifier performance of the original parents and feature importance. Thus, the crossover and mutation operations are performed based on useful information instead of using probability and random selection. Second, we incorporate six well-known filter feature selection methods with the EGA to create hybrid feature selection approaches. In the hybrid approach, the EGA is applied to several feature subsets of different sizes, which are ranked in decreasing order based on their importance, and dimension reduction is carried out. The EGA operations are applied to the most important features that had the higher ranks. The effectiveness of the proposed approach is evaluated by using naïve Bayes and associative classification on three different collections of Arabic text datasets. The experimental results show the superiority of EGA over GA, comparisons of GA with EGA showed that the latter achieved better results in terms of dimensionality reduction, time and categorization performance. Furthermore, six proposed hybrid FS approaches consisting of a filter method and the EGA are applied to various feature subsets. The results showed that these hybrid approaches are more effective than single filter methods for dimensionality reduction because they were able to produce a higher reduction rate without loss of categorization precision in most situations.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UL, UM, UPCLJ, UPUK
Optical logic gates play a crucial role in all-optical signal processing systems. Traditional methods of designing logic gates require manual adjustment of structural parameters. In this paper, we ...utilize a genetic algorithm for inverse design, and the optical AND, OR, and NOT logic gates are achieved on a silicon platform at the working wavelength of 1.55 μm. The total area of the logic gates is fixed at 2.2 μm × 2.2 μm, convenient to be integrated with other functional devices, the optimized structural parameters are acquired for different logic gates and the contrast ratios of the OR, AND, and NOT gates are 8.55, 5.32, and 4.14 dB, respectively. The design is characterized by a compact structure, high contrast, and a high degree of freedom, offering a valuable reference for photonic integrated circuits.
•A compact optical logic gate with rectangular air hole array is designed and high performance is achieved.•The optimization efficiency was enhanced by GA, and optical logic gates were achieved with ultra-small size.•The influence of air hole’s variation to device’s performance was studied, and it guided the actual fabrication.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
A runtime analysis of the Simple Genetic Algorithm (SGA) for the OneMax problem has recently been presented proving that the algorithm with population size μ≤n1/8−ε requires exponential time with ...overwhelming probability. This paper presents an improved analysis which overcomes some limitations of the previous one. Firstly, the new result holds for population sizes up to μ≤n1/4−ε which is an improvement up to a power of 2 larger. Secondly, we present a technique to bound the diversity of the population that does not require a bound on its bandwidth. Apart from allowing a stronger result, we believe this is a major improvement towards the reusability of the techniques in future systematic analyses of GAs. Finally, we consider the more natural SGA using selection with replacement rather than without replacement although the results hold for both algorithmic versions. Experiments are presented to explore the limits of the new and previous mathematical techniques.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
Machine learning algorithms have been used widely in various applications and areas. To fit a machine learning model into different problems, its hyper-parameters must be tuned. Selecting the best ...hyper-parameter configuration for machine learning models has a direct impact on the model’s performance. It often requires deep knowledge of machine learning algorithms and appropriate hyper-parameter optimization techniques. Although several automatic optimization techniques exist, they have different strengths and drawbacks when applied to different types of problems. In this paper, optimizing the hyper-parameters of common machine learning models is studied. We introduce several state-of-the-art optimization techniques and discuss how to apply them to machine learning algorithms. Many available libraries and frameworks developed for hyper-parameter optimization problems are provided, and some open challenges of hyper-parameter optimization research are also discussed in this paper. Moreover, experiments are conducted on benchmark datasets to compare the performance of different optimization methods and provide practical examples of hyper-parameter optimization. This survey paper will help industrial users, data analysts, and researchers to better develop machine learning models by identifying the proper hyper-parameter configurations effectively.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
•A logistics distribution region partitioning model is developed.•This model is to minimize the cost of two-echelon logistics distribution network.•A hybrid algorithm with PSO and GA is proposed.•The ...empirical results reveal that EPSO–GA algorithm outperforms other algorithms.
Two-echelon logistics distribution region partitioning is a critical step to optimize two or multi-echelon logistics distribution network, and it aims to assign distribution unit to a certain logistics facility (i.e. logistic center and distribution center). Given the partitioned regions, vehicle routing problem can be further developed and solved. This paper established a model to minimize the total cost of the two-echelon logistics distribution network. A hybrid algorithm named as the Extended Particle Swarm Optimization and Genetic Algorithm (EPSO–GA) is proposed to tackle the model formulation. A two-dimensional particle encoding method is adopted to generate the initial population of particles. EPSO–GA combines the merits of Particle Swarm Optimization (PSO) algorithm and Genetic Algorithm (GA) with both global and local search capability. By updating the inertia weight and exchanging best-fit solutions and worst-fit solutions between PSO and GA, EPSO–GA algorithm is able to converge to an optimal solution with a reasonable design of termination and iteration rules. The computation results from a case study in Guiyang city, China, reveal that EPSO–GA algorithm is superior to the other three algorithms, Hybrid Particle Swarm Optimization (HPSO), GA, and Ant Colony Optimization (ACO), in terms of the partitioning schemes, the total cost and number of iterations. By comparing with the exact method, the proposed approach demonstrates its capability to optimize a small scale two-echelon logistics distribution network. The proposed approach can be readily implemented in practice to assist the logistics operators reduce operational costs and improve customer service. In addition, the proposed approach is of great potential to apply in other research domains.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UL, UM, UPCLJ, UPUK
Hydrodynamic models with rain-on-the-grid capabilities are usually computationally expensive for automatic parameter estimation. In this paper, we present a global optimization-based algorithm to ...calibrate a fully distributed hydrologic-hydrodynamic and water quality model (HydroPol2D) using observed data (i.e., discharge, or pollutant concentration) as input. The algorithm finds near-optimal set of parameters to explain observed gauged data. This framework, although applied in a poorly-gauged urban catchment, is adapted for catchments with more detailed observations. The results of the automatic calibration indicate NSE = 0.99 for the V-Tilted catchment, RMSE = 830 mg L-1 for salt concentration pollutograph in a wooden-plane (i.e., 8.3% of the event mean concentration), and NSE = 0.89 in a urban real-world catchment. This paper also explores the issue of equifinality (i.e., multiple parameters giving the same calibration performance) in model calibration indicating the performance variation of calibrating only with an outlet gauge or with multiple gauges within the catchment.
Display omitted
•An automatic calibration algorithm for distributed flood and water quality modeling is developed.•It uses HydroPol2D model and calibrate water quantity and quality parameters globally.•Data from observed gauges such as discharges, depths, and concentration is used for calibration.•Poorly placed gauges and low runoff events can increase equifinality during calibration.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
Mobile edge computing (MEC) plays a significant role in reducing network delay for Mobile Augmented Reality (MAR) services by caching these services close to the User Equipments (UEs). These MAR ...services collect UEs' network traffic and orientation information, and generate the service results back to UEs. However, the UE's mobility features change network traffic and orientation, negatively impacting MAR services' access frequencies and service preferences. Moreover, the changed access frequencies also influence the workload of cached MAR services, resulting in the uneven workload of edge servers. Therefore, this paper formalizes cooperative service caching based on UEs' location and orientation to optimize network delay and response fairness in MEC environments. To solve the problem, we propose a Service Caching strategy based on Regional Mobility features Awareness (SCRMA) algorithm, which consists of two stages. Firstly, the Regional Mobility features Awareness (RMA) algorithm perceives the user mobility features and service preferences, which provides a prerequisite for determining service caching strategy. Then, a Service Caching strategy based on a Genetic Algorithm (SCGA) is proposed to optimize network delay and response fairness. The simulation experiment on a real dataset shows that our service caching strategy averagely reduces network delay, fairness factor, and total cost by 11.49%, 33.24%, and 17.86% compared with the existing algorithms, respectively.
To overcome the disadvantages of traditional genetic algorithms, which easily fall to local optima, this paper proposes a hybrid genetic algorithm based on information entropy and game theory. First, ...a calculation of the species diversity of the initial population is conducted according to the information entropy by combining parallel genetic algorithms, including using the standard genetic algorithm (SGA), partial genetic algorithm (PGA) and syncretic hybrid genetic algorithm based on both SGA and PGA for evolutionary operations. Furthermore, with parallel nodes, complete-information game operations are implemented to achieve an optimum for the entire population based on the values of both the information entropy and the fitness of each subgroup population. Additionally, the Rosenbrock, Rastrigin and Schaffer functions are introduced to analyse the performance of different algorithms. The results show that compared with traditional genetic algorithms, the proposed algorithm performs better, with higher optimization ability, solution accuracy, and stability and a superior convergence rate.
Autonomous pilot is crucial in integrally promoting the autonomy of an unmanned surface vehicle (USV). However, the integration mechanism of decision and control is still unclear within the entire ...autonomy. In this paper, by organically bridging path planning and tracking, an autonomous pilot framework with waypoints generation, path smoothing and policy guidance of a USV in congested waters is established, for the first time. Incorporating elite and diversity operations into the genetic algorithm (GA), an elite-duplication GA (EGA) strategy is devised to optimally generate sparse waypoints in a constrained space. The B-spline technique is further deployed to make flexibly smooth interpolation facilitating path smoothing supported by optimal sparse-waypoints. Seamlessly bridged by the parametric smooth path, deep reinforcement learning (DRL) technique is resorted to continuously extract in-depth pilotage policies, i.e., mappings from path tracking errors, collision risks and control constraints to continuous control forces/torques. Eventually, the entire spline-bridged EGA-DRL (SED) framework merits autonomous global-pilotage and local-reaction in an organically modular manner. Comprehensive validations and comparisons in various real-world geographies demonstrate the effectiveness and superiority of the proposed SED autonomous pilot framework.
PDF
