Crowdly
Add to Chrome
344.021/2/3/57/62/103/104/108/117/118/119/120/W01, UE Artificial Intelligence, Katharina Hoedt / Patricia Hu / Tara Jadidi, 2025W
Looking for 344.021/2/3/57/62/103/104/108/117/118/119/120/W01, UE Artificial Intelligence, Katharina Hoedt / Patricia Hu / Tara Jadidi, 2025W test answers and solutions? Browse our comprehensive collection of verified answers for 344.021/2/3/57/62/103/104/108/117/118/119/120/W01, UE Artificial Intelligence, Katharina Hoedt / Patricia Hu / Tara Jadidi, 2025W at moodle.jku.at.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Use the provided decision tree to predict the label for each of the provided samples . This time we consider 4 classes (.
Remember: following the left branch corresponds to , and the right branch to .
Consider feature X0 and the label y in the given table. Select all possible split points!
X0 | X1 | X2 | X3 | X4 | y |
4 | 256 | 54 | 6 | -10 | 0 |
12 | 8 | 76 | 32 | -48 | 0 |
40 | 8 | 31 | 18 | -14 | 0 |
12 | 2 | 29 | 38 | -10 | 0 |
20 | 64 | 36 | 24 | -16 | 1 |
56 | 16 | 34 | 40 | -12 | 1 |
42 | 26 | 39 | 63 | -20 | 1 |
72 | 1 | 42 | 36 | -12 | 1 |
Translate the following sentence to CNF:
Which of the following truth assignments produces output 1 for ? Select all that apply.
Assume you are using a different algorithm than the ID3 algorithm for creating a decision tree for the dataset shown in the graph. It randomly picks 4 possible split points, and then determines the best one out of those four (according to the information gain).
Which splitting point would it pick, given that the algorithm can choose between the following 4 possible split points?
The Monte Carlo Tree Search (MCTS) algorithm needs to select the next node to explore from the parent node. The parent node has been visited times. Given the statistics and assuming the exploration constant , calculate the UCT score of node A.UCT-Formula from the lecture slides:
Hint: Use the simple approximation for your calculation.Round your answer to two decimal places.
Given this game tree, let us apply Alpha-Beta pruning.
Nodes are checked from left to right (as was defined in the lecture).
If the value of β at the root node is 3 after searching the subtree of the highlighted MAX node (A21 and A22), what utility value(s) could a have? Select all that apply
You are given the following MCTS tree. Assume the algorithm is in the expansion phase. Select the next node based on the highest win rate among leaf nodes. If there is a tie in win rate, choose the leaf node with the highest number of simulations.