Feature choice may be a very necessary part for datamining, machinery learning and pattern recognition. Distance plays a very important role in Support Vector Machines (SVM) theory. Relief-F algorithm solves feature redundancy well but does not guarantee the maximum distance. To overcome this drawback, a feature subset selection algorithm is proposed that takes SVM average distance as estimation rule and sequential forward selection as search strategy. Using public knowledge set acquired from UCI, this algorithm is compared with the Relief-F. The results show that the recognition rate is over Relief-F with smaller selected options under computation quantity tolerant conditions

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Unsupervised Spectral Feature Selection with Dynamic Hyper-graph Learning ABSTRACT: In order to produce interpretable and discriminative results from unsupervised spectral feature selection (USFS) methods, an embedding
PROJECT TITLE : Joint detection and matching of feature points in multimodal images ABSTRACT: In this work, we propose a novel architecture for Convolutional Neural Networks (CNNs) for the joint detection and matching of feature
PROJECT TITLE : Prior Guided Feature Enrichment Network for Few-Shot Segmentation ABSTRACT: Methods of semantic segmentation that have advanced to the state-of-the-art require a sufficient amount of labeled data to achieve good
PROJECT TITLE : Unsupervised Feature Learning Architecture with Multi-clustering Integration RBM ABSTRACT: In this paper, we present a novel unsupervised feature learning architecture that consists of a multi-clustering integration
PROJECT TITLE : Small Low-Contrast Target Detection Data-Driven Spatiotemporal Feature Fusion and Implementation ABSTRACT: An essential and difficult task in the airspace is the detection of low-contrast targets that are relatively

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry