Rule-Based Reasoning
Big Tech Deploys AI to Combat Hackers
Last year, Microsoft Corp.'s Azure security team detected suspicious activity in the cloud computing usage of a large retailer: One of the company's administrators, who usually logs on from New York, was trying to gain entry from Romania. A hacker had broken in. Microsoft quickly alerted its customer, and the attack was foiled before the intruder got too far. Inc. and various startups are moving away from solely using older "rules-based" technology designed to respond to specific kinds of intrusion and deploying machine-learning algorithms that crunch massive amounts of data on logins, behavior and previous attacks to ferret out and stop hackers. "Machine learning is a very powerful technique for security--it's dynamic, while rules-based systems are very rigid," says Dawn Song, a professor at the University of California at Berkeley's Artificial Intelligence Research Lab. "It's a very manual intensive process to change them, whereas machine learning is automated, dynamic and you can retrain it easily."
Shaping the Future of Artificial Intelligence
One of the biggest news subjects in the past few years has been artificial intelligence. We have read about how Google's DeepMind beat the world's best player at Go, which is thought of as the most complex game humans have created; witnessed how IBM's Watson beat humans in a debate; and taken part in a wide-ranging discussion of how A.I. applications will replace most of today's human jobs in the years ahead. Way back in 1983, I identified A.I. as one of 20 exponential technologies that would increasingly drive economic growth for decades to come. Early rule-based A.I. applications were used by financial institutions for loan applications, but once the exponential growth of processing power reached an A.I. tipping point, and we all started using the Internet and social media, A.I. had enough power and data (the fuel of A.I.) to enable smartphones, chatbots, autonomous vehicles and far more. As I advise the leadership of many leading companies, governments and institutions around the world, I have found we all have different definitions of and understandings about A.I., machine learning and other related topics.
Shaping the Future of Artificial Intelligence - Daniel Burrus
One of the biggest news subjects in the past few years has been artificial intelligence. We have read about how Google's DeepMind beat the world's best player at Go, which is thought of as the most complex game humans have created; witnessed how IBM's Watson beat humans in a debate; and taken part in a wide-ranging discussion of how A.I. applications will replace most of today's human jobs in the years ahead. Way back in 1983, I identified A.I. as one of 20 exponential technologies that would increasingly drive economic growth for decades to come. Early rule-based A.I. applications were used by financial institutions for loan applications, but once the exponential growth of processing power reached an A.I. tipping point, and we all started using the Internet and social media, A.I. had enough power and data (the fuel of A.I.) to enable smartphones, chatbots, autonomous vehicles and far more. As I advise the leadership of many leading companies, governments and institutions around the world, I have found we all have different definitions of and understandings about A.I., machine learning and other related topics.
Boolean Decision Rules via Column Generation
Dash, Sanjeeb, Gunluk, Oktay, Wei, Dennis
This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs) as an interpretable model for classification. An integer program is formulated to optimally trade classification accuracy for rule simplicity. Column generation (CG) is used to efficiently search over an exponential number of candidate clauses (conjunctions or disjunctions) without the need for heuristic rule mining. This approach also bounds the gap between the selected rule set and the best possible rule set on the training data. To handle large datasets, we propose an approximate CG algorithm using randomization. Compared to three recently proposed alternatives, the CG algorithm dominates the accuracy-simplicity trade-off in 8 out of 16 datasets. When maximized for accuracy, CG is competitive with rule learners designed for this purpose, sometimes finding significantly simpler solutions that are no less accurate.
Multi-value Rule Sets for Interpretable Classification with Feature-Efficient Representations
We present the Multi-value Rule Set (MRS) for interpretable classification with feature efficient presentations. Compared to rule sets built from single-value rules, MRS adopts a more generalized form of association rules that allows multiple values in a condition. Rules of this form are more concise than classical singlevalue rules in capturing and describing patterns in data. Our formulation also pursues a higher efficiency of feature utilization, which reduces possible cost in data collection and storage. We propose a Bayesian framework for formulating an MRS model and develop an efficient inference method for learning a maximum a posteriori, incorporating theoretically grounded bounds to iteratively reduce the search space and improve the search efficiency. Experiments on synthetic and realworld data demonstrate that MRS models have significantly smaller complexity and fewer features than baseline models while being competitive in predictive accuracy. Human evaluations show that MRS is easier to understand and use compared to other rule-based models.
Multi-value Rule Sets for Interpretable Classification with Feature-Efficient Representations
We present the Multi-value Rule Set (MRS) for interpretable classification with feature efficient presentations. Compared to rule sets built from single-value rules, MRS adopts a more generalized form of association rules that allows multiple values in a condition. Rules of this form are more concise than classical single-value rules in capturing and describing patterns in data. Our formulation also pursues a higher efficiency of feature utilization, which reduces possible cost in data collection and storage. We propose a Bayesian framework for formulating an MRS model and develop an efficient inference method for learning a maximum a posteriori, incorporating theoretically grounded bounds to iteratively reduce the search space and improve the search efficiency. Experiments on synthetic and real-world data demonstrate that MRS models have significantly smaller complexity and fewer features than baseline models while being competitive in predictive accuracy.
Boolean Decision Rules via Column Generation
Dash, Sanjeeb, Gunluk, Oktay, Wei, Dennis
This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs) as an interpretable model for classification. An integer program is formulated to optimally trade classification accuracy for rule simplicity. Column generation (CG) is used to efficiently search over an exponential number of candidate clauses (conjunctions or disjunctions) without the need for heuristic rule mining. This approach also bounds the gap between the selected rule set and the best possible rule set on the training data. To handle large datasets, we propose an approximate CG algorithm using randomization. Compared to three recently proposed alternatives, the CG algorithm dominates the accuracy-simplicity trade-off in 8 out of 16 datasets. When maximized for accuracy, CG is competitive with rule learners designed for this purpose, sometimes finding significantly simpler solutions that are no less accurate.
For Managers: Types Of AI Machine Learning Systems Defined - AI Trends
Developers know a lot about the machine learning (ML) systems they create and manage, that's a given. However, there is a need for non-developers to have a high level understanding of the types of systems. Artificial neural networks and expert systems are the classical two key classes. With the advanced in computing performance, software capabilities and algorithm complexity, analytical algorithm can arguably be said to have joined the other two. This article is an overview of the three types.
Brighterion CEO: 2018, the Year of AI PYMNTS.com
Dr. Akli Adjaoute, CEO of Brighterion, wrote this AI-focused piece as part of our 2018 year-end eBook. On Dec. 3, 2018, the U.S. Treasury's FinCEN and Federal Banking agencies issued a joint statement encouraging innovative industry approaches to combating money laundering, terrorist financing and other illicit financial threats. As a result, anti-money laundering (AML) has been occupying the headlines as of late. The financial industry has paid $321 billion in fines just through the end of last year, as estimated by Boston Consulting Group. JPMorgan had to pay more than $2 billion in fines due to violation of the Bank Secrecy Act, tied in part to the infamous Bernie Madoff scheme.
How I Used Association Rule Mining to Cross-sell At Scale – Mathias Schrøder
I have been wanting to start cross-selling at my family's webshop Seniorshoppen.dk for a while. The problem is that we sell 500 different products, so I have been pushing it off as it would take a lot of time to manually select possible cross-sells for each product we sell. Therefore, I have been thinking a lot about how to automate this best using machine learning or other techniques, I just haven't got around to doing it. For Black Friday we decided to require our customers to buy a minimum of two products to get a 25% discount. So, it was a natural time to actually execute on this to "help" our customers choose a second product for their Black Friday shopping spree. This is how I did it.