Hands-on artificial intelligence for search : building intelligent applications and perform enterprise searches / Devangini Patel.

Format:

Book

Author/Creator:

Patel, Devangini, author.

Language:

English

Subjects (All):

Internet searching.

Computer network resources.

Physical Description:

1 online resource (120 pages)

Edition:

1st edition

Other Title:

Building intelligent applications and perform enterprise searches

Place of Publication:

Birmingham ; Mumbai : Packt Publishing, 2018.

System Details:

text file

Biography/History:

Patel Devangini: Devangini Patel is a PhD student at the National University of Singapore, Singapore. Her research interests include deep learning, computer vision, machine learning, and artificial intelligence. She has completed a master's in artificial intelligence at the University of Southampton, UK. She has over 5 years, experience in the field of AI and has worked on various industrial and research projects in AI, including facial expression analysis, robotics, virtual try-on, object recognition and detection, and advertisement ranking.

Summary:

Make your searches more responsive and smarter by applying Artificial Intelligence to it Key Features Enter the world of Artificial Intelligence with solid concepts and real-world use cases Make your applications intelligent using AI in your day-to-day apps and become a smart developer Design and implement artificial intelligence in searches Book Description 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. What you will learn Understand the instances where searches can be used Understand the algorithms that can be used to make decisions more intelligent Formulate a problem by specifying its initial state, goal state, and actions Translate the concepts of the selected search algorithm into code Compare how basic search algorithms will perform for the application Implement algorithmic programming using code examples Who this book is for This book is for developers who are keen to get started with Artificial Intelligence and develop practical AI-based applications. Those developers who want to upgrade their normal applications to smart and intelligent versions will find this book useful. A basic knowledge and understanding of Python are assumed.

Contents:

Cover

Title Page

Copyright and Credits

Packt Upsell

Contributors

Table of Contents

Preface

Chapter 1: Understanding the Depth-First Search Algorithm

Installing and setting up libraries

Setting up Python

Setting up Graphviz

Installing pip

Introduction to file searching applications

Basic search concepts

Formulating the search problem

Building trees with nodes

Stack data structure

The DFS algorithm

Recursive DFS

Do it yourself

Summary

Chapter 2: Understanding the Breadth-First Search Algorithm

Understanding the LinkedIn connection feature

Graph data structure

Queue data structure

The BFS algorithm

BFS versus DFS

Order of traversal

Data structures

Memory

Optimal solution

Chapter 3: 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?

Properties of a good heuristic function

Admissible

Consistent

Other Books You May Enjoy

Index.

Notes:

Description based on print version record.

ISBN:

9781789612479

1789612470

OCLC:

1056157659