In recent years there has been a sharp rise in applications, in which significant events need to be classified but only a few training instances are available. These are known as cases of one-shot learning. To handle this challenging task, organizations often use human analysts to classify events under high uncertainty. Existing algorithms use a threshold-based mechanism to decide whether to classify an object automatically or send it to an analyst for deeper inspection. However, this approach leads to a significant waste of resources since it does not take the practical temporal constraints of system resources into account. By contrast, the focus in this paper is on rigorously optimizing the resource consumption in the system which applies to broad application domains, and is of a significant interest for academic research, industrial developments, as well as society and citizens benefit. The contribution of this paper is threefold. First, a novel Deep Reinforcement One-shot Learning (DeROL) framework is developed to address this challenge. The basic idea of the DeROL algorithm is to train a deep-Q network to obtain a policy which is oblivious to the unseen classes in the testing data. Then, in real-time, DeROL maps the current state of the one-shot learning process to operational actions based on the trained deep-Q network, to maximize the objective function. Second, the first open-source software for practical artificially intelligent one-shot classification systems with limited resources is developed for the benefit of researchers and developers in related fields. Third, an extensive experimental study is presented using the OMNIGLOT dataset for computer vision tasks, the UNSW-NB15 dataset for intrusion detection tasks, and the Cleveland Heart Disease Dataset for medical monitoring tasks that demonstrates the versatility and efficiency of the DeROL framework.
Keywords: Deep reinforcement learning | One-shot learning | Network optimization | Online classification

Recently, the prediction of the most efficient configuration of a vast set of devices used for mounting an optimised cloud computing services and virtual networks environments have attracted growing atten- tion. This paper proposes a paradigm shift in modelling transmission control protocol (TCP) behaviour over time in virtual networks by using data envelopment analysis (DEA) models. Firstly, it proves that self-similarity with long-range dependency is presented differently in every network device. This study implements a novel fractal dimension concept on virtual networks for prediction, where this key in- dex informs if the transport layer forwards services with smooth or jagged behaviour over time. Another substantial contribution is proving that virtual network devices have a distinct fractal memory, TCP band- width performance, and fractal dimension over time, presenting themselves as important factor for fore- casting of spatiotemporal data. Thus, a continuous stepwise fractal performance evaluation framework methodology is developed as an expert system for virtual network assessment and performs a fractal analysis as a knowledge representation. In addition, due to the limitations of classical DEA models, the windows multiplicative data envelopment analysis (WMDEA) model is used to dynamically assess the fractal time series from virtual network hypervisors. For knowledge acquisition, 50 different virtual net- work hypervisors were appraised as decision-making units (DMU). Finally, this expert system also acts as a math hypervisor capable of determining the correct fractal pattern to follow when delivering TCP services in an optimised virtual network.
Keywords: Cloud computing | Windows multiplicative data envelopment | analysis | Fractal expert system | Virtual Networks | Network Optimisation | Stepwise Performance Evaluation