{"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/cost-sensitive-support-vector-machines","title":"Cost-Sensitive Support Vector Machines","arxiv_id":"1212.0975","date":"2012-12-05","proceeding":null,"authors":["Hamed Masnadi-Shirazi","Nuno Vasconcelos","Arya Iranmehr"],"abstract":"A new procedure for learning cost-sensitive SVM(CS-SVM) classifiers is\nproposed. The SVM hinge loss is extended to the cost sensitive setting, and the\nCS-SVM is derived as the minimizer of the associated risk. The extension of the\nhinge loss draws on recent connections between risk minimization and\nprobability elicitation. These connections are generalized to cost-sensitive\nclassification, in a manner that guarantees consistency with the cost-sensitive\nBayes risk, and associated Bayes decision rule. This ensures that optimal\ndecision rules, under the new hinge loss, implement the Bayes-optimal\ncost-sensitive classification boundary. Minimization of the new hinge loss is\nshown to be a generalization of the classic SVM optimization problem, and can\nbe solved by identical procedures. The dual problem of CS-SVM is carefully\nscrutinized by means of regularization theory and sensitivity analysis and the\nCS-SVM algorithm is substantiated. The proposed algorithm is also extended to\ncost-sensitive learning with example dependent costs. The minimum cost\nsensitive risk is proposed as the performance measure and is connected to ROC\nanalysis through vector optimization. The resulting algorithm avoids the\nshortcomings of previous approaches to cost-sensitive SVM design, and is shown\nto have superior experimental performance on a large number of cost sensitive\nand imbalanced datasets.","url_abs":"http://arxiv.org/abs/1212.0975v2","url_pdf":"http://arxiv.org/pdf/1212.0975v2.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":"cost-sensitive-support-vector-machines","repo_url":"https://github.com/BaptisteH3089/ImbLearning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1212.0975","atlas_url":"https://app.syntology.ai/?focus=1212.0975","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1212.0975"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1212.0975\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1212.0975"},"call":"get_concepts_for_paper(arxiv_id=\"1212.0975\")"}],"by_repo":[{"repo":"BaptisteH3089/ImbLearning","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":"b76eba56024efa9d613902e51679678002e9018df377fbecf5e040628e4c861c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}