0% found this document useful (0 votes)
25 views6 pages

Module 05 Question Bank

The document is a question bank covering topics in clustering algorithms and reinforcement learning. It includes questions on definitions, differences, applications, algorithms, and specific methods related to both fields. Additionally, it addresses key concepts, challenges, and problem-solving techniques associated with these machine learning approaches.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views6 pages

Module 05 Question Bank

The document is a question bank covering topics in clustering algorithms and reinforcement learning. It includes questions on definitions, differences, applications, algorithms, and specific methods related to both fields. Additionally, it addresses key concepts, challenges, and problem-solving techniques associated with these machine learning approaches.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Module 05 Question Bank

Clustering Algorithms
1.​ What is Cluster analysis? Explain with an example.
2.​ Give the differences between classification and clustering.
3.​ What are the applications and challenges of clustering algorithms?
4.​ List the advantages and disadvantages of Clustering algorithms.
5.​ Explain different proximity measures for measuring the distance in
clustering algorithms.
6.​ Explain the following with examples.
a.​ Euclidean distance
b.​ City block/Manhattan distance
c.​ Chebyshave distance
d.​ Minkowski distance
e.​ Simple Matching Coefficient
f.​ Jaccard Coefficient
7.​ Explain the following with examples.
a.​ Hamming distance
b.​ Categorical variables
c.​ Ordinal Variables
d.​ Vector type distance measure (Cosine similarity)
8.​ What are hierarchical clustering algorithms?
9.​ Apply Single linkage, Complete linkage and average linkage algorithm s

10.​Write and explain Mean-Shift Clustering Algorithm with advantages and


disadvantages.
11.​Explain K Means algorithm in detail with advantages and disadvantages.
Also mention the time complexity.
12.​Problem

13.​Write and explain the working of DBSCAN algorithm. OR Explain the


clustering method that work on the basis of local distance of neighbours.
14.​Explain in detail the CLIQUE algorithm with advantages and
disadvantages.
15.​Explain the three important concepts of GRID based approach.
16.​Problems
Reinforcement Learning
1.​How reinforced learning is different from supervised and
unsupervised learning methods?
2.​What are the components of reinforced learning?
Explain each.
3.​Distinguish between the terms total reward and total
future reward.
4.​What is markovian assumption?
5.​How is reinforced learning suitable for dynamic
programming?
6.​What is temporal difference learning?
7.​What is the difference between Monte Carlo method
and temporal differencing?
8.​What is Q learning and how is it different from SARSA .
9.​What is the difference between online and offline
methods.
10.​ Show how RL Problem can be modelled and solved in
a conventional way.,
11.​ Explain Q-learning algorithm.
12.​ Explain SARSA algorithm.
13.​ What is the scope of reinforcement learning?
14.​ Give the characteristics, challenges and applications of
reinforcement learning.
15.​ Explain Marko decision process.
16.​ Problem
17.​ Write short notes on
a.​model based learning (Passive learning)
b.​Multi arm bandit problem and reinforcement
problem types
18.​ Explain the different methods of reinforcement agent
types.
19.​ Explain reinforcement algorithm selection.
20.​ Explain the algorithms for solving reinforcement
problems using conventional methods.
21.​ Explain the technique/methods used in model-free
techniques.
22.​ Explain temporal difference learning in detail.
23.​ Problems:

You might also like