Downloads: 107 | Views: 174

Research Paper | Information Technology | India | Volume 3 Issue 12, December 2014

Determining and Exploring Dimensions in Subspace Clustering for Value Decomposition

Saranya Sagambari Devi.S

Abstract: Clustering a large sparse and large scale data is a open research in the data mining. To discover the significant information through clustering algorithm stands inadequate as most of the data finds to be non actionable. Existing clustering technique is not feasible to time varying data in high dimensional space. Hence Subspace clustering will be answerable to problems in the clustering through incorporation of domain knowledge and parameter sensitive prediction. Sensitiveness of the data is also predicted through thresholding mechanism. The problems of usability and usefulness in 3D subspace clustering are very important issue in subspace clustering. Also determining the correct dimension is inconsistent and challenging issue in subspace clustering. In this thesis, we propose Centroid based Subspace Forecasting Framework by constraints is proposed, i. e. must link and must not link with domain knowledge. Unsupervised Subspace clustering algorithm with inbuilt process like inconsistent constraints correlating to dimensions has been resolved through singular value decomposition. Principle component analysis is been used in which condition has been explored to estimate the strength of actionable to be particular attributes and utilizing the domain knowledge to refinement and validating the optimal centroids dynamically. An experimental result proves that proposed framework outperforms other competition subspace clustering technique in terms of efficiency, F Measure, parameter insensitiveness and accuracy.

Keywords: Information Retrieval, Sub space clustering, Numerical optimization, Data mining

Edition: Volume 3 Issue 12, December 2014,

Pages: 1896 - 1900