A graph-based approach for feature selection from higher order correlations
by Sunanda Das; Asit Kumar Das
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 4, No. 1, 2018

Abstract: Graph technology emerges as an important topic in the field of data mining and machine learning community. The analysis of high-dimensional data is crucial to identify a smaller subset of features which are informative for classification and clustering. In this paper, an efficient graph feature selection method is proposed to render the analysis of high-dimensional data tractable. Here, the feature scores are calculated for obtaining the weights of the edges in the weighted graph to identify the optimal feature subset. One advantage of this method is that it can successfully identify the optimal features for machine learning. The experimental results on our dataset verify the effectiveness and efficiency of the proposed method.

Online publication date: Sun, 25-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com