Money laundering is the crucial mechanism utilized by criminals to inject proceeds of crime to the financial system. The primary responsibility of the detection of suspicious activity related to money laundering is with the financial institutions. Most of the current systems in these institutions are rule-based and ineffective. The available data science-based anti-money laundering (AML) models in order to replace the existing rule-based systems work on customer relationship management (CRM) features and time characteristics of transaction behaviour. However, there is still a challenge on accuracy and problems around feature engineering due to thousands of possible features. Aiming to improve the detection performance of suspicious transaction monitoring systems for AML systems, in this article, we introduce a novel feature set based on time-frequency analysis, that makes use of 2-D representations of financial transactions. Random forest is utilized as a machine learning method, and simulated annealing is adopted for hyperparameter tuning. The designed algorithm is tested on real banking data, proving the efficacy of the results in practically relevant environments. It is shown that the time-frequency characteristics of suspicious and non-suspicious entities differentiate significantly, which would substantially improve the precision of data science-based transaction monitoring systems looking at only time-series transaction and CRM features.

Predictions obtained by, e.g., artificial neural networks have a high accuracy but humans often perceive the models as black boxes. Insights about the decision making are mostly opaque for humans. Particularly understanding the decision making in highly sensitive areas such as healthcare or fifinance, is of paramount importance. The decision-making behind the black boxes requires it to be more transparent, accountable, and understandable for humans. This survey paper provides essential definitions, an overview of the different principles and methodologies of explainable Supervised Machine Learning (SML). We conduct a state-of-the-art survey that reviews past and recent explainable SML approaches and classifies them according to the introduced definitions. Finally, we illustrate principles by means of an explanatory case study and discuss important future directions.

Gaurav Shinh: Earlier, the vulnerability scan, and security patches were done through the rules-based system. These systems rely on human knowledge to define and configure the rules for both the detection and defining the defense mechanism in case of a security breach. Now, AI models have come up which identifies the pattern of attack and generate rules on the demand. This enabled companies to move to an era of'Proactive' defense rather than a reactive response-based system.

Fox News Flash top headlines are here. Check out what's clicking on Foxnews.com. The Los Angeles County Board of Supervisors on Tuesday voted on a motion to explore options for removing Sheriff Alex Villanueva, including an amendment to the state's Constitution. The 3-2 vote directs county officials to examine ways in which they could impeach Villanueva from his position, or, at least, scale back his responsibilities. One of those options proposed would amend California's Constitution to make county sheriffs be appointed, rather than elected.

For autonomous vehicles, effective behavior planning is crucial to ensure safety of the ego car. In many urban scenarios, it is hard to create sufficiently general heuristic rules, especially for challenging scenarios that some new human drivers find difficult. In this work, we propose a behavior planning structure based on reinforcement learning (RL) which is capable of performing autonomous vehicle behavior planning with a hierarchical structure in simulated urban environments. Application of the hierarchical structure allows the various layers of the behavior planning system to be satisfied. Our algorithms can perform better than heuristic-rule-based methods for elective decisions such as when to turn left between vehicles approaching from the opposite direction or possible lane-change when approaching an intersection due to lane blockage or delay in front of the ego car. Such behavior is hard to evaluate as correct or incorrect, but for some aggressive expert human drivers handle such scenarios effectively and quickly. On the other hand, compared to traditional RL methods, our algorithm is more sample-efficient, due to the use of a hybrid reward mechanism and heuristic exploration during the training process. The results also show that the proposed method converges to an optimal policy faster than traditional RL methods.

End-to-end models in NLP rarely encode external world knowledge about length of time. We introduce two effective models for duration prediction, which incorporate external knowledge by reading temporal-related news sentences (time-aware pre-training). Specifically, one model predicts the range/unit where the duration value falls in (R-pred); and the other predicts the exact duration value E-pred. Our best model -- E-pred, substantially outperforms previous work, and captures duration information more accurately than R-pred. We also demonstrate our models are capable of duration prediction in the unsupervised setting, outperforming the baselines.

The paper introduces a novel framework for extracting model-agnostic human interpretable rules to explain a classifier's output. The human interpretable rule is defined as an axis-aligned hyper-cuboid containing the instance for which the classification decision has to be explained. The proposed procedure finds the largest (high \textit{coverage}) axis-aligned hyper-cuboid such that a high percentage of the instances in the hyper-cuboid have the same class label as the instance being explained (high \textit{precision}). Novel approximations to the coverage and precision measures in terms of the parameters of the hyper-cuboid are defined. They are maximized using gradient-based optimizers. The quality of the approximations is rigorously analyzed theoretically and experimentally. Heuristics for simplifying the generated explanations for achieving better interpretability and a greedy selection algorithm that combines the local explanations for creating global explanations for the model covering a large part of the instance space are also proposed. The framework is model agnostic, can be applied to any arbitrary classifier, and all types of attributes (including continuous, ordered, and unordered discrete). The wide-scale applicability of the framework is validated on a variety of synthetic and real-world datasets from different domains (tabular, text, and image).

Before we proceed further to this post let us first understand what is a binary classification. So let's understand this by a very simple instance. You are at home and it's lunchtime, your mom comes to you and asks if you are hungry and want to have your lunch, your answer will be either "yes" or "no". You only have two options to reply i.e. binary options. Let's take another example of a student who has just received his result of grade 12 the result will be "passed" or "failed".

One of the classic tools for decision automation is a business rules management system, or BRMS. While these systems are powerful and effective when used correctly, many companies fail to apply best practices when using them. Here's one of our favorite horror stories about a well-intentioned BRMS implementation gone awry. Some years ago, we got a call from a company asking for our help with their business rules project. They said that they had hit a milestone in their rules analysis--it was 80% complete, or so they thought.

As predictive models are increasingly being deployed in high-stakes decision-making, there has been a lot of interest in developing algorithms which can provide recourses to affected individuals. While developing such tools is important, it is even more critical to analyse and interpret a predictive model, and vet it thoroughly to ensure that the recourses it offers are meaningful and non-discriminatory before it is deployed in the real world. To this end, we propose a novel model agnostic framework called Actionable Recourse Summaries (AReS) to construct global counterfactual explanations which provide an interpretable and accurate summary of recourses for the entire population. We formulate a novel objective which simultaneously optimizes for correctness of the recourses and interpretability of the explanations, while minimizing overall recourse costs across the entire population. More specifically, our objective enables us to learn, with optimality guarantees on recourse correctness, a small number of compact rule sets each of which capture recourses for well defined subpopulations within the data. We also demonstrate theoretically that several of the prior approaches proposed to generate recourses for individuals are special cases of our framework. Experimental evaluation with real world datasets and user studies demonstrate that our framework can provide decision makers with a comprehensive overview of recourses corresponding to any black box model, and consequently help detect undesirable model biases and discrimination.