18.1 Artificial Intelligence (AI)

State the purpose of the A* and Dijkstra’s algorithms.
- To find the path between two points on a graph using the algorithm.

difference between the A* and Dijkstra’s algorithms.
- A* tries to find a better path (between two points) by using a heuristic function // A* finds the adjacent route with the shortest path and continues this until the destination is reached
- … Dijkstra’s just explores all possible routes.
- The heuristic function on the A* algorithm gives priority to nodes that are supposed to be better than others / less costly than others.
- Dijkstra’s algorithm cannot work with negative values/weights //A* algorithm can work with negative values/weights.

the purpose of a graph when used in an Artificial Intelligence (AI) system
- A graph is used in AI to record relationships between entities
- … using vertices / nodes and edges
- for example, to represent places on a map and the distances between them, in order to find the shortest route.
the use of artificial neural networks in Deep Learning
- Artificial neural networks are designed to work in the same way as the human brain
- ANNs provide the architecture and algorithms for learning from the data
- They have a large number of connected processing units / nodes
- … that are arranged in layers / interconnected and work together to process data
- Deep learning models learn from data by adjusting the weights/biases of the connections between neurons
- They use multiple hidden layers to extract complex features and to make predictions

how unsupervised learning takes place in machine learning
- Unsupervised learning uses algorithms to analyse / cluster
- … unlabelled data sets
- They discover hidden patterns / data groupings / clusters without the need for human intervention.
- It is able to discover similarities and differences in data / information.