This book aims to foster machine and deep learning approaches to data-driven applications, in which data governs the behaviour of applications. Applications of Artificial intelligence (AI)-based systems play a significant role in today's software industry. The sensors data from hardware-based systems making a mammoth database, increasing day by day. Recent advances in big data generation and management have created an avenue for decision-makers to utilize these huge volumes of data for different purposes and analyses. AI-based application developers have long utilized conventional machine learning techniques to design better user interfaces and vulnerability predictions. However, with the advancement of deep learning-based and neural-based networks and algorithms, researchers are able to explore and learn more about data and their exposed relationships or hidden features. This new trend of developing data-driven application systems seeks the adaptation of computational neural network algorithms and techniques in many application domains, including software systems, cyber security, human activity recognition, and behavioural modelling. As such, computational neural networks algorithms can be refined to address problems in data-driven applications. Original research and review works with model and build data-driven applications using computational algorithm are included as chapters in this book.

Consider the problem of a robot (algorithm, learning mechanism) moving along the real line attempting to locate a particular point ? . To assist the me- anism, we assume that it can communicate with an Environment ("Oracle") which guides it with information regarding the direction in which it should go. If the Environment is deterministic the problem is the "Deterministic Point - cation Problem" which has been studied rather thoroughly [1]. In its pioneering version [1] the problem was presented in the setting that the Environment could charge the robot a cost which was proportional to the distance it was from the point sought for. The question of having multiple communicating robots locate a point on the line has also been studied [1, 2]. In the stochastic version of this problem, we consider the scenario when the learning mechanism attempts to locate a point in an interval with stochastic (i. e. , possibly erroneous) instead of deterministic responses from the environment. Thus when it should really be moving to the "right" it may be advised to move to the "left" and vice versa. Apart from the problem being of importance in its own right, the stoch- tic pointlocationproblemalsohas potentialapplications insolvingoptimization problems. Inmanyoptimizationsolutions-forexampleinimageprocessing,p- tern recognition and neural computing [5, 9, 11, 12, 14, 16, 19], the algorithm worksits wayfromits currentsolutionto the optimalsolutionbasedoninfor- tion that it currentlyhas. A crucialquestionis oneof determining the parameter whichtheoptimizationalgorithmshoulduse.