Which term refers to the error introduced by the tendency of a model to fit the training data too closely, capturing noise?
- Bias
- Overfitting
- Underfitting
- Variance
Overfitting is the term used to describe when a model fits the training data too closely, capturing noise and leading to poor generalization on unseen data. It results in a high variance.
When a machine learning algorithm tries to group data into clusters without prior labels, it is using which type of learning?
- Reinforcement Learning
- Semi-Supervised Learning
- Supervised Learning
- Unsupervised Learning
Unsupervised Learning is the technique where the algorithm groups data into clusters without prior labels. This can help identify patterns and relationships within the data.
Hierarchical clustering can be broadly classified into two types based on how the hierarchy is constructed. What are these two types?
- Agglomerative and Divisive
- Linear and Non-linear
- QuickSort and MergeSort
- Recursive and Iterative
Hierarchical clustering can be Agglomerative (bottom-up) or Divisive (top-down) based on how clusters are merged or divided in the hierarchy.
You're analyzing data from a shopping mall's customer behavior and notice that there are overlapping clusters representing different shopping patterns. To model this scenario, which algorithm would be most suitable?
- K-Means Clustering
- Decision Trees
- Breadth-First Search
- Radix Sort
K-Means Clustering is commonly used for clustering tasks, such as identifying distinct shopping patterns. It groups data into clusters based on similarity, making it suitable for analyzing customer behavior data with overlapping patterns.
A company wants to determine the best version of their website homepage among five different designs. They decide to show each version to a subset of visitors and observe which version results in the highest user engagement. This problem is analogous to which classical problem in reinforcement learning?
- Multi-Armed Bandit
- Q-Learning
- Deep Q-Network (DQN)
- Policy Gradient Methods
This scenario is analogous to the Multi-Armed Bandit problem, where a decision-maker must choose between multiple options to maximize cumulative reward, akin to selecting the best website version for maximum user engagement.
Consider a robot that learns to navigate a maze. Instead of learning the value of each state or action, it tries to optimize its actions based on direct feedback. This approach is most similar to which reinforcement learning method?
- Monte Carlo Methods
- Temporal Difference Learning (TD)
- Actor-Critic Method
- Q-Learning
In this context, the robot is optimizing actions based on direct feedback, which is a characteristic of the Actor-Critic method. This method combines value-based and policy-based approaches, making it similar to the situation described.
Dimensionality reduction techniques, like PCA and t-SNE, are essential when dealing with the ________ curse.
- Overfitting
- Bias-Variance Tradeoff
- Curse of Dimensionality
- Bias
The "Curse of Dimensionality" refers to the increased complexity and sparsity of data in high-dimensional spaces. Dimensionality reduction techniques, such as PCA (Principal Component Analysis) and t-SNE, are crucial to mitigate the adverse effects of this curse.
In reinforcement learning, what do we call the function that determines the value of taking an action in a particular state?
- Action Evaluator
- Value Function
- Policy Function
- Reward Function
The 'Value Function' in reinforcement learning determines the expected cumulative reward of taking an action in a particular state, guiding decision-making.
In reinforcement learning, ________ focuses on trying new actions, while ________ focuses on leveraging known rewards.
- Exploration Policy
- Exploitation Policy
- Random Policy
- Deterministic Policy
In reinforcement learning, exploration policy focuses on trying new actions to learn more about the environment. Exploitation policy, on the other hand, leverages known rewards to make optimal decisions based on what's already learned.
One of the hyperparameters in a Random Forest algorithm that determines the maximum depth of the trees is called ______.
- Entropy
- Gini Index
- LeafNodes
- MaxDepth
The hyperparameter controlling the maximum depth of trees in a Random Forest is typically called "MaxDepth." It determines how deep each decision tree can grow in the ensemble.