{"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/optimal-margin-evolutionary-classifier","title":"Optimal-margin evolutionary classifier","arxiv_id":"1804.09891","date":"2018-04-26","proceeding":null,"authors":["Mohammad Reza Bonyadi","David C. Reutens"],"abstract":"We introduce a novel approach for discriminative classification using\nevolutionary algorithms. We first propose an algorithm to optimize the total\nloss value using a modified 0-1 loss function in a one-dimensional space for\nclassification. We then extend this algorithm for multi-dimensional\nclassification using an evolutionary algorithm. The proposed evolutionary\nalgorithm aims to find a hyperplane which best classifies instances while\nminimizes the classification risk. We test particle swarm optimization,\nevolutionary strategy, and covariance matrix adaptation evolutionary strategy\nfor optimization purpose. Finally, we compare our results with well-established\nand state-of-the-art classification algorithms, for both binary and multi-class\nclassification, on 19 benchmark classification problems, with and without noise\nand outliers. Results show that the performance of the proposed algorithm is\nsignificantly (t-test) better than all other methods in almost all problems\ntested. We also show that the proposed algorithm is significantly more robust\nagainst noise and outliers comparing to other methods. The running time of the\nalgorithm is within a reasonable range for the solution of real-world\nclassification problems.","url_abs":"http://arxiv.org/abs/1804.09891v1","url_pdf":"http://arxiv.org/pdf/1804.09891v1.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":"optimal-margin-evolutionary-classifier","repo_url":"https://github.com/rezabonyadi/LinearOEC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"multi-class-classification","task_name":"Multi-class Classification"}],"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":"rezabonyadi/LinearOEC","kind":"official","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":"a0c65040527f4744debd552536ba7717da45abdf77a548dfda446ed88362cfc8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}