舉報 
會員
Hands-On Artificial Intelligence for Search
Withtheemergenceofbigdataandmoderntechnologies,AIhasacquiredalotofrelevanceinmanydomains.TheincreaseindemandforautomationhasgeneratedmanyapplicationsforAIinfieldssuchasrobotics,predictiveanalytics,finance,andmore.Inthisbook,youwillunderstandwhatartificialintelligenceis.Itexplainsindetailbasicsearchmethods:Depth-FirstSearch(DFS),Breadth-FirstSearch(BFS),andA*Search,whichcanbeusedtomakeintelligentdecisionswhentheinitialstate,endstate,andpossibleactionsareknown.Randomsolutionsorgreedysolutionscanbefoundforsuchproblems.Butthesearenotoptimalineitherspaceortimeandefficientapproachesintimeandspacewillbeexplored.Wewillalsounderstandhowtoformulateaproblem,whichinvolveslookingatitandidentifyingitsinitialstate,goalstate,andtheactionsthatarepossibleineachstate.Wealsoneedtounderstandthedatastructuresinvolvedwhileimplementingthesesearchalgorithmsastheyformthebasisofsearchexploration.Finally,wewilllookintowhataheuristicisasthisdecidesthequalityofonesub-solutionoveranotherandhelpsyoudecidewhichsteptotake.
目錄(59章)
倒序
- 封面
- Title Page
- Copyright and Credits
- Hands-On Artificial Intelligence for Search
- Packt Upsell
- Why subscribe?
- PacktPub.com
- Contributors
- About the author
- About the reviewer
- Packt is searching for authors like you
- Preface
- Who this book is for
- What this book covers
- To get the most out of this book
- Download the example code files
- Download the color images
- Conventions used
- Get in touch
- Reviews
- 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
- 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
- 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?
- Properties of a good heuristic function
- Admissible
- Consistent
- Summary
- Other Books You May Enjoy
- Leave a review - let other readers know what you think 更新時間：2021-07-23 16:54:06
推薦閱讀
- Deep Learning Quick Reference
- 傳感器技術(shù)應(yīng)用
- 現(xiàn)代機(jī)械運動控制技術(shù)
- 21天學(xué)通Visual Basic
- Windows游戲程序設(shè)計基礎(chǔ)
- Apache Superset Quick Start Guide
- 網(wǎng)絡(luò)安全技術(shù)及應(yīng)用
- 機(jī)器人人工智能
- 手機(jī)游戲策劃設(shè)計
- Microsoft Dynamics CRM 2013 Marketing Automation
- 貫通Hibernate開發(fā)
- PostgreSQL 10 High Performance
- Practical Network Automation
- 特征工程入門與實踐
- Oracle Blockchain Quick Start Guide
- 牛津通識讀本：大數(shù)據(jù)（中文版）
- Arduino創(chuàng)意機(jī)器人入門：基于ArduBlock（第2版）
- 從實踐中學(xué)嵌入式Linux操作系統(tǒng)
- 中老年人學(xué)數(shù)碼照片后期處理
- 設(shè)計中的人因：34個設(shè)計小故事
- 軟件設(shè)計
- Excel 2003中文電子表格5日通
- 裝配式混凝土建筑：甲方管理問題分析與對策
- 名家傳道：數(shù)碼攝影后期處理秘笈
- Hands-On Serverless Computing
- 巧學(xué)活用打印機(jī)維護(hù)
- MySQL 8 Administrator’s Guide
- Linux核心應(yīng)用命令速查
- 數(shù)據(jù)庫應(yīng)用基礎(chǔ)
- Data Manipulation with R
