Scribd
Upload
11 views

Unsupervised Machine Learning

Unsupervised learning is a machine learning approach that analyzes unlabeled data to discover hidden patterns and insights without supervision. It includes tasks such as clustering, association, and dimensionality reduction, utilizing algorithms like K-Means, Apriori, and PCA. While it offers advantages in exploring complex data, it also faces challenges such as lower accuracy and time consumption due to the lack of labeled data.

Uploaded by

quillsbot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

Unsupervised Machine Learning

Unsupervised learning is a machine learning approach that analyzes unlabeled data to discover hidden patterns and insights without supervision. It includes tasks such as clustering, association, and dimensionality reduction, utilizing algorithms like K-Means, Apriori, and PCA. While it offers advantages in exploring complex data, it also faces challenges such as lower accuracy and time consumption due to the lack of labeled data.

Uploaded by

quillsbot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

UNSUPERVISED

MACHINE By Gayathri Prasad S

LEARNING
WHAT?
Unsupervised learning is a machine learning approach
in which models do not have any supervisor to guide
them. It mainly deals with the unlabelled data.
Models themselves find the hidden patterns and
insights from the provided data. Thus it aims to
discover the dataset’s underlying pattern, assemble
that data according to similarities, and express that
dataset in a precise format.
WHY USE AN
UNSUPERVISED
LEARNING ALGORITHM?
It is similar to how a human learns. It involves thinking by
experiences, which moves it closer to real AI.
Labeling of data demands a lot of manual work and
expenses.
It works on unlabeled data, which makes unsupervised
learning further critical as real-world data is mostly
unlabelled.
It helps look for useful insights from the data that seem
complex by humans.
Its ability to discover similarities and differences in
information make it the ideal solution for exploratory data
analysis, cross-selling strategies, customer segmentation,
and image recognition.
ALGORITHMS
Unsupervised learning models are utilized for three
main tasks—clustering, association, and dimensionality
reduction.
K-Means Clustering
Hierarchical Clustering
Gaussian Mixture Model
Fuzzy k-Means
PCA
Apriori Algorithm
CLUSTERING
Clustering is a data mining technique which groups
unlabeled data based on their similarities or
differences.
Clustering algorithms will process data and find natural
clusters(groups) if they exist in the data. Also it
modifies how many clusters the algorithm should
identify. It allows to adjust the granularity of these
groups.
The quality of a clustering result depends on the
algorithm, the distance function, and the application.
CLUSTERING-DIFFERENT
APPROACHES
Exclusive (partitioning): In this clustering method, Data are
grouped in such a way that one data can belong to one cluster
only. Example: K-means
Agglomerative: In this clustering technique, every data is a
cluster. The iterative unions between the two nearest clusters
reduce the number of clusters. Example: Hierarchical
clustering
Overlapping: In this technique, fuzzy sets is used to cluster
data. Each point may belong to two or more clusters with
separate degrees of membership. Here, data will be associated
with an appropriate membership value. Example: Fuzzy K-
Means
Probabilistic: This technique uses probability distribution to
create the clusters like following keywords. Example: Mixture of
Gaussian models
ASSOCIATION
Association rule learning is a rule-based machine
learning method for discovering interesting
relationships between variables in a given dataset.
The most widely used algorithm is the Apriori
algorithm.
These methods are often used for market basket
analysis which allows companies to gain a better
understanding of the relationships between various
products.
An association rule learning problem helps to discover
rules, such as people that buy X also tend to buy Y.
DIMENSIONALITY
REDUCTION
Dimensionality reduction is a technique used when the
number of features, or dimensions, in a given dataset
is too high.
It reduces the number of data inputs to a manageable
size while also preserving the integrity of the dataset
as much as possible.
It is commonly used in the preprocessing data stage.
Principal component analysis (PCA), Singular value
decomposition, Autoencoders etc are the popular
algorithms in this category.
ANOMALY DETECTION
The detection of anomalies comprises distinguishing
rare and unusual events.
The ideal approach to anomaly detection is calculating
a detailed summary of standard data.
Each newly arrived data point is compared to the
normality model, and an anomaly score is determined.
It can automatically discover unusual data points in
your dataset.
This is useful in pinpointing fraudulent transactions,
discovering faulty pieces of hardware, or identifying an
outlier caused by a human error during data entry.
SETBACKS
You cannot get precise information regarding data sorting and the
output, as data used in unsupervised learning is unlabelled and
not known.
Less accuracy of the results is because the data is not known and
not labelled by people in advance. This means that the machine
requires to do this itself.
It is also a time-consuming process. The learning phase of the
algorithm might take a lot of time, as it analyses and calculates
all possibilities.
It is not always certain that the obtained results will be useful
since there is no label or output measure to confirm its
usefulness.ie; The spectral classes do not always correspond to
informational classes.
The user needs to spend time interpreting and label the classes
which follow that classification.
Thank You

You might also like