TY  - BOOK
AU  - Patel,Devangini
TI  - Hands-On Artificial Intelligence for Search: Building Intelligent Applications and Perform Enterprise Searches 
SN  - 9781789612479
AV  - TA347.A78 
U1  - 006.3 23
PY  - 2018///
CY  - Birmingham
PB  - Packt Publishing Ltd
KW  - Artificial intelligence
KW  - Application software
KW  - Development
KW  - Machine learning
KW  - Python (Computer program language)
KW  - Intelligence artificielle
KW  - Logiciels d'application
KW  - Développement
KW  - Apprentissage automatique
KW  - Python (Langage de programmation)
KW  - artificial intelligence
KW  - aat
KW  - Internet searching
KW  - bicssc
KW  - Expert systems
KW  - knowledge-based systems
KW  - Computer science
KW  - Computers
KW  - Expert Systems
KW  - bisacsh
KW  - Web
KW  - Search Engines
KW  - Computer Science
KW  - COMPUTERS
KW  - General
KW  - fast
N1  - 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 structureThe BFS algorithm; BFS versus DFS; Order of traversal; Data structures; Memory; Optimal solution; Do it yourself; Summary; 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; Summary; Other Books You May Enjoy; Index
N2  - 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
UR  - https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1881490
ER  -