Downloads: 112 | Views: 184
Research Paper | Computer Science & Engineering | India | Volume 3 Issue 3, March 2014
Clustering Medical Data Using Subspace and Parallel Approximation Algorithm
B. Thenmozhi | P. Shanthi [3]
Abstract: In high-dimensional feature spaces traditional clustering algorithms tend to break down in terms of efficiency and quality. Nevertheless, the data sets often contain clusters which are hidden in various subspaces of the original feature space. In high dimensional data, however, many of the dimensions are often irrelevant. These irrelevant dimensions confuse clustering algorithms by hiding clusters in noisy data. In this paper we propose parallel approximation algorithm localize the search for relevant dimensions allowing them to find clusters that exist in multiple, possibly overlapping subspaces. A broad evaluation based on real-world medical data sets demonstrates that is suitable to find all relevant subspaces in high dimensional, sparse data sets and produces better results than existing methods.
Keywords: Subspace clustering, Dimensionality Reduction, Redundancy Awareness, Detecting Relevant Attributes, Greedy optimization
Edition: Volume 3 Issue 3, March 2014,
Pages: 820 - 824
Similar Articles with Keyword 'Dimensionality Reduction'
Downloads: 108
Review Papers, Computer Science & Engineering, India, Volume 3 Issue 12, December 2014
Pages: 2450 - 2453Image Classification Using Group Sparse Multiview Patch Alignment Framework Method
Ashok Kakad | Pandhrinath Ghonge
Downloads: 109
Comparative Studies, Computer Science & Engineering, India, Volume 4 Issue 4, April 2015
Pages: 1107 - 1110Comparative Study of PCA and LDA
Chetana Narkhede | Uma Nagaraj