{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-feature-selection-based-on-perturbation","title":"A Feature Selection Based on Perturbation Theory","arxiv_id":"1902.09938","date":"2019-02-26","proceeding":null,"authors":["Javad Rahimipour Anaraki","Hamid Usefi"],"abstract":"Consider a supervised dataset $D=[A\\mid \\textbf{b}]$, where $\\textbf{b}$ is\nthe outcome column, rows of $D$ correspond to observations, and columns of $A$\nare the features of the dataset. A central problem in machine learning and\npattern recognition is to select the most important features from $D$ to be\nable to predict the outcome. In this paper, we provide a new feature selection\nmethod where we use perturbation theory to detect correlations between\nfeatures. We solve $AX=\\textbf{b}$ using the method of least squares and\nsingular value decomposition of $A$. In practical applications, such as in\nbioinformatics, the number of rows of $A$ (observations) are much less than the\nnumber of columns of $A$ (features). So we are dealing with singular matrices\nwith big condition numbers. Although it is known that the solutions of least\nsquare problems in singular case are very sensitive to perturbations in $A$,\nour novel approach in this paper is to prove that the correlations between\nfeatures can be detected by applying perturbations to $A$. The effectiveness of\nour method is verified by performing a series of comparisons with conventional\nand novel feature selection methods in the literature. It is demonstrated that\nin most situations, our method chooses considerably less number of features\nwhile attaining or exceeding the accuracy of the other methods.","url_abs":"http://arxiv.org/abs/1902.09938v1","url_pdf":"http://arxiv.org/pdf/1902.09938v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-feature-selection-based-on-perturbation","repo_url":"https://github.com/jracp/PerturbationFeatureSelection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-feature-selection-based-on-perturbation","repo_url":"https://github.com/jranaraki/PerturbationFeatureSelection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"jracp/PerturbationFeatureSelection","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jranaraki/PerturbationFeatureSelection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4b46ee9b4b17a94a6b1b41e8029a0bc7e789bc7331725791b16d7f09036ff957","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}