<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://qbase.texpertssolutions.com/index.php?action=history&amp;feed=atom&amp;title=Clustering</id>
	<title>Clustering - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://qbase.texpertssolutions.com/index.php?action=history&amp;feed=atom&amp;title=Clustering"/>
	<link rel="alternate" type="text/html" href="https://qbase.texpertssolutions.com/index.php?title=Clustering&amp;action=history"/>
	<updated>2026-05-15T09:37:00Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>https://qbase.texpertssolutions.com/index.php?title=Clustering&amp;diff=210&amp;oldid=prev</id>
		<title>Thakshashila: /* SEO Keywords */</title>
		<link rel="alternate" type="text/html" href="https://qbase.texpertssolutions.com/index.php?title=Clustering&amp;diff=210&amp;oldid=prev"/>
		<updated>2025-06-10T06:20:52Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;SEO Keywords&lt;/span&gt;&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 06:20, 10 June 2025&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l57&quot;&gt;Line 57:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 57:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;clustering machine learning, what is clustering, clustering algorithms, types of clustering, unsupervised learning clustering, K-means clustering explained, DBSCAN clustering, clustering applications&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;clustering machine learning, what is clustering, clustering algorithms, types of clustering, unsupervised learning clustering, K-means clustering explained, DBSCAN clustering, clustering applications&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Artificial Intelligence]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Thakshashila</name></author>
	</entry>
	<entry>
		<id>https://qbase.texpertssolutions.com/index.php?title=Clustering&amp;diff=194&amp;oldid=prev</id>
		<title>Thakshashila: Created page with &quot;= Clustering =  &#039;&#039;&#039;Clustering&#039;&#039;&#039; is an unsupervised machine learning technique that groups data points into clusters such that points in the same cluster are more similar to each other than to those in other clusters.  == What is Clustering? ==  Unlike supervised learning, clustering does not use labeled data. The goal is to find natural groupings or patterns within the data based on similarity or distance measures.  == Types of Clustering ==  * &#039;&#039;&#039;Partitioning Methods:&#039;...&quot;</title>
		<link rel="alternate" type="text/html" href="https://qbase.texpertssolutions.com/index.php?title=Clustering&amp;diff=194&amp;oldid=prev"/>
		<updated>2025-06-10T06:08:14Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;= Clustering =  &amp;#039;&amp;#039;&amp;#039;Clustering&amp;#039;&amp;#039;&amp;#039; is an unsupervised machine learning technique that groups data points into clusters such that points in the same cluster are more similar to each other than to those in other clusters.  == What is Clustering? ==  Unlike supervised learning, clustering does not use labeled data. The goal is to find natural groupings or patterns within the data based on similarity or distance measures.  == Types of Clustering ==  * &amp;#039;&amp;#039;&amp;#039;Partitioning Methods:&amp;#039;...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;= Clustering =&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Clustering&amp;#039;&amp;#039;&amp;#039; is an unsupervised machine learning technique that groups data points into clusters such that points in the same cluster are more similar to each other than to those in other clusters.&lt;br /&gt;
&lt;br /&gt;
== What is Clustering? ==&lt;br /&gt;
&lt;br /&gt;
Unlike supervised learning, clustering does not use labeled data. The goal is to find natural groupings or patterns within the data based on similarity or distance measures.&lt;br /&gt;
&lt;br /&gt;
== Types of Clustering ==&lt;br /&gt;
&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Partitioning Methods:&amp;#039;&amp;#039;&amp;#039; Divide data into a set number of clusters.  &lt;br /&gt;
  Example: K-Means clustering.  &lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Hierarchical Clustering:&amp;#039;&amp;#039;&amp;#039; Builds a tree of clusters by merging or splitting them.  &lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Density-Based Clustering:&amp;#039;&amp;#039;&amp;#039; Groups points based on density of data points in regions.  &lt;br /&gt;
  Example: DBSCAN.  &lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Model-Based Clustering:&amp;#039;&amp;#039;&amp;#039; Assumes data is generated by a mixture of underlying probability distributions.&lt;br /&gt;
&lt;br /&gt;
== How Clustering Works ==&lt;br /&gt;
&lt;br /&gt;
1. Select the number of clusters or let the algorithm determine it.  &lt;br /&gt;
2. Calculate similarity/distance between data points (e.g., Euclidean distance).  &lt;br /&gt;
3. Assign points to clusters based on similarity criteria.  &lt;br /&gt;
4. Update clusters iteratively until stable.&lt;br /&gt;
&lt;br /&gt;
== Popular Clustering Algorithms ==&lt;br /&gt;
&lt;br /&gt;
* K-Means  &lt;br /&gt;
* Hierarchical Agglomerative Clustering  &lt;br /&gt;
* DBSCAN (Density-Based Spatial Clustering of Applications with Noise)  &lt;br /&gt;
* Gaussian Mixture Models (GMM)&lt;br /&gt;
&lt;br /&gt;
== Applications of Clustering ==&lt;br /&gt;
&lt;br /&gt;
* Customer segmentation in marketing  &lt;br /&gt;
* Image segmentation in computer vision  &lt;br /&gt;
* Anomaly detection  &lt;br /&gt;
* Document or text grouping  &lt;br /&gt;
* Bioinformatics for gene expression analysis&lt;br /&gt;
&lt;br /&gt;
== Challenges in Clustering ==&lt;br /&gt;
&lt;br /&gt;
* Choosing the right number of clusters.  &lt;br /&gt;
* Handling noisy data and outliers.  &lt;br /&gt;
* Defining appropriate similarity measures.  &lt;br /&gt;
* Computational complexity for large datasets.&lt;br /&gt;
&lt;br /&gt;
== Related Pages ==&lt;br /&gt;
&lt;br /&gt;
* [[Unsupervised Learning]]  &lt;br /&gt;
* [[Classification]]  &lt;br /&gt;
* [[K-Means Algorithm]]  &lt;br /&gt;
* [[DBSCAN]]  &lt;br /&gt;
* [[Dimensionality Reduction]]  &lt;br /&gt;
* [[Evaluation Metrics]]&lt;br /&gt;
&lt;br /&gt;
== SEO Keywords ==&lt;br /&gt;
&lt;br /&gt;
clustering machine learning, what is clustering, clustering algorithms, types of clustering, unsupervised learning clustering, K-means clustering explained, DBSCAN clustering, clustering applications&lt;/div&gt;</summary>
		<author><name>Thakshashila</name></author>
	</entry>
</feed>