Clustering High-Dimensional Data Stream: A Survey on Subspace Clustering, Projected Clustering on Bioinformatics Applications

2016 ◽  
Vol 8 (9) ◽  
pp. 749-757
Author(s):  
Ali Baghernia ◽  
Hamid Pavin ◽  
Miresmail Mirnabibaboli ◽  
Hamid Alinejad-Rokny
Author(s):  
Parul Agarwal ◽  
Shikha Mehta

Subspace clustering approaches cluster high dimensional data in different subspaces. It means grouping the data with different relevant subsets of dimensions. This technique has become very effective as a distance measure becomes ineffective in a high dimensional space. This chapter presents a novel evolutionary approach to a bottom up subspace clustering SUBSPACE_DE which is scalable to high dimensional data. SUBSPACE_DE uses a self-adaptive DBSCAN algorithm to perform clustering in data instances of each attribute and maximal subspaces. Self-adaptive DBSCAN clustering algorithms accept input from differential evolution algorithms. The proposed SUBSPACE_DE algorithm is tested on 14 datasets, both real and synthetic. It is compared with 11 existing subspace clustering algorithms. Evaluation metrics such as F1_Measure and accuracy are used. Performance analysis of the proposed algorithms is considerably better on a success rate ratio ranking in both accuracy and F1_Measure. SUBSPACE_DE also has potential scalability on high dimensional datasets.


2012 ◽  
Vol 45 (1) ◽  
pp. 434-446 ◽  
Author(s):  
Xiaojun Chen ◽  
Yunming Ye ◽  
Xiaofei Xu ◽  
Joshua Zhexue Huang

Sign in / Sign up

Export Citation Format

Share Document