Data mining is considered to be one of the popular terms of machine learning as it extracts meaningful information from the large pile of datasets and is used for decision-making tasks. It is a technique to identify patterns in a pre-built database and is used quite extensively by organisations as well as academia. The various aspects of data mining include data cleaning, data integration, data transformation, data discretisation, pattern evaluation and more. Below, we have listed the top eight data mining techniques in machine learning that is most used by data scientists. Association Rule Learning is one of the unsupervised data mining techniques in which an item set is defined as a collection of one or more items.

It is non-trivial to design engaging and balanced sets of game rules. Modern chess has evolved over centuries, but without a similar recourse to history, the consequences of rule changes to game dynamics are difficult to predict. AlphaZero provides an alternative in silico means of game balance assessment. It is a system that can learn near-optimal strategies for any rule set from scratch, without any human supervision, by continually learning from its own experience. In this study we use AlphaZero to creatively explore and design new chess variants.

The R language is a powerful open source functional programming language. At its core, R is a statistical programming language that provides impressive tools to analyze data and create high-level graphics. This book covers the basics of R by setting up a user-friendly programming environment and performing data ETL in R. Data exploration examples are provided that demonstrate how powerful data visualization and machine learning is in discovering hidden relationships. You will then dive into important machine learning topics, including data classification, regression, clustering, association rule mining, and dimension reduction.

Increasing response time of emergency vehicles (EVs) could lead to an immensurable loss of property and life. On this account, tactical decision making for EV's microscopic control remains an indispensable issue to be improved. Our approach verifies that deep reinforcement learning could complement rule-based methods in generalization. It reveals that deterministic avoidance strategy for common vehicles at a low speed benefits EVs a lot, nevertheless, when at a high velocity, DQN breaks the deadlock of reduced safe distance and brings boldness to EVs in lane changing. Besides, a novel DQN method with speed-adaptive compact state space (SC-DQN) is put forward to fit in EVs' high-speed feature and generalize in various road topologies. All Above is implemented in SUMO emulator, where common vehicles are modeled rule-based whereas EVs are intelligently controlled.

We study the problem of deriving policies, or rules, that when enacted on a complex system, cause a desired outcome. Absent the ability to perform controlled experiments, such rules have to be inferred from past observations of the system's behaviour. This is a challenging problem for two reasons: First, observational effects are often unrepresentative of the underlying causal effect because they are skewed by the presence of confounding factors. Second, naive empirical estimations of a rule's effect have a high variance, and, hence, their maximisation can lead to random results. To address these issues, first we measure the causal effect of a rule from observational data---adjusting for the effect of potential confounders. Importantly, we provide a graphical criteria under which causal rule discovery is possible. Moreover, to discover reliable causal rules from a sample, we propose a conservative and consistent estimator of the causal effect, and derive an efficient and exact algorithm that maximises the estimator. On synthetic data, the proposed estimator converges faster to the ground truth than the naive estimator and recovers relevant causal rules even at small sample sizes. Extensive experiments on a variety of real-world datasets show that the proposed algorithm is efficient and discovers meaningful rules.

This thesis develops a conceptual framework considering social data as representing the surface layer of a hierarchy of human social behaviours, needs and cognition which is employed to transform social data into representations that preserve social behaviours and their causalities. Based on this framework two platforms were built to capture insights from fast-paced and slow-paced social data. For fast-paced, a self-structuring and incremental learning technique was developed to automatically capture salient topics and corresponding dynamics over time. An event detection technique was developed to automatically monitor those identified topic pathways for significant fluctuations in social behaviours using multiple indicators such as volume and sentiment. This platform is demonstrated using two large datasets with over 1 million tweets. The separated topic pathways were representative of the key topics of each entity and coherent against topic coherence measures. Identified events were validated against contemporary events reported in news. Secondly for the slow-paced social data, a suite of new machine learning and natural language processing techniques were developed to automatically capture self-disclosed information of the individuals such as demographics, emotions and timeline of personal events. This platform was trialled on a large text corpus of over 4 million posts collected from online support groups. This was further extended to transform prostate cancer related online support group discussions into a multidimensional representation and investigated the self-disclosed quality of life of patients (and partners) against time, demographics and clinical factors. The capabilities of this extended platform have been demonstrated using a text corpus collected from 10 prostate cancer online support groups comprising of 609,960 prostate cancer discussions and 22,233 patients.

Yara rules are a ubiquitous tool among cybersecurity practitioners and analysts. Developing high-quality Yara rules to detect a malware family of interest can be labor- and time-intensive, even for expert users. Few tools exist and relatively little work has been done on how to automate the generation of Yara rules for specific families. In this paper, we leverage large n-grams ($n \geq 8$) combined with a new biclustering algorithm to construct simple Yara rules more effectively than currently available software. Our method, AutoYara, is fast, allowing for deployment on low-resource equipment for teams that deploy to remote networks. Our results demonstrate that AutoYara can help reduce analyst workload by producing rules with useful true-positive rates while maintaining low false-positive rates, sometimes matching or even outperforming human analysts. In addition, real-world testing by malware analysts indicates AutoYara could reduce analyst time spent constructing Yara rules by 44-86%, allowing them to spend their time on the more advanced malware that current tools can't handle. Code will be made available at https://github.com/NeuromorphicComputationResearchProgram .

As the digital age moves forward, it's becoming impossible to avoid interacting with artificial intelligence (AI) systems. Computer assistants and AIs perform an ever-growing range of tasks that are broadly intended to improve our quality of life. This extends to industry as well. But first, what do we mean by artificial intelligence? In simple terms, it's any machine (usually a computer) that does things normally associated with human intelligence, such as reasoning, learning and self-improvement.

This paper proposes an approach to analyze an event log of a business process in order to generate case-level recommendations of treatments that maximize the probability of a given outcome. Users classify the attributes in the event log into controllable and non-controllable, where the former correspond to attributes that can be altered during an execution of the process (the possible treatments). We use an action rule mining technique to identify treatments that co-occur with the outcome under some conditions. Since action rules are generated based on correlation rather than causation, we then use a causal machine learning technique, specifically uplift trees, to discover subgroups of cases for which a treatment has a high causal effect on the outcome after adjusting for confounding variables. We test the relevance of this approach using an event log of a loan application process and compare our findings with recommendations manually produced by process mining experts.

The RPA stands for "Robotic Process Automation." It supports several manual and repetitive tasks to automate like human beings. We can say that "RPA is a process of creation and training of software bot (automated programs) to automate the business process." "The RPA is the technology which allows anyone to configure the computer software or robot for emulating and integrating the actions of humans to interact within the digital systems to implement or execute the business process." RPA is the digital workforce. It interacts with the computer system in the same as the human does. It automates repetitive and tedious tasks. Robotic Process Automation is the sequence of commands which are executed by the automated programs under some defined sets of business rules. The primary purpose of RPA is to replace repetitive and boring clerical tasks into the virtual workforce by robots or machines. We train the bots (automated programs) what to do and let them do the work. The RPA is an acronym for Robotic Process Automation. The Robotic Process automation is used in both IT and Non-IT industries. Nowadays, every organization have a repetitive, boring, tedious task so, RPA is necessary to eliminate these types of task by making the automation of tasks.