MARC보기
LDR03655cmm u2200553Mu 4500
001000000312531
003OCoLC
00520230525152447
006m d
007cr cnu---unuuu
008180908s2018 xx o 000 0 eng d
019 ▼a 1050606289
020 ▼a 9781789612479 ▼q (electronic bk.)
020 ▼a 1789612470 ▼q (electronic bk.)
035 ▼a 1881490 ▼b (N$T)
035 ▼a (OCoLC)1051139474 ▼z (OCoLC)1050606289
037 ▼a 90BE397B-A8BA-44BC-BAFF-42176798DA15 ▼b OverDrive, Inc. ▼n http://www.overdrive.com
040 ▼a EBLCP ▼b eng ▼c EBLCP ▼d NLE ▼d TEFOD ▼d YDX ▼d N$T ▼d 248032
049 ▼a MAIN
050 4 ▼a TA347.A78
072 7 ▼a COM ▼x 000000 ▼2 bisacsh
08204 ▼a 006.3 ▼2 23
1001 ▼a Patel, Devangini.
24510 ▼a Hands-On Artificial Intelligence for Search ▼h [electronic resource] : ▼b Building Intelligent Applications and Perform Enterprise Searches / ▼c Devangini Patel.
260 ▼a Birmingham : ▼b Packt Publishing Ltd, ▼c 2018.
300 ▼a 1 online resource (120 p.)
500 ▼a Description based upon print version of record.
5050 ▼a 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
5058 ▼a 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
520 ▼a 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 ...
590 ▼a Master record variable field(s) change: 050, 072, 082, 650
650 7 ▼a Computers ▼x Expert Systems. ▼2 bisacsh
650 7 ▼a Computers ▼x Web ▼x Search Engines. ▼2 bisacsh
650 7 ▼a Internet searching. ▼2 bicssc
650 7 ▼a Expert systems / knowledge-based systems. ▼2 bicssc
650 7 ▼a Computers ▼x Computer Science. ▼2 bisacsh
650 7 ▼a Computer science. ▼2 bicssc
650 0 ▼a Artificial intelligence.
650 0 ▼a Application software ▼x Development.
650 0 ▼a Machine learning.
650 0 ▼a Python (Computer program language)
650 7 ▼a COMPUTERS / General. ▼2 bisacsh
655 4 ▼a Electronic books.
77608 ▼i Print version: ▼a Patel, Devangini ▼t Hands-On Artificial Intelligence for Search : Building Intelligent Applications and Perform Enterprise Searches ▼d Birmingham : Packt Publishing Ltd,c2018 ▼z 9781789611151
85640 ▼3 EBSCOhost ▼u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1881490
938 ▼a EBL - Ebook Library ▼b EBLB ▼n EBL5504934
938 ▼a YBP Library Services ▼b YANK ▼n 15681492
938 ▼a EBSCOhost ▼b EBSC ▼n 1881490
990 ▼a 관리자
994 ▼a 92 ▼b N$T