{"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/cgmos-certainty-guided-minority-oversampling","title":"CGMOS: Certainty Guided Minority OverSampling","arxiv_id":"1607.06525","date":"2016-07-21","proceeding":null,"authors":["Xi Zhang","Di Ma","Lin Gan","Shanshan Jiang","Gady Agam"],"abstract":"Handling imbalanced datasets is a challenging problem that if not treated\ncorrectly results in reduced classification performance. Imbalanced datasets\nare commonly handled using minority oversampling, whereas the SMOTE algorithm\nis a successful oversampling algorithm with numerous extensions. SMOTE\nextensions do not have a theoretical guarantee during training to work better\nthan SMOTE and in many instances their performance is data dependent. In this\npaper we propose a novel extension to the SMOTE algorithm with a theoretical\nguarantee for improved classification performance. The proposed approach\nconsiders the classification performance of both the majority and minority\nclasses. In the proposed approach CGMOS (Certainty Guided Minority\nOverSampling) new data points are added by considering certainty changes in the\ndataset. The paper provides a proof that the proposed algorithm is guaranteed\nto work better than SMOTE for training data. Further experimental results on 30\nreal-world datasets show that CGMOS works better than existing algorithms when\nusing 6 different classifiers.","url_abs":"http://arxiv.org/abs/1607.06525v1","url_pdf":"http://arxiv.org/pdf/1607.06525v1.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":"cgmos-certainty-guided-minority-oversampling","repo_url":"https://github.com/xzhang311/CGMOS","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":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"smote","method_name":"SMOTE"}],"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":"xzhang311/CGMOS","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":"97337c8a45e5c1d2a61cfa6c1ecc1525138504f7d4b27bf0a23b5761e23121db","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}