RMSC: Robust modeling of subspace clustering for high dimensional data

Subspace clustering is one of the active research problem associated with high-dimensional data. Here some of the standard techniques are reviewed to investigate existing methodologies. Although, there have been various forms of research techniques evolved recently, they do not completely mitigate the problems pertaining to noise sustainability and optimization of clustering accuracy. Hence, a novel technique called as Robust Modeling of Subspace Clustering (RMSC) presented to solve the above problem. An analytical research methodology is used to formulate two algorithms for computing outliers and for extracting elite subspace from the high-dimensional data inflicted by different forms of noise. RMSC was found to offer higher accuracy and lower error rate both in presence of noise and absence of noise over high-dimensional data.

[1]  Tao Li,et al.  Nonconvex Low-Rank Sparse Factorization for Image Segmentation , 2015, 2015 11th International Conference on Computational Intelligence and Security (CIS).

[2]  C. Giraud.  Introduction to High-Dimensional Statistics , 2014 .

[3]  Georgios B. Giannakis,et al.  Sketch and Validate for Big Data Clustering , 2015, IEEE Journal of Selected Topics in Signal Processing.

[4]  Panos M. Pardalos,et al.  Clusters, Orders, and Trees: Methods and Applications , 2014 .

[5]  Mohsen Pourahmadi,et al.  High-Dimensional Covariance Estimation , 2013 .

[6]  Sara van de Geer,et al.  Statistics for High-Dimensional Data , 2011 .

[7]  Mohsen Pourahmadi,et al.  High-Dimensional Covariance Estimation , 2013 .

[8]  Jianzhong Wang,et al.  Geometric Structure of High-Dimensional Data and Dimensionality Reduction , 2012 .

[9]  C. O’Brien.  Statistical Learning with Sparsity: The Lasso and Generalizations , 2016 .

[10]  Hui Song,et al.  Unsupervised Classification of PolSAR Imagery via Kernel Sparse Subspace Clustering , 2016, IEEE Geoscience and Remote Sensing Letters.

[11]  Giovanni Montana,et al.  Subspace clustering of high-dimensional data: a predictive approach , 2012, Data Mining and Knowledge Discovery.

[12]  Po-Ling Loh,et al.  High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity , 2011, NIPS.

[13]  Mukkamalla Babu Reddy,et al.  Feature selection for high dimensional data , 2009 .

[14]  Constantine Caramanis,et al.  Greedy Subspace Clustering , 2014, NIPS.

[15]  René Vidal,et al.  A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion , 2016, IEEE Transactions on Signal Processing.

[16]  Qilong Wang,et al.  From dictionary of visual words to subspaces: Locality-constrained affine subspace coding , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[17]  K. R. Venugopal,et al.  EDSC: Efficient document subspace clustering technique for high-dimensional data , 2016, 2016 International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT).

[18]  Junbin Gao,et al.  Tensor LRR and Sparse Coding-Based Subspace Clustering , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[19]  Honggang Zhang,et al.  Low-rank and structured sparse subspace clustering , 2016, 2016 Visual Communications and Image Processing (VCIP).

[20]  R. Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications. , 2013, IEEE transactions on pattern analysis and machine intelligence.

[21]  Tao Xu,et al.  Methods for learning adaptive dictionary in underdetermined speech separation , 2011, 2011 IEEE International Workshop on Machine Learning for Signal Processing.

[22]  秀俊 松井,et al.  Statistics for High-Dimensional Data: Methods, Theory and Applications , 2014 .

[23]  Fang Chen,et al.  Spectral clustering of high-dimensional data via Nonnegative Matrix Factorization , 2015, 2015 International Joint Conference on Neural Networks (IJCNN).

[24]  Ping Li,et al.  Online Low-Rank Subspace Clustering by Basis Dictionary Pursuit , 2015, ICML.

[25]  Zhang Yi,et al.  A Unified Framework for Representation-Based Subspace Clustering of Out-of-Sample and Large-Scale Data , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[26]  Bo Li,et al.  Information Theoretic Subspace Clustering , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[27]  Antonio J. Plaza,et al.  A New Sparse Subspace Clustering Algorithm for Hyperspectral Remote Sensing Imagery , 2017, IEEE Geoscience and Remote Sensing Letters.

[28]  Xuelong Li,et al.  Robust Semi-Supervised Subspace Clustering via Non-Negative Low-Rank Representation , 2016, IEEE Transactions on Cybernetics.

[29]  Jian Yang,et al.  Modified Principal Component Analysis: An Integration of Multiple Similarity Subspace Models , 2014, IEEE Transactions on Neural Networks and Learning Systems.

[30]  René Vidal,et al.  Abstract algebraic-geometric subspace clustering , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[31]  Moncef Gabbouj,et al.  K-Subspaces Quantization for Approximate Nearest Neighbor Search , 2016, IEEE Transactions on Knowledge and Data Engineering.

[32]  Chuang Lin,et al.  Matrix Factorization with Column L0-Norm Constraint for Robust Multi-subspace Analysis , 2015, 2015 IEEE International Conference on Data Mining Workshop (ICDMW).