Unlike supervised learning, unsupervised learning not working with labeled data, it is not showing the machine the correct answer. Instead, it is using different algorithms to let the machine create connections by studying and observing the data. Learn much of this through study and observation. Learning and improving by trial and error is the key to unsupervised learning.

However, the Knowledge Discovery process is the field of data mining is concerned with the development of methods, techniques and algorithm which can make sense of the available data. It is useful in finding trends, patterns, correlations and anomalies in the databases which is helpful to make accurate decisions for the future.

Knowledge discovery consists of an iterative sequence of following steps:

- Understand your goal or domain and create the dataset and select it
- Clean the selected dataset and transformed into appropriate form for mining
- Apply the intelligent methods on transformed dataset in order to extract data patterns
- When patterns are obtained evaluation, interpret and visualization is done to identify the patterns representing knowledge are
- At the end Knowledge presentation is done to present the knowledge to the user and manage the discovered knowledge

Unsupervised learning is one of the core techniques for knowledge discovery process as it is associated to learning without a teacher (without any labeling data) and modelling the probability density of inputs. There could be used a supervised learning to predict a certain outcome. But there might stand a better chance of finding something new if we try unsupervised learning. It could be the machine studying and observing millions of different data points and the machine create its own clusters. One of the key things with unsupervised learning is access to massive amounts of data. The more data you have, the easier it is for the machine to observe and study trends that might lead to a worthwhile cluster.

The most common unsupervised learning method is cluster analysis, which is used for exploratory data analysis to find hidden patterns or grouping in data. Clustering algorithm is applied on similar group with similar properties for data analysis, these similar group is called cluster. Cluster therefore is a collection of objects which are similar between them and are dissimilar to object belonging to other clusters. With the help of Clustering we determine the intrinsic grouping in a set of unlabeled data. Common clustering algorithms include:

**Hierarchical clustering**: builds a multilevel hierarchy of clusters by creating a cluster tree

**k-Means clustering:** Partitions data into k distinct clusters based on distance to the centroid of a cluster

**Gaussian mixture models:** models clusters as a mixture of multivariate normal density components

**Self-organizing maps** uses neural networks that learn the topology and distribution of the data

**Hidden Markov models** uses observed data to recover the sequence of states

- Juniper adds Mist AIOps to its 128 Technology-based SD-WAN
- 10 microservices patterns all architects should know
- IBM extends Call for Code for Racial Justice program
- citizen development
- How to manage third-party risk in the supply chain
- Gartner predicts data storytelling will dominate BI by 2025
- AWS Data Exchange and the third-party cloud data marketplace
- Overcome common IoT edge computing architecture issues

Posted 1 March 2021

© 2021 TechTarget, Inc. Powered by

Badges | Report an Issue | Privacy Policy | Terms of Service

**Most Popular Content on DSC**

To not miss this type of content in the future, subscribe to our newsletter.

- Book: Applied Stochastic Processes
- Long-range Correlations in Time Series: Modeling, Testing, Case Study
- How to Automatically Determine the Number of Clusters in your Data
- New Machine Learning Cheat Sheet | Old one
- Confidence Intervals Without Pain - With Resampling
- Advanced Machine Learning with Basic Excel
- New Perspectives on Statistical Distributions and Deep Learning
- Fascinating New Results in the Theory of Randomness
- Fast Combinatorial Feature Selection

**Other popular resources**

- Comprehensive Repository of Data Science and ML Resources
- Statistical Concepts Explained in Simple English
- Machine Learning Concepts Explained in One Picture
- 100 Data Science Interview Questions and Answers
- Cheat Sheets | Curated Articles | Search | Jobs | Courses
- Post a Blog | Forum Questions | Books | Salaries | News

**Archives:** 2008-2014 |
2015-2016 |
2017-2019 |
Book 1 |
Book 2 |
More

**Most popular articles**

- Free Book and Resources for DSC Members
- New Perspectives on Statistical Distributions and Deep Learning
- Time series, Growth Modeling and Data Science Wizardy
- Statistical Concepts Explained in Simple English
- Machine Learning Concepts Explained in One Picture
- Comprehensive Repository of Data Science and ML Resources
- Advanced Machine Learning with Basic Excel
- Difference between ML, Data Science, AI, Deep Learning, and Statistics
- Selected Business Analytics, Data Science and ML articles
- How to Automatically Determine the Number of Clusters in your Data
- Fascinating New Results in the Theory of Randomness
- Hire a Data Scientist | Search DSC | Find a Job
- Post a Blog | Forum Questions

## You need to be a member of Data Science Central to add comments!

Join Data Science Central