Air-transport infrastructure is facing increasing congestion, necessitating innovative approaches to optimize arrival management and minimize delays near airports. To address this issue, this study developed an en rou...
详细信息
Air-transport infrastructure is facing increasing congestion, necessitating innovative approaches to optimize arrival management and minimize delays near airports. To address this issue, this study developed an en route arrival management framework that employs a learning classifier system (LCS) to reduce arrival delays and fuel consumption by generating adaptive and interpretable speed-control rules. A virtual design database, created from multiobjective optimization and integrated with a cellular automaton (CA)-based air-traffic model, facilitates the development of these rules. Within this database, a binary target variable represents speed-control decisions, whereas explanatory variables encompass factors such as aircraft proximity and congestion levels. The LCS is trained on this dataset to generate speed-control rules, and their effectiveness is evaluated through CA-based traffic simulations. The results indicate that the LCS achieved 96.8% accuracy in predicting appropriate speed-control actions, significantly outperforming traditional decision-tree methods (70.5% accuracy). Furthermore, experimental findings demonstrate reductions in average flight times by 10-20 s and up to 5 fewer spacing adjustments for traffic within 600 s before and after the arrival of speed-controlled flights. Overall, the LCS reduced total flight time by 1,801 s and total fuel consumption by 1,650.1 kg per operational cycle, resulting in an estimated annual cost savings of 466,000. Furthermore, the LCS approach successfully extracts both sector-specific and common rules, offering enhanced adaptability to various traffic scenarios. These results suggest that the ability to generalize rules across different airspace sectors can improve the safety and efficiency of air-traffic management.
This paper presents a learning classifier system ensemble for knowledge discovery from incremental data. The new ensemble was designed with a two-level architecture to improve the generalization ability. The new incom...
详细信息
This paper presents a learning classifier system ensemble for knowledge discovery from incremental data. The new ensemble was designed with a two-level architecture to improve the generalization ability. The new incoming cases are first bootstrapped to generate data as inputs to the first level classical learning classifier systems. The second level contains a plurality-vote module to determine the final classification by combining the classification results of the first level learning classifier systems. Each learning classifier system in the first level consists of two major modules, a genetic algorithm module for facilitating rule-discovery and a reinforcement learning module for adjusting the strength of the corresponding rules when rewards are received from the environment. We propose a revised Wilson's compact rule algorithm for generation of the compact rule set from the population set to improve the readability of the model. Two experiments were conducted. One was data mining of medical data and the other was steganalysis of images. The experimental results have shown that the new ensemble produced better performance on incremental data mining and better generalization than the single learning classifier system and other supervised learning methods. The results also showed that the compact rules were more interpretable.
This paper focuses on the generalization of classifiers in noisy problems and aims at construction learning classifier system (LCS) that can acquire the optimal classifier subset by dynamically determining the classif...
详细信息
This paper focuses on the generalization of classifiers in noisy problems and aims at construction learning classifier system (LCS) that can acquire the optimal classifier subset by dynamically determining the classifier generalization criteria. In this paper, an accuracy-based LCS (XCS) that uses the mean of the reward (XCS-MR) is introduced, which can correctly identify classifiers as either accurate or inaccurate for noisy problems, and investigates its effectiveness when used for several noisy problems. Applying XCS and an XCS based on the variance of reward (XCS-VR) as the conventional LCSs, along with XCS-MR, to noisy 11-multiplexer problems where the reward value changes according to a Gaussian distribution, Cauchy distribution, and lognormal distribution revealed the following: (1) XCS-VR and XCS-MR could select the correct action for every type of reward distribution;(2) XCS-MR could appropriately generalize the classifiers with the smallest amount of data;and (3) XCS-MR could acquire the optimal classifier subset in every trial for every type of reward distribution.
Role-based access control (RBAC) in databases provides a valuable level of abstraction to promote security administration at the business enterprise level. With the capacity for adaptation and learning, machine learni...
详细信息
Role-based access control (RBAC) in databases provides a valuable level of abstraction to promote security administration at the business enterprise level. With the capacity for adaptation and learning, machine learning algorithms are suitable for modeling normal data access patterns based on large amounts of data and presenting robust statistical models that are not sensitive to user changes. We propose a convolutional neural-based learning classifier system (CN-LCS) that models the role of queries by combining conventional learning classifier system (LCS) with convolutional neural network (CNN) for a database intrusion detection system based on the RBAC mechanism. The combination of modified Pittsburgh-style LCSs for the optimization of feature selection rules and one-dimensional CNNs for modeling and classification in place of traditional rule generation outperforms other machine learningclassifiers on a synthetic query dataset. In order to quantitatively compare the inclusion of rule generation and modeling processes in the CN-LCS, we have conducted 10-fold cross-validation tests and analysis through a paired sampled t-test. (C) 2019 Published by Elsevier Inc.
This paper proposes an accuracy-based Pittsburgh-style learning classifier system (LCS) that can find effective and robust solutions against several different situations, and aims at investigating its effectiveness in...
详细信息
This paper proposes an accuracy-based Pittsburgh-style learning classifier system (LCS) that can find effective and robust solutions against several different situations, and aims at investigating its effectiveness in the waterbus route optimisation problem. For this purpose, our accuracy-based Pittsburgh-style LCS: 1 introduces a new fitness calculation to remain robust classifiers (i.e., solutions) in different situations 2 employs NSGA-II to find the most effective and robust solutions among a lot of Pareto front solutions found in the multi-objective optimisation. Through intensive simulations on the waterbus route optimisation problem, we have revealed that our proposed LCS can find the waterbus routes that can cope with two different situations. In detail: 1 the relative fitness calculation can find the robust routes in comparison with the ordinary fitness calculation 2 the accuracy-based selection of the parents succeeds to find more effective and robust route in the different environments in comparison with the NSGA-II-based selection in the multi-objective optimisation.
It has been shown many times that the evolutionary online learning XCS classifiersystem is a robustly generalizing reinforcement learningsystem, which also yields highly competitive results in data mining applicatio...
详细信息
It has been shown many times that the evolutionary online learning XCS classifiersystem is a robustly generalizing reinforcement learningsystem, which also yields highly competitive results in data mining applications. The XCSF version of the system is a real-valued function approximation system, which learns piecewise overlapping local linear models to approximate an iteratively sampled function. While the theory on the binary domain side goes as far as showing that XCS can PAC learn a slightly restricted set of k-DNF problems, theory for XCSF is still rather sparse. This paper takes the theory from the XCS side and projects it onto the real-valued XCSF domain. For a set of functions, in which fitness guidance is given, we even show that XCSF scales optimally with respect to the population size, requiring only a constant overhead to ensure that the evolutionary process can locally optimize the evolving structures. Thus, we provide foundations concerning scalability and resource management for XCSF. Furthermore, we reveal dimensions of problem difficulty for XCSF - and local linear learners in general - showing how structural alignment, that is, alignment of XCSF's solution representation to the problem structure, can reduce the complexity of challenging problems by orders of magnitude. (C) 2010 Elsevier B.V. All rights reserved.
Nowadays, renewable energies have been considered as one of the important sources of energy supply in delay-sensitive fog computations in intelligent transportation systems due to their cheapness and availability. Thi...
详细信息
Nowadays, renewable energies have been considered as one of the important sources of energy supply in delay-sensitive fog computations in intelligent transportation systems due to their cheapness and availability. This study addresses the challenges of using renewable power supplies in delay-sensitive fogs and proposes an efficient workload allocation method based on a learning classifier system. The system dynamically learns the workload allocation policies between the cloud and the fog servers and then converges on the optimal allocation that fulfils the energy and delay requirements in the overall transportation system. Simulation results confirm that the proposed algorithm reduces the long-term costs of the system including service delay and operating costs. Also, compared to some other techniques, when the proposed method presents the most successful solution for reducing the average delay of the workloads and converging on the minimum value as well as retaining or even increasing the battery levels of fog nodes up to 100%. The lowest cost of the delay is 5 among other available methods, whereas in the proposed method, this value approaches 4.5.
Genetic algorithm-based learning classifier system (LCS) is a massively parallel, message-passing and rule-based machine learningsystem. But its potential self-adaptive learning capability has not been paid enough at...
详细信息
Genetic algorithm-based learning classifier system (LCS) is a massively parallel, message-passing and rule-based machine learningsystem. But its potential self-adaptive learning capability has not been paid enough attention in reservoir operation research. In this paper, an operating rule classification system based on LCS, which learns through credit assignment (the bucket brigade algorithm) and rule discovery(the genetic algorithm), is established to extract water-supply reservoir operating rules. The proposed system acquires the online identification rate 95% for training samples and offline rate 85% for testing samples in a case study, and further discussions are made about the impacts on the performances or behaviors of the rule classification system from three aspects of obtained rules, training or testing samples and the comparisons between the rule classification system and the artificial neural network (ANN). The results indicate the learning classifier system is practical and effective to obtain the reservoir supply operating rules. (C) 2008 Elsevier Ltd. All rights reserved.
Background and objective Detecting complex patterns of association between genetic or environmental risk factors and disease risk has become an important target for epidemiological research. In particular, strategies ...
详细信息
Background and objective Detecting complex patterns of association between genetic or environmental risk factors and disease risk has become an important target for epidemiological research. In particular, strategies that provide multifactor interactions or heterogeneous patterns of association can offer new insights into association studies for which traditional analytic tools have had limited success. Materials and methods To concurrently examine these phenomena, previous work has successfully considered the application of learning classifier systems (LCSs), a flexible class of evolutionary algorithms that distributes learned associations over a population of rules. Subsequent work dealt with the inherent problems of knowledge discovery and interpretation within these algorithms, allowing for the characterization of heterogeneous patterns of association. Whereas these previous advancements were evaluated using complex simulation studies, this study applied these collective works to a 'real-world' genetic epidemiology study of bladder cancer susceptibility. Results and discussion We replicated the identification of previously characterized factors that modify bladder cancer risk-namely, single nucleotide polymorphisms from a DNA repair gene, and smoking. Furthermore, we identified potentially heterogeneous groups of subjects characterized by distinct patterns of association. Cox proportional hazard models comparing clinical outcome variables between the cases of the two largest groups yielded a significant, meaningful difference in survival time in years (survivorship). A marginally significant difference in recurrence time was also noted. These results support the hypothesis that an LCS approach can offer greater insight into complex patterns of association. Conclusions This methodology appears to be well suited to the dissection of disease heterogeneity, a key component in the advancement of personalized medicine.
Algorithmic scalability is a major concern for any machine learning strategy in this age of 'big data'. A large number of potentially predictive attributes is emblematic of problems in bioinformatics, genetic ...
详细信息
Algorithmic scalability is a major concern for any machine learning strategy in this age of 'big data'. A large number of potentially predictive attributes is emblematic of problems in bioinformatics, genetic epidemiology, and many other fields. Previously, ExSTraCS was introduced as an extended Michigan-style supervised learning classifier system that combined a set of powerful heuristics to successfully tackle the challenges of classification, prediction, and knowledge discovery in complex, noisy, and heterogeneous problem domains. While Michigan-style learning classifier systems are powerful and flexible learners, they are not considered to be particularly scalable. For the first time, this paper presents a complete description of the ExSTraCS algorithm and introduces an effective strategy to dramatically improve learning classifier system scalability. ExSTraCS 2.0 addresses scalability with (1) a rule specificity limit, (2) new approaches to expert knowledge guided covering and mutation mechanisms, and (3) the implementation and utilization of the TuRF algorithm for improving the quality of expert knowledge discovery in larger datasets. Performance over a complex spectrum of simulated genetic datasets demonstrated that these new mechanisms dramatically improve nearly every performance metric on datasets with 20 attributes and made it possible for ExSTraCS to reliably scale up to perform on related 200 and 2000-attribute datasets. ExSTraCS 2.0 was also able to reliably solve the 6, 11, 20, 37, 70, and 135 multiplexer problems, and did so in similar or fewer learning iterations than previously reported, with smaller finite training sets, and without using building blocks discovered from simpler multiplexer problems. Furthermore, ExSTraCS usability was made simpler through the elimination of previously critical run parameters.
暂无评论