- AI Bayesian Network
- Decision Trees ID3
- K-Means Clustering
- Confusion Matrix Performance Evaluation
- Naive Bayes Classifier
- Bayes Theorem
- Probability
- Uncertainty
- Clustering
- Regression
- Probability
- K Means
- Performance Evaluation
- Genetic Algorithm
- Adversarial Search
- Constraint Satisfaction Problem
- Logical Search Algorithm
- Informed Search Algorithm
- Intelligent Agents
- Problem Solving Search Converted
- Game Theory
- Minimum Remaining Values (MRV), Most Constraining Variable (MCV), Least Contraining Variable (LCV)
- Probability & Inference
- Probability & Independence And Bayes' Rule
- Decision Theory, Likelihood And Importance
- Joint Probability Distribution
- Conditional Independence
- Local Search: Hill Climbing
- Escaping Local Maxima: Local Beam Search
- Simulated Annealing
- Search Heuristics
- Greedy Best First Search
- A* Search
- Problem Solving Agents
- Informed & Uninformed
- Iterative Deepening Depth-First Search
- Bidirectional Search
Created
June 22, 2021 16:51
-
-
Save Rubix982/65f8d39b3a5bf29b7f64e420e9edab00 to your computer and use it in GitHub Desktop.
As the title states
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment