Using AI to Transform Search
Course
Online
Description
-
Type
Course
-
Methodology
Online
-
Start date
Different dates available
Make your searches more responsive and smarter by applying Artificial Intelligence to it.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 course, you will understand what artificial intelligence is. It explains in detail basic search methods: DFS (Depth First Search), BFS (Breadth First Search), 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.About the AuthorDevangini Patel is a Ph.D. student at the National University of Singapore, Singapore. Her research interests include Deep Learning, Computer Vision, Machine Learning and Artificial Intelligence. She has completed masters in Artificial Intelligence from University of Southampton, UK. She has over 5 years of 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.
Facilities
Location
Start date
Start date
About this course
Where searches can be used
Understand the algorithms that can be used to make decisions more intelligent
Formulate a problem, that is, specify 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
Reviews
This centre's achievements
All courses are up to date
The average rating is higher than 3.7
More than 50 reviews in the last 12 months
This centre has featured on Emagister for 4 years
Subjects
- Artificial Intelligence
- Installation
- University
- Install
- AI
- IT
- IT Management
- Technology
- Information Systems
- Information Systems management
Course programme
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- What is search
- What is file search
- How does it work
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is recursion
- How DFS can be made recursive
- How is program stack used
- Explains the application
- Explains what changes need to be made to the existing DFS code for any application
- Discusses what changes need to be made for this application
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- What is search
- What is file search
- How does it work
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is recursion
- How DFS can be made recursive
- How is program stack used
- Explains the application
- Explains what changes need to be made to the existing DFS code for any application
- Discusses what changes need to be made for this application
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- Download python, Graphviz, and Pip.
- Run the installer and install these libraries.
- Install pydot and matplotlib using the command prompt.
- What is search
- What is file search
- How does it work
- What is search
- What is file search
- How does it work
- What is search
- What is file search
- How does it work
- What is search
- What is file search
- How does it work
- What is search
- What is file search
- How does it work
- What is search
- What is file search
- How does it work
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- Initial state: where do we start searching from
- Successor function: how do we explore from the current state
- Goal function: how do we know that we found the solution
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a node
- What are the properties and methods of node class
- How can nodes be used to build trees
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is a stack
- What are examples of stack
- How do stack operations—Insertion and deletion—operate
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is the flow of DFS
- How the search ingredients are used
- How stack data structure is used
- What is recursion
- How DFS can be made recursive
- How is program stack used
- What is recursion
- How DFS can be made recursive
- How is program stack used
- What is recursion
- How DFS can be made recursive
- How is program stack used
- What is...
Additional information
Using AI to Transform Search