A Novel Tool For Fast Feature Selection

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-17

This paper introduces a new framework for identifying relevant and removing redundant features in supervised datasets to reduce computation time and improve machine learning model performance.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

Abstract

Abstract Motivation: Datasets with high dimensionality represent a challenge to existing learning methods. The presence of irrelevant and redundant features in a dataset can degrade the performance of the models inferred from it. In large datasets, manual management of features tends to be impractical. Therefore, the development of automatic discovery techniques to remove useless features has attracted increasing interest. In this paper, we propose a novell framework to select relevant features in supervised datasets. Availability: This tool can be downloaded from https://github.com/ivangarcia88/selectionResults: This tool allow to identify relevant and remove redundant features, reducing computation time on training a machine learning model while improving the performance.
Full text 15,471 characters · extracted from preprint-html · click to expand
A Novel Tool For Fast Feature Selection | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Software article A Novel Tool For Fast Feature Selection Ivan Alejandro Garcia Ramirez, Arturo Calderon, Andrés Méndez, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-60546/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Motivation: Datasets with high dimensionality represent a challenge to existing learning methods. The presence of irrelevant and redundant features in a dataset can degrade the performance of the models inferred from it. In large datasets, manual management of features tends to be impractical. Therefore, the development of automatic discovery techniques to remove useless features has attracted increasing interest. In this paper, we propose a novell framework to select relevant features in supervised datasets. Availability: This tool can be downloaded from https://github.com/ivangarcia88/ selection Results: This tool allow to identify relevant and remove redundant features, reducing computation time on training a machine learning model while improving the performance. Bioinformatics Machine learning Feature selection Python tool Figures Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 Full Text Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-60546","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Software article","associatedPublications":[],"authors":[{"id":1489448,"identity":"85c5847c-b8cd-4ed2-93f1-1bcf92db411d","order_by":0,"name":"Ivan Alejandro Garcia Ramirez","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABFElEQVRIiWNgGAWjYBACNgglwcDPwGB4AMQgXotkA4MBTAtjA1HWAdWDtDAQ1sLHfvzi54oaC3nj84s3HGCoscgzON7+/MHPNoZouAnoDuPJKZY8c0zCcNuNZwUHGI5JFBucOWPY2NvGkDsTh11sDDkJko0NEozbbpwxOMDYIJE4c0YOYwPPGYbcfhwOY+N/k/wTqMV+8wyYlvnPHzb+AWppw6VFIv0YyJbEDfw9EC39EgyGzTwVeGyReMNm2XBMInnGDbaCAwnHgFp4cgxny1RI4PSLfH/645sNNXW2/f2HNz74UFOX2MZ+/MHHNwY2uRtwhBgDA48BhJZIYGBIQAjjSwbsDyA0P05DR8EoGAWjYKQDAN+UYOZD2OqjAAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0001-6260-7359","institution":"Centro de Investigacion y de Estudios Avanzados del Instituto Politecnico Nacional","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Ivan","middleName":"Alejandro Garcia","lastName":"Ramirez","suffix":""},{"id":1489449,"identity":"fad22d4b-c8e2-474b-8e9e-47a0a7d28716","order_by":1,"name":"Arturo Calderon","email":"","orcid":"","institution":"Centro de Investigacion y de Estudios Avanzados del Instituto Politecnico Nacional","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Arturo","middleName":"","lastName":"Calderon","suffix":""},{"id":1489450,"identity":"c8a8fc67-bad2-403d-99bd-8e7bb52a03ff","order_by":2,"name":"Andrés Méndez","email":"","orcid":"","institution":"Centro de Investigacion y de Estudios Avanzados del Instituto Politecnico Nacional","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Andrés","middleName":"","lastName":"Méndez","suffix":""},{"id":1489451,"identity":"e7551352-036c-4031-90c6-453da2630bc4","order_by":3,"name":"Susana Ortega","email":"","orcid":"","institution":"Centro de Investigacion y de Estudios Avanzados del Instituto Politecnico Nacional","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Susana","middleName":"","lastName":"Ortega","suffix":""}],"badges":[],"createdAt":"2020-08-16 12:15:10","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-60546/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-60546/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":1976795,"identity":"7872df2d-33e9-4eba-87d2-0ae26d47f9d7","added_by":"auto","created_at":"2020-08-18 17:41:26","extension":"jpg","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":68075,"visible":true,"origin":"","legend":"A noisy linear relation and its corresponding Pearson score.","description":"","filename":"01.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/01.jpg"},{"id":1976796,"identity":"e89f35c0-60e5-4346-8360-0395a49ff4d5","added_by":"auto","created_at":"2020-08-18 17:41:26","extension":"jpg","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":49990,"visible":true,"origin":"","legend":"Partition and placement for the computation of the MIC metric.","description":"","filename":"02.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/02.jpg"},{"id":1976797,"identity":"e7482ec9-3629-42b9-82c3-96853a0c50ed","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":57053,"visible":true,"origin":"","legend":"Partial mutual information computation for a 3 \u0002 3 grid.","description":"","filename":"03.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/03.jpg"},{"id":1976798,"identity":"e97a051e-6747-4e7c-b6ea-e9e0b4d7a0a6","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":61023,"visible":true,"origin":"","legend":"Mutual information computation for a 3 \u0002 3 grid.","description":"","filename":"04.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/04.jpg"},{"id":1976799,"identity":"61bf0307-d4ea-4bde-9c9a-f35be107be18","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":5,"title":"Figure 5","display":"","copyAsset":false,"role":"figure","size":146441,"visible":true,"origin":"","legend":"feature selection process","description":"","filename":"05.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/05.jpg"},{"id":1976800,"identity":"c5a61731-832a-4486-a74c-0a3064fc37fc","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":6,"title":"Figure 6","display":"","copyAsset":false,"role":"figure","size":109324,"visible":true,"origin":"","legend":"Evaluation of mutual information in equipartitioned square grids to ensure linearity. The cells with p(x; y) 6= 0 are highlighted.","description":"","filename":"06.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/06.jpg"},{"id":1976801,"identity":"88938e32-db6e-41bb-bc35-6e5bae403045","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":7,"title":"Figure 7","display":"","copyAsset":false,"role":"figure","size":166473,"visible":true,"origin":"","legend":"Architecture overview.","description":"","filename":"07.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/07.jpg"},{"id":1976802,"identity":"23bd4289-0d95-46d4-8b3e-0ed093b6a774","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":8,"title":"Figure 8","display":"","copyAsset":false,"role":"figure","size":38144,"visible":true,"origin":"","legend":"Single Instruction Multiple Data (SIMD) model.","description":"","filename":"08.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/08.jpg"},{"id":1976803,"identity":"d93774f1-4ad2-4e8b-b661-14b3e0330805","added_by":"auto","created_at":"2020-08-18 17:41:27","extension":"jpg","order_by":9,"title":"Figure 9","display":"","copyAsset":false,"role":"figure","size":6431403,"visible":true,"origin":"","legend":"Comparative full-feature dataset vs feature selected subset (1)","description":"","filename":"09.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/09.jpg"},{"id":1976804,"identity":"e4e2c560-85d7-4a84-b851-962e84be1c9b","added_by":"auto","created_at":"2020-08-18 17:41:28","extension":"jpg","order_by":10,"title":"Figure 10","display":"","copyAsset":false,"role":"figure","size":6190264,"visible":true,"origin":"","legend":"Comparative full-feature dataset vs feature selected subset (1)","description":"","filename":"10.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/10.jpg"},{"id":1976805,"identity":"97ea089b-e137-401c-8b4c-6f230cd32936","added_by":"auto","created_at":"2020-08-18 17:41:28","extension":"jpg","order_by":11,"title":"Figure 11","display":"","copyAsset":false,"role":"figure","size":5964049,"visible":true,"origin":"","legend":"Comparative full-feature dataset vs feature selected subset (2)","description":"","filename":"11.jpg","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/11.jpg"},{"id":13523922,"identity":"103a7e3f-aacf-4724-9f38-2ba9edbac2fa","added_by":"auto","created_at":"2021-09-17 00:42:20","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2355146,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1_covered.pdf"},{"id":1976807,"identity":"5087b4d6-0850-4fce-b8eb-2acaa1495eda","added_by":"auto","created_at":"2020-08-18 17:41:30","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1272614,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1_stamped.pdf"},{"id":1976806,"identity":"99ff44b1-b652-4afc-ace9-509366071acd","added_by":"auto","created_at":"2020-08-18 17:41:28","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1218189,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-60546/v1/Manuscript.pdf"}],"financialInterests":"","formattedTitle":"A Novel Tool For Fast Feature Selection","fulltext":[{"header":"Full Text","content":"\u003cp\u003eThis preprint is available for \u003ca href='/article/rs-60546/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e.\u003c/p\u003e"}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Machine learning, Feature selection, Python tool","lastPublishedDoi":"10.21203/rs.3.rs-60546/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-60546/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eMotivation: Datasets with high dimensionality represent a challenge to existing learning methods. The presence of irrelevant and redundant features in a dataset can degrade the performance of the models inferred from it. In large datasets, manual management of features tends to be impractical. Therefore, the development of automatic discovery techniques to remove useless features has attracted increasing interest. In this paper, we propose a novell framework to select relevant features in supervised datasets. \u003c/p\u003e\u003cp\u003eAvailability: This tool can be downloaded from https://github.com/ivangarcia88/\u000bselection\u003c/p\u003e\u003cp\u003eResults: This tool allow to identify relevant and remove redundant features, reducing computation time on training a machine learning model while improving the performance.\u003c/p\u003e","manuscriptTitle":"A Novel Tool For Fast Feature Selection","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2020-08-18 17:41:26","doi":"10.21203/rs.3.rs-60546/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"013d1093-9375-4e3d-b441-659feafe5a1f","owner":[],"postedDate":"August 18th, 2020","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":317224,"name":"Bioinformatics"}],"tags":[],"updatedAt":"2021-01-12T17:20:48+00:00","versionOfRecord":[],"versionCreatedAt":"2020-08-18 17:41:26","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-60546","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-60546","identity":"rs-60546","version":["v1"]},"buildId":"FbvkV6FR0MCFSLy54lSbu","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-02T02:00:03.124865+00:00
License: CC-BY-4.0