AI Application in Business PDF

AI Application in Business What is Artificial Intelligence? The study of how to make computers do things at which, at the moment, people are better. Rich & Knight, 1991  What is Artificial Intelligence? THOUGHT Systems that think Systems that think...

AI Application in Business What is Artificial Intelligence? The study of how to make computers do things at which, at the moment, people are better. Rich & Knight, 1991  What is Artificial Intelligence? THOUGHT Systems that think Systems that think like humans rationally Systems that act Systems that act BEHAVIOUR like humans rationally HUMAN RATIONAL  Computing Machinery and Intelligence Can machines think? Published in “Mind: A Quarterly Review of Psychology and Philosophy”, in 1950.  The imitation Game Interrogator Human Machine Turing-Test  Turing-Test If a computer can play the game just as well as a human, then the computer is said to ‘pass’ the ‘test’, and should be declared intelligent A question: Why the strange set-up of the Turing-Test? Why did Turing ‘pit’ a machine against a human in some kind of contest? Why not have the interrogator simply interact with a machine and judge whether or not the machine is intelligent based on those interactions?  What can people do that computers can’t do? Human can read distorted text as the one shown below, but current computer programs can't: The term CAPTCHA (for Completely Automated Public Turing Test To Tell Computers and Humans Apart) was coined in 2000 by Luis von Ahn, Manuel Blum, Nicholas Hopper and John Langford of Carnegie Mellon University.  Some Definitions of AI Artificial Intelligence (Can Learn and adapt) Cognitive Computing (Simulates human thought processes) Statistics Bio-inspired and Symbolic System analytics (Logical) Reasoning Regression Neural networks(Multilayer, Descriptive and inferential Rule/Knowledge-based feedforward, recurrent, Bayesian networks system convolutional) Random forest Induction and deduction Genetic algorithms Data mining Forward and backward Progeny clustering Predictive analytics chaining Machine learning Computational learning Fuzzy logic Deep learning The Traveling Salesman Problem What is TSP? The goal of the Traveling Salesman Problem (TSP) is to find the most economical way to tour of a select number of “cities” with the following restrictions: You must visit each city once and only once You must return to the original starting point  TSPs belong to a class of problems in computational complexity analysis called NP-complete problem  Heuristic Search Techniques Direct techniques (blind search) are not always possible (they require too much time or memory). Weak techniques can be effective if applied correctly on the right kinds of tasks. – Typically require domain specific information. 15  The A* Search A* is an algorithm that: – Uses heuristic to guide search – While ensuring that it will compute a path with minimum cost We define a heuristic function: h(n) = “estimate of the cost of the cheapest path from the starting node to the goal node” “estimated cost” A* computes the function f(n) = g(n) + h(n) “actual cost”  Algorithm A* One of the most important advances in AI g(n) = least cost path to n from S found so far h(n)