Title: High Dimensional Graphical Data Reduction

Author(s):  Smita J.Khelukar1

1Computer Engineering Department,

SVIT COE, Chincholi, Sinner, Nasik, Pune University, Maharashtra, India.

This email address is being protected from spambots. You need JavaScript enabled to view it.



The coming century is surely the century of data. A combination of blind faith and serious purpose makes our society invest massively in the collection and processing of data of all kinds, on scales unimaginable until recently. In spite of the fact that graph embedding has been an intense instrument for displaying data natural structures, just utilizing all elements for data structures revelation may bring about noise amplification. This is especially serious for high dimensional data with little examples. To meet this test, a novel effective structure to perform highlight determination for graph embedding, in which a classification of graph implanting routines is given a role as a slightest squares relapse issue. In this structure, some preprocessing techniques for instance selection are used. Classification, Clustering are used for accuracy calculation

License: This work is licensed under a Creative Commons Attribution 4.0 International License.


Website: http://www.ijecs.in

e-ISSN:  2319-724



About Us

The“International Journal of Engineering  and computer science”(IJECS™) is an international online journal in English published monthly. The aim of IJECS is to publish peer reviewed research and review articles in rapidly developing field of engineering science and technology


Address : LIG 73 megdoot Nagar Mandsaur

State : Madhya Pradesh

Country : INDIA

Phone :+91 (822) 260 24 694

Email: editor@ijecs.in

Go to top