984 research outputs found

    TSE-IDS: A Two-Stage Classifier Ensemble for Intelligent Anomaly-based Intrusion Detection System

    Get PDF
    Intrusion detection systems (IDS) play a pivotal role in computer security by discovering and repealing malicious activities in computer networks. Anomaly-based IDS, in particular, rely on classification models trained using historical data to discover such malicious activities. In this paper, an improved IDS based on hybrid feature selection and two-level classifier ensembles is proposed. An hybrid feature selection technique comprising three methods, i.e. particle swarm optimization, ant colony algorithm, and genetic algorithm, is utilized to reduce the feature size of the training datasets (NSL-KDD and UNSW-NB15 are considered in this paper). Features are selected based on the classification performance of a reduced error pruning tree (REPT) classifier. Then, a two-level classifier ensembles based on two meta learners, i.e., rotation forest and bagging, is proposed. On the NSL-KDD dataset, the proposed classifier shows 85.8% accuracy, 86.8% sensitivity, and 88.0% detection rate, which remarkably outperform other classification techniques recently proposed in the literature. Results regarding the UNSW-NB15 dataset also improve the ones achieved by several state of the art techniques. Finally, to verify the results, a two-step statistical significance test is conducted. This is not usually considered by IDS research thus far and, therefore, adds value to the experimental results achieved by the proposed classifier

    DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization

    Full text link
    Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework that leverages deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently outperforms its ACO counterparts on eight COPs using a single neural model and a single set of hyperparameters. As a Neural Combinatorial Optimization method, DeepACO performs better than or on par with problem-specific methods on canonical routing problems. Our code is publicly available at https://github.com/henry-yeh/DeepACO.Comment: Accepted at NeurIPS 202

    Applied Metaheuristic Computing

    Get PDF
    For decades, Applied Metaheuristic Computing (AMC) has been a prevailing optimization technique for tackling perplexing engineering and business problems, such as scheduling, routing, ordering, bin packing, assignment, facility layout planning, among others. This is partly because the classic exact methods are constrained with prior assumptions, and partly due to the heuristics being problem-dependent and lacking generalization. AMC, on the contrary, guides the course of low-level heuristics to search beyond the local optimality, which impairs the capability of traditional computation methods. This topic series has collected quality papers proposing cutting-edge methodology and innovative applications which drive the advances of AMC

    Disease diagnosis in smart healthcare: Innovation, technologies and applications

    Get PDF
    To promote sustainable development, the smart city implies a global vision that merges artificial intelligence, big data, decision making, information and communication technology (ICT), and the internet-of-things (IoT). The ageing issue is an aspect that researchers, companies and government should devote efforts in developing smart healthcare innovative technology and applications. In this paper, the topic of disease diagnosis in smart healthcare is reviewed. Typical emerging optimization algorithms and machine learning algorithms are summarized. Evolutionary optimization, stochastic optimization and combinatorial optimization are covered. Owning to the fact that there are plenty of applications in healthcare, four applications in the field of diseases diagnosis (which also list in the top 10 causes of global death in 2015), namely cardiovascular diseases, diabetes mellitus, Alzheimer’s disease and other forms of dementia, and tuberculosis, are considered. In addition, challenges in the deployment of disease diagnosis in healthcare have been discussed

    Disruption Management of ASAE's Inspection Routes

    Get PDF
    The Rapid development and the emergence of technologies capable of producing real-time data opened new horizons to both planning and optimization of vehicle routes [4]. In this dissertation, the Autoridade de Segurança Alimentar e Económica (ASAE) operation's scenario will be explored and analyzed as a case study to the problem. ASAE is a Portuguese administrative authority specialized in food security and economic auditing and is responsible to regulate thousands of economic entities in the Portuguese territory. ASAE inspections are usually done by brigades using vehicles to inspect economic operators, taking into account their timetables. Previous work on this topic led to the implementation of an inspection route optimization module capable of defining and assigning routes to inspect economic operators, seeking to maximize a utility function. Using optimization algorithms, inspection routes are calculated for each brigade, with information regarding specific map paths and inspection schedules. The approach used does not take into consideration the dynamic properties of real-life scenarios, as the precalculated operation plan is not reviewed in real-time. This work aims to study the dynamic properties of ASAE's operational environment and proposes a solution to efficiently review the precalculated inspection routes and apply the required changes in an appropriate time frame. Vehicle routing problems (VRP) are optimization problems where the aim is to calculate the set of optimized routes for a vehicle fleet, from a starting point to several interesting locations. Dynamic vehicle routing problem (DVRP) is a variant of VRP that makes use of real-time information to calculate the most optimized set of routes at a certain moment [39]. DVRP is a challenging problem because its scope is real-time, meaning that decisions sometimes must be made in short time windows, preventing the use of complex algorithms that require long computational times [10]. The typical approach to this problem is to initially calculate the routes for the whole fleet and dynamically revise the defined operations plan in real-time, once a disruption occurs. This work will model the problem as a DVRP and will compare the performance of heuristics and other modern optimization techniques, proposing a solution that will reduce the impact of disruptions on inspection routes. An optimized operations plan will reduce the time required for inspections, allowing massive economic savings, while reducing a company's ecological footstep. The work can eventually be scaled and used in other institutions, such as GNR or PSP in Portugal, that operate similarly

    Simulated Annealing

    Get PDF
    The book contains 15 chapters presenting recent contributions of top researchers working with Simulated Annealing (SA). Although it represents a small sample of the research activity on SA, the book will certainly serve as a valuable tool for researchers interested in getting involved in this multidisciplinary field. In fact, one of the salient features is that the book is highly multidisciplinary in terms of application areas since it assembles experts from the fields of Biology, Telecommunications, Geology, Electronics and Medicine
    corecore