Feature Selection and Classification by Hybrid Optimization

(57 customer reviews)

$0.00

Total downloads: 245

This work implements the KNN classifier to train and classify the medical disease datasets like Breast cancer, Heart rate, Lymography data, etc. To improve the classification accuracy and reduce computational overhead, we proposed the hybrid optimization algorithm to optimally select the features from the database. The present repository has the MATLAB code for feature selection GoA and SA only.

Download Test
 Discuss Code
Categories: , , , Tags: , , ,

Description

The feature selection process in machine learning is quite important to reduce the overhead and improve accuracy. Various methods have been so far suggested but heuristic optimization methods are leading in those. We hereby proposed a novel hybrid optimization algorithm which combines the Grasshopper optimization (GoA) and Simulated annealing (SA). To make the hybrid optimization algorithm, two different approaches [1] are used: a low level and high level. We tested the proposed solution for both approaches and found low-level performance better than high-level hybridization. The datasets used for this are available here.

The feature selection process is based on binarizing the optimization algorithms. The indexes of features are either 1 or 0 if selected or not respectively. The matrix with an arrangement of 1 & 0’s is input to the optimization algorithm. Since the GoA is not developed to accept the binary input, so we rounded off the initial positions of wolves in GoA as

GrassHopperPositions=round(initialization(N,dim,ub,lb));

This will make the positions of GoA as 1 and 0. This now represents the index of selected features as the dimension of the wolf’s position is equal to the number of attributes in the database. Further, the updated position of GoA is also converted to binary by signum function [2]. In MATLAB it is represented as

 deltaX= c * S_i_total'+ (TargetPosition); % Eq. (2.7) in the paper
        for tt=1:size(deltaX,2)
            T_deltaX(tt)=1/(1+exp(-deltaX(tt)));
            if rand<T_deltaX(tt)
                X_new(tt) =1;
            else
                X_new(tt)=0;
            end
        end
        GrassHopperPositions_temp(i,:)=X_new';

The final selected binary position of GoA is the selected feature’s index, which is further classified by using the k-nearest neighbor classifier.

In this work, we have shown the comparison with all features and SA. For the proposed hybrid optimization approach, please write us admin@free-thesis.com.

57 reviews for Feature Selection and Classification by Hybrid Optimization

  1. Anonymous –

    Excellent

  2. Ram Kumar R P (verified owner) –

    Excellent Codes

  3. pourhaji (verified owner) –

    –

  4. k.sudheer (verified owner) –

    Greatly useful thesis available

  5. k.sudheer (verified owner) –

    very useful

  6. garba.abdulrauf (verified owner) –

    very useful work.

  7. ranjeet.yadav (verified owner) –

    Excellent if received

  8. venkat.reddy (verified owner) –

    great

  9. venkat.reddy (verified owner) –

    great

  10. ramahk92 (verified owner) –

    Thanks for Providing Code.

  11. stalin.babu (verified owner) –

    good

  12. divya.punia (verified owner) –

    great

  13. alok.kumar (verified owner) –

    Thanks for your support.

  14. alok.kumar (verified owner) –

    Thanks.

  15. sameer.kumthekar (verified owner) –

    best

  16. sun.yao (verified owner) –

    nice

  17. vankani.arjun (verified owner) –

    Nice project !!

  18. sahil.raj (verified owner) –

    awesome

  19. ali.daemi (verified owner) –

    tanx alot

  20. sameer.kumthekar (verified owner) –

    best one

  21. xuexi (verified owner) –

    good

  22. SHENXIAOXIAO (verified owner) –

    well done

  23. satrughan.kumar (verified owner) –

    well suported content

  24. richa.singh (verified owner) –

    good

  25. richa.singh (verified owner) –

    nice

  26. ratheesh.p m (verified owner) –

    Very Helpful

  27. ratheesh.p m (verified owner) –

    Very Useful

  28. ratheesh.p m (verified owner) –

    Very Useful

  29. ratheesh.p m (verified owner) –

    Very USeful

  30. ratheesh.p m (verified owner) –

    Useful

  31. ratheesh.p m (verified owner) –

    Useful

  32. ratheesh.p m (verified owner) –

    helpful

  33. ratheesh.p m (verified owner) –

    useful

  34. hodcse (verified owner) –

    super

  35. arun.s (verified owner) –

    good

  36. yousef.qudeisat (verified owner) –

    thank you

  37. yousef.qudeisat (verified owner) –

    thanks alot

  38. yuhang.deng (verified owner) –

    good

  39. daniela.irimia (verified owner) –

    Usefull, I hope!

  40. chou_aib (verified owner) –

    great

  41. chou_aib (verified owner) –

    Great

  42. harshithraj.k m (verified owner) –

    its good

  43. alaoui.alaoui (verified owner) –

    goog

  44. ftafta –

    THANKS

  45. arghalavand (verified owner) –

    thanks

  46. jingyu.zhang (verified owner) –

    good

  47. b.sahu (verified owner) –

    thanks

  48. jagadeesan.n (verified owner) –

    thanks

  49. omid.mokhlessi (verified owner) –

    thank you

  50. Sahebgoud (verified owner) –

    good and so helpful

  51. Sahebgoud (verified owner) –

    good and so helpful

  52. abhishek15491 (verified owner) –

    good

  53. panduranga.terlapu (verified owner) –

    GOOD

  54. panduranga.terlapu (verified owner) –

    GOOD

  55. panduranga.terlapu (verified owner) –

    good

  56. saranya.gunasekar (verified owner) –

    service good

  57. rizki.haleemdeen (verified owner) –

    GOOD

  58. mohammad.alshinwan (verified owner) –

    excellent

  59. ashanand.bhagat (verified owner) –

    fine

Only logged in customers who have purchased this product may leave a review.

Related products