Rule-Based Reasoning
Dump the Spreadsheet. Leveraging AI for Automated Transaction Matching
As digital transformation sweeps across the enterprise landscape, F&A processes continue to evolve. The decades-old manual process of entering data into a spreadsheet for reconciliation purposes has given way to digital reconciliation, with the advent of automation technology to make it faster and more efficient. However, even automated processes have evolved in the last few years with the advances made in machine learning and AI. What do these advances mean for F&A teams today?To illustrate the profound implications of AI and machine learning for F&A, consider the evolution of the transaction matching process in reconciliation. From the earliest days, F&A departments have largely relied on manual processes to reconcile accounts.
What do AML-BSA-CTF Regulators think of Machine Learning?
Prior to 2018, regulators resisted recommending the use of Machine Learning (ML) based Artificial Intelligence (AI) for AML compliance. There was a mindset shift in mid 2018 indicating that proceeding with caution in implementing AI approaches for AML is appropriate. Regulators realize the adoption of recent innovation, such as the use of AI-ML and robotic process automation (RPA) techniques, enables AML compliance improvements not otherwise attainable. A risk-based approach to compliance, underpinned by AI/Machine Learning, creates opportunities for governance and process refinement as well as identifying potential untapped revenues. Reliance on box-ticking approaches familiar to users of legacy rules-based compliance systems is no longer sufficient.
Data Vision: Learning to See Through Algorithmic Abstraction
Passi, Samir, Jackson, Steven J.
Learning to see through data is central to contemporary forms of algorithmic knowledge production. While often represented as a mechanical application of rules, making algorithms work with data requires a great deal of situated work. This paper examines how the often-divergent demands of mechanization and discretion manifest in data analytic learning environments. Drawing on research in CSCW and the social sciences, and ethnographic fieldwork in two data learning environments, we show how an algorithm's application is seen sometimes as a mechanical sequence of rules and at other times as an array of situated decisions. Casting data analytics as a rule-based (rather than rule-bound) practice, we show that effective data vision requires would-be analysts to straddle the competing demands of formal abstraction and empirical contingency. We conclude by discussing how the notion of data vision can help better leverage the role of human work in data analytic learning, research, and practice.
Knowledge Graph Embedding for Link Prediction: A Comparative Analysis
Rossi, Andrea, Firmani, Donatella, Matinata, Antonio, Merialdo, Paolo, Barbosa, Denilson
Knowledge Graphs (KGs) have found many applications in industry and academic settings, which in turn, have motivated considerable research efforts towards large-scale information extraction from a variety of sources. Despite such efforts, it is well known that even state-of-the-art KGs suffer from incompleteness. Link Prediction (LP), the task of predicting missing facts among entities already a KG, is a promising and widely studied task aimed at addressing KG incompleteness. Among the recent LP techniques, those based on KG embeddings have achieved very promising performances in some benchmarks. Despite the fast growing literature in the subject, insufficient attention has been paid to the effect of the various design choices in those methods. Moreover, the standard practice in this area is to report accuracy by aggregating over a large number of test facts in which some entities are over-represented; this allows LP methods to exhibit good performance by just attending to structural properties that include such entities, while ignoring the remaining majority of the KG. This analysis provides a comprehensive comparison of embedding-based LP methods, extending the dimensions of analysis beyond what is commonly available in the literature. We experimentally compare effectiveness and efficiency of 16 state-of-the-art methods, consider a rule-based baseline, and report detailed analysis over the most popular benchmarks in the literature.
Mike Moore, former WTO leader and New Zealand prime minister, dies at 71
WELLINGTON โ Mike Moore, who served as New Zealand's prime minister before leading the World Trade Organization during a tumultuous time when thousands protested in Seattle riots, died early Sunday. He died at his home in Auckland, his wife Yvonne Moore said. He had suffered a number of health complications since having a stroke five years ago. Moore was an advocate for both advancing the rights of blue-collar workers and for expanding international trade, a combination which, to some, seemed at odds with itself. Although he had a long political career in New Zealand, Moore's tenure as prime minister was brief: just two months in 1990 before he was defeated in an election.
Wise Practitioner โ Predictive Analytics Interview Series: Kumaran Ponnambalam at Cisco - Machine Learning Times - machine learning & data science news
In anticipation of his upcoming conference presentation at Predictive Analytics World for Business Las Vegas, May 31-June 4, 2020, we asked Kumaran Ponnambalam, Analytics Architect at Cisco, a few questions about their deployment of predictive analytics. Catch a glimpse of his presentation, Using Association Rules Mining for Segmentation and Profiling, and see what's in store at the PAW Business conference in Las Vegas. Q: In your work with predictive analytics, what behavior or outcome do your models predict? A: My models deal with natural language understanding for contact center voice calls. They transcribe the calls and derive call summaries, intent and sentiment based on the transcriptions.
Fraud detection: the problem, solutions and tools
"Fraud is a billion-dollar business There are many formal definitions but essentially a fraud is an "art" and crime of deceiving and scamming people in their financial transactions. Frauds have always existed throughout human history but in this age of digital technology, the strategy, extent and magnitude of financial frauds is becoming wide-ranging -- from credit cards transactions to health benefits to insurance claims. Fraudsters are also getting super creative. Who's never received an email from a Nigerian royal widow that she's looking for trusted someone to hand over large sums of her inheritance? No wonder why is fraud a big deal.
An interpretable semi-supervised classifier using two different strategies for amended self-labeling
Grau, Isel, Sengupta, Dipankar, Lorenzo, Maria M. Garcia, Nowe, Ann
In the context of some machine learning applications, obtaining data instances is a relatively easy process but labeling them could become quite expensive or tedious. Such scenarios lead to datasets with few labeled instances and a larger number of unlabeled ones. Semi-supervised classification techniques combine labeled and unlabeled data during the learning phase in order to increase classifier's generalization capability. Regrettably, most successful semi-supervised classifiers do not allow explaining their outcome, thus behaving like black boxes. However, there is an increasing number of problem domains in which experts demand a clear understanding of the decision process. In this paper, we report on an extended experimental study presenting an interpretable self-labeling grey-box classifier that uses a black box to estimate the missing class labels and a white box to make the final predictions. Two different approaches for amending the self-labeling process are explored: a first one based on the confidence of the black box and the latter one based on measures from Rough Set Theory. The results of the extended experimental study support the interpretability by means of transparency and simplicity of our classifier, while attaining superior prediction rates when compared with state-of-the-art self-labeling classifiers reported in the literature.
DeepEnroll: Patient-Trial Matching with Deep Embedding and Entailment Prediction
Zhang, Xingyao, Xiao, Cao, Glass, Lucas M., Sun, Jimeng
Clinical trials are essential for drug development but often suffer from expensive, inaccurate and insufficient patient recruitment. The core problem of patient-trial matching is to find qualified patients for a trial, where patient information is stored in electronic health records (EHR) while trial eligibility criteria (EC) are described in text documents available on the web. How to represent longitudinal patient EHR? How to extract complex logical rules from EC? Most existing works rely on manual rule-based extraction, which is time consuming and inflexible for complex inference. To address these challenges, we proposed DeepEnroll, a cross-modal inference learning model to jointly encode enrollment criteria (text) and patients records (tabular data) into a shared latent space for matching inference. DeepEnroll applies a pre-trained Bidirectional Encoder Representations from Transformers(BERT) model to encode clinical trial information into sentence embedding. And uses a hierarchical embedding model to represent patient longitudinal EHR. In addition, DeepEnroll is augmented by a numerical information embedding and entailment module to reason over numerical information in both EC and EHR. These encoders are trained jointly to optimize patient-trial matching score. We evaluated DeepEnroll on the trial-patient matching task with demonstrated on real world datasets. DeepEnroll outperformed the best baseline by up to 12.4% in average F1.