Department of CSE, KITSW U18CS702A Machine Learning
7CSE AY:2023-24
CDT1 - LECTURE SUMMARY
CDT1 The ingredients of machine learning
Topics Covered
The motivation towards this class is the overview of how to use the right
Motivation
features to build the right models that achieve the right tasks
Lecture Learning Outcomes (LLOs): After completion of this lecture, you should be able to…
LLO
On given
Identify the problems that can be solved with machine learning
topic
CDT1 – Lecture Summary – Key Takeaways
Data features can significantly influence the performance of your algorithm. The art
of choosing data features is so important that it has its own term: feature engineering.
The model can be thought of as the primary function that accepts your X (input) and
returns your y (predicted output).
Tasks: the problems that can be solved with machine learning
It is often beneficial to view multi-class classification as a machine learning task in its
own right.
Regression involves learning a real-valued function from training examples labelled
with true function values.
The task of grouping data without prior information on the groups is called
clustering. Learning from unlabelled data is called unsupervised learning and is
quite distinct from supervised learning, which requires labelled training data.
Learning from unlabelled data is called unsupervised learning and is quite distinct
from supervised learning, which requires labelled training data. A typical clustering
algorithm works by assessing the similarity between instances (the things we’re
trying to cluster, e.g., e-mails) and putting similar instances in the same cluster and
‘dissimilar’ instances in different clusters.
Association rules are a kind of pattern that are popular in marketing applications,
and the result of such patterns can often be found on online shopping web sites.
CDT1 - LECTURE LEVEL PRACTICE PROBLEMS (LLPs) to test the LLOs
To test whether you achieved the learning outcomes of this lecture, you should be able to solve the
following LLPs, in the class itself, after completion of the lecture. Minimum one question / problem
(LLP) is designed to test each expected LLO.
LLP1 (on LLO1): Finding out the probability of getting two heads one after another when a
two unbiased coins tossed?
LLP2 (on LLO2): Find the similarity of e-mails given one e-mail contains 42 (different) words
and another contains 112 words, and the two e-mails have 23 words in common.
Prepared by: CSE Department Faculty, Dept of CSE, KITSW Page 1 of 1