[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-117476-en":3,"doc-seo-117476-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":4,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":27,"seo_description":14,"update_tm":28,"read_time":29},117476,1099514067415,"Rowan","https://ap-avatar.wpscdn.com/avatar/100002539d78ffe74a7?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779092875211072502",8,"Research & Report","A Novel Unsupervised Feature Selection Approach Using Genetic Algorithm on Partitioned Data","A novel unsupervised feature selection method is introduced to reduce high-dimensional data while preserving representative structure. Sammon’s Stress Function maps data into a lower-dimensional space, then the dataset is partitioned and features are assigned to partitions randomly. A genetic algorithm uses Sammon error as fitness to select a target number of features per partition, and the reduced feature subsets are iteratively repackaged for further refinement. Experiments on 11 standard datasets with Decision Tree, MLP, and KNN show higher accuracy on most datasets and fewer selected features than prior methods.","A Novel Unsupervised Feature Selection Approach Using Genetic  \nAlgorithm on Partitioned Data  \nAmit Saxena  \nDepartment of Computer Science and IT, Guru Ghashidash University, Bilashpur, India.  \nDeepesh Chugh  \nDepartment of Computer Engineering, Netaji Subhas Institute of Technology, Delhi, India.  \nHimanshu Mittal [himanshu.mittal224@gmail.com](himanshu.mittal224@gmail.com)  \nDepartment of AIDS,  \nIndira Gandhi Delhi Technical University for Women, Delhi, India India  \nMohammad Sajid  \nDepartment of Computer Science, Aligarh Muslim University, Aligarh, India.  \nRitu Chauhan  \nCentre for computational Biology and Bioinformatics, Amity University, Noida,  \nIndia.  \nEiad Yafi  \nCentre for computational Biology and Bioinformatics, Amity University, Noida,  \nIndia.  \nJian Cao  \nDepartment of Computer Science and Engineering, Shanghai Jiaotong University, Shang-hai,  \nChina.  \nMukesh Prasad [Mukesh.Prasad@uts.edu.au](Mukesh.Prasad@uts.edu.au)  \nSchool of Computer Science, FEIT, University of Technology Sydney, Sydney, Australia.  \nCorresponding Author: Mukesh Prasad  \nCopyright © 2022 Amit Saxena, et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.  \n500  \nCitation: Amit Saxena, et al. A Novel Unsupervised Feature Selection Approach Using Genetic Algorithm on Partitioned Data. Advancesin Artificial Intelligence and Machine Learning. 2022;2(4):34 .  \n[https://www.oajaiml.com/ | November-2022](https://www.oajaiml.com/ | November-2022) Amit Saxena, et al.  \nAbstract  \nA novel feature selection approach is presented in this paper. Sammon’s Stress Function transforms the high dimension data to a lower dimension data set. A data set is divided into small partitions. The features are assigned randomly to these partitions. Using GA with Sammon Error as fitness value, a small, desired number of features are selected from every partition. The combination of the reduced subsets of the features from these partitions is again divided into small partitions. After a certain number of iterating the process, a desired small number of features is obtained. For experimental validation, the proposed method has been tested on 11 standard datasets with three classifiers namely, Decision Tree, MLP and KNN. The classification accuracies obtained by the proposed method is highest on most of the considered datasets against the results reported in literature. Moreover, the proposed method selects comparatively less number of features in comparison to considered methods. The optimistic results obtained from the proposed method justify its strength.  \nKeywords: Feature Extraction, Unsupervised Feature Selection, Genetic Algorithm, Classification Techniques.  \n1. INTRODUCTION  \nWith the introduction of sophisticated electronic gadgets, there has been a tremendous growth in capturing vivid features of a data. This has resulted in exponential increase in data size. However, it is seen that some features are redundant and do not contribute to the inference of a learnable model. In fact, such features degrade the performance of a learning model. For example, microarray-datasets like, leukemia dataset, are large datasets which consist of thousands of features. However, a significant portion of these datasets is redundant only. Thus, the abundance of redundant and un-significant features leads to the problem of ‘curse of dimensionality’ which is one of the major problems of data mining [1] and pattern classification [2] . To mitigate this, it is necessary to identify features which are not only important but dominant over the entire dataset in representing the dataset and helps in achieving better learnable model. These features are termed as representative features of the dataset. In literature, there are number of feature selection approaches to retain representative features of a data. These me","cbCaiuchBe5AwKNY","https://ap.wps.com/l/cbCaiuchBe5AwKNY","pdf",170421,1,16,"English","en",105,"# Abstract\n# Introduction\n## Motivation: curse of dimensionality\n## Feature selection overview and categories\n## Unsupervised feature selection background","[{\"question\":\"What main idea does the proposed method use for unsupervised feature selection?\",\"answer\":\"It transforms high-dimensional data using Sammon’s Stress Function, partitions the dataset, and then applies a genetic algorithm to select representative features without label information.\"},{\"question\":\"How does the genetic algorithm decide which features to keep?\",\"answer\":\"It uses Sammon error as the fitness value, selecting a small desired number of features from each partition and iterating the process to obtain the final reduced set.\"},{\"question\":\"How is the method evaluated and what are the results?\",\"answer\":\"It is tested on 11 standard datasets using Decision Tree, MLP, and KNN. The method achieves the highest accuracy on most datasets and selects comparatively fewer features than methods reported in the literature.\"}]","A Novel Unsupervised Feature Selection Approach Using Genetic Algorithm on Partitioned Data | PDF",1785676078,40,{"code":4,"msg":31,"data":32},"ok",{"site_id":24,"language":23,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"a-novel-unsupervised-feature-selection-approach-using-genetic-algorithm-on-partitioned-data","",{"@graph":36,"@context":85},[37,54,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,51],{"item":41,"name":42,"@type":43,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":50},"https://docshare.wps.com/document/research-report/",3,{"item":52,"name":13,"@type":43,"position":53},"https://docshare.wps.com/document/a-novel-unsupervised-feature-selection-approach-using-genetic-algorithm-on-partitioned-data/117476/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":23,"description":14,"dateModified":62,"datePublished":62,"encodingFormat":61,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":41,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-08-02",true,{"@type":65,"interactionType":66,"userInteractionCount":4},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What main idea does the proposed method use for unsupervised feature selection?","Question",{"text":75,"@type":76},"It transforms high-dimensional data using Sammon’s Stress Function, partitions the dataset, and then applies a genetic algorithm to select representative features without label information.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How does the genetic algorithm decide which features to keep?",{"text":80,"@type":76},"It uses Sammon error as the fitness value, selecting a small desired number of features from each partition and iterating the process to obtain the final reduced set.",{"name":82,"@type":73,"acceptedAnswer":83},"How is the method evaluated and what are the results?",{"text":84,"@type":76},"It is tested on 11 standard datasets using Decision Tree, MLP, and KNN. The method achieves the highest accuracy on most datasets and selects comparatively fewer features than methods reported in the literature.","https://schema.org",{"og:url":52,"og:type":87,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":89,"canonical":52},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,119,122,127,130,134],{"id":20,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":53,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":46,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":46,"category_name":117,"show_sort_weight":29,"slug":118},7,"Healthcare","healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":120,"slug":121},30,"research-report",{"id":123,"doc_module":4,"doc_module_name":46,"category_name":124,"show_sort_weight":125,"slug":126},9,"Religion & Spirituality",20,"religion-spirituality",{"id":125,"doc_module":4,"doc_module_name":46,"category_name":128,"show_sort_weight":125,"slug":129},"World Cup","world-cup",{"id":131,"doc_module":4,"doc_module_name":46,"category_name":132,"show_sort_weight":131,"slug":133},10,"Lifestyle","lifestyle",{"id":135,"doc_module":4,"doc_module_name":46,"category_name":136,"show_sort_weight":106,"slug":137},19,"General","general"]