Determining and Exploring Dimensions in Subspace Clustering for Value Decomposition
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064



Downloads: 107 | Weekly Hits: ⮙2 | Monthly Hits: ⮙14

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

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

Share this Article

How to Cite this Article?

Saranya Sagambari Devi.S, "Determining and Exploring Dimensions in Subspace Clustering for Value Decomposition", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=SEP14723, Volume 3 Issue 12, December 2014, 1896 - 1900

Enter Your Registered Email Address





Similar Articles with Keyword 'Data mining'

Downloads: 102 | Weekly Hits: ⮙2 | Monthly Hits: ⮙8

Survey Paper, Information Technology, India, Volume 6 Issue 3, March 2017

Pages: 1403 - 1405

Inverse Problem with Solution Using Data Mining

Ashmikumari Shah, Pooja Jardosh

Share this Article

Downloads: 103 | Monthly Hits: ⮙10

Research Paper, Information Technology, India, Volume 4 Issue 6, June 2015

Pages: 2493 - 2496

An Effective Up-Growth Algorithm for Discovering High Utility Itemset Mining

Anuja Palhade, Rashmi Deshpande

Share this Article

Downloads: 105 | Weekly Hits: ⮙1 | Monthly Hits: ⮙12

Research Paper, Information Technology, India, Volume 3 Issue 6, June 2014

Pages: 1654 - 1660

Privacy Preserving Protocol for Two-Party Classifier Over Vertically Partitioned Dataset Using ANN

Smitha Iddalgave, Sumana M

Share this Article

Downloads: 106 | Monthly Hits: ⮙9

M.Tech / M.E / PhD Thesis, Information Technology, India, Volume 3 Issue 7, July 2014

Pages: 1743 - 1746

Hybrid Approach for Outlier Detection in High Dimensional Dataset

Rohini Balkrishna Gurav, Sonali Rangdale

Share this Article

Downloads: 106 | Weekly Hits: ⮙3

Research Paper, Information Technology, India, Volume 4 Issue 4, April 2015

Pages: 1051 - 1055

Enhancing the Protection scheme for FACTS-Based Transmission Lines using a Data Mining Model

Pallavi P. Wankhede, Rajesh K. Nasare

Share this Article



Top