Book Image

Hands-On Artificial Intelligence for Search

By : Devangini Patel
Book Image

Hands-On Artificial Intelligence for Search

By: Devangini Patel

Overview of this book

With the emergence of big data and modern technologies, AI has acquired a lot of relevance in many domains. The increase in demand for automation has generated many applications for AI in fields such as robotics, predictive analytics, finance, and more. In this book, you will understand what artificial intelligence is. It explains in detail basic search methods: Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search, which can be used to make intelligent decisions when the initial state, end state, and possible actions are known. Random solutions or greedy solutions can be found for such problems. But these are not optimal in either space or time and efficient approaches in time and space will be explored. We will also understand how to formulate a problem, which involves looking at it and identifying its initial state, goal state, and the actions that are possible in each state. We also need to understand the data structures involved while implementing these search algorithms as they form the basis of search exploration. Finally, we will look into what a heuristic is as this decides the quality of one sub-solution over another and helps you decide which step to take.
Table of Contents (5 chapters)

What this book covers

Chapter 1, Understanding the Depth-First Search Algorithm, practically explains the DFS algorithm with the help of a search tree. The chapter also delves into recursion, which eliminates the need to have an explicit stack.

Chapter 2, Understanding the Breadth-First Search Algorithm, teaches you how to traverse a graph layer-wise using a LinkedIn connection feature as an example.

Chapter 3, Understanding the Heuristic Search Algorithm, takes you through the priority queue data structure and explains how to visualize search trees. The chapter also covers problems related to greedy best-first search, and how A* solves that problem.