deletions | additions       diff --git a/Related_workTraditional_Clustering_algorithms_can__.html b/Related_workTraditional_Clustering_algorithms_can__.html  index 467a0d3..ca0ca0a 100644  --- a/Related_workTraditional_Clustering_algorithms_can__.html  +++ b/Related_workTraditional_Clustering_algorithms_can__.html 
...
author = {Tamer F. Ghanem and Wail S. Elkilani and Hatem M. Abdelkader and Mohiy M. Hadhoud},  title = {Fast Dimension-based Partitioning and Merging clustering algorithm},  journal = {Applied Soft Computing}  }" data-bib-key="Ghanem_2015" style="cursor: pointer" contenteditable="false">(Ghanem 2015) which are combined to form clusters based on neighborhood relations. It is distinguished by fastness but it does not work efficiently in high dimensional space.

Test

Unlike Unlike  Traditional clustering algorithms, subspace clustering has been proposed to overcome problems arisen from curse of dimensionality phenomena by constructing clusters based on similarities on a subset of attributes (subspace). As a result, some samples may be assigned to multiple clusters. If each sample is assigned to only one cluster based on some subset of attributes, subspace clustering will be called projected clustering.

 clustering.

                                     

12211212

	212	211	212
1212	212		1
12	121	2112	212