An Efficient, Effective and High Probability Clustering Based Algorithm for Feature Selection

A. Mallareddy, Ch Vasavi, G Arpitha

Abstract


This technique is used to Enhance, reduce the training times and also to data analyze. Scatter search and variable neighbor search. For the prediction what are the important features and map the relations of the feature. Like the way feature selection of sub sets efficiently effectively extracted from the high dimensional data.

Keywords


Feature selection, Subset, K-Means, FAST, Clustering,Redundant data, Text classification, Rule mining.

Full Text:

PDF


Bookmark and Share


Copyright (c) 2015 A. Mallareddy, Ch Vasavi, G Arpitha

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org