AI Algorithm Visualization

KNN is a simple, instance-based learning algorithm that classifies new data points based on a similarity measure (e.g., distance functions).

A* is a graph traversal algorithm that finds the shortest path between nodes using heuristics to guide the search.

A graph traversal algorithm that explores neighbor nodes at the present depth prior to moving on to nodes at the next depth level.

A graph traversal algorithm that explores as far as possible along each branch before backtracking.

Finds the shortest paths from a single source node to all other nodes in a weighted graph.

A search algorithm that explores the most promising node first by expanding the node that has the smallest heuristic value.

A search algorithm that combines Iterative Deepening Depth-First Search with the A* search algorithm heuristic.

An optimal pathfinding algorithm for uniform cost grids, significantly faster than A* by pruning symmetrical nodes.

Searches from both the start and end nodes simultaneously, meeting in the middle.

A supervised machine learning algorithm used for classification.

A tree-like model of decisions and their possible consequences.

An ensemble learning method that operates by constructing a multitude of decision trees.

A probabilistic classifier based on applying Bayes' theorem with strong (naive) independence assumptions.

A classification algorithm that models the probability of a binary outcome.

A regression algorithm that models the linear relationship between a dependent variable and one or more independent variables.

Autoregressive Integrated Moving Average (ARIMA) is a statistical model used for analyzing and forecasting time series data.