• Sakshi Singh

We present a novel group of information driven linear transformations, planned for discovering low-dimensional embeddings of multivariate information, in a way that ideally saves the structure of the information. The all-around examined PCA and Fisher's LDA are demonstrated to be unique individuals in this group of changes, and we exhibit how to sum up these two methods, for example, to upgrade their execution. Moreover, our strategy is the one and only one, as far as we could possibly know, that reflects in the subsequent installing both the information organizes and pairwise connections between the information components. Much more along these lines, when data on the clustering (labeling) decomposition of the information is known, this data can likewise be coordinated in the linear transformation, coming about in embeddings that plainly show the partition between the groups, just as their interior structure. The entirety of this makes our method truly adaptable and amazing, and lets us adapt to sorts of information that different methods neglect to depict appropriately.

Transformation, Dimensionality reduction, Linear, Robust, Principal component analysis.

"A Robust Way of Dimensionality Reduction", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.674-679, May-2019, Available :http://www.jetir.org/papers/JETIREY06128.pdf

"A Robust Way of Dimensionality Reduction", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp674-679, May-2019, Available at : http://www.jetir.org/papers/JETIREY06128.pdf