Book Overview & Buying
Table Of Contents
Feedback & Rating

Hands-On Artificial Intelligence for Search

By : Patel

4 (1)

Buy this Book

Hands-On Artificial Intelligence for Search

4 (1)

By: Patel

Buy this Book

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.

Preface

Who this book is for

What this book covers

To get the most out of this book

Get in touch

Free Chapter

Understanding the Depth-First Search Algorithm

Installing and setting up libraries

Introduction to file searching applications

Basic search concepts

Formulating the search problem

Building trees with nodes

Stack data structure

The DFS algorithm

Do it yourself

Summary

Understanding the Breadth-First Search Algorithm

Understanding the LinkedIn connection feature

Graph data structure

Queue data structure

The BFS algorithm

BFS versus DFS

Do it yourself

Summary

Understanding the Heuristic Search Algorithm

Revisiting the navigation application

The priority queue data structure

Visualizing a search tree

Greedy BFS

A* Search

What is a good heuristic function?

Summary

Other Books You May Enjoy

Leave a review - let other readers know what you think

Customer Reviews

4 (1)

5 star

4 star

100%

3 star

2 star

1 star

Understanding the Breadth-First Search Algorithm

The breadth-first search (BFS) algorithm is a traversing algorithm where you start at a selected node (the source or starting node) and traverse the graph layer-wise, exploring the neighboring nodes (nodes that are directly connected to the source node). You then move towards the neighboring nodes in the next level.

In this chapter, you will learn about BFS while developing LinkedIn's connection feature. You will learn how second-degree connections can be computed by using the BFS algorithm.

In this chapter, we will cover the following topics: