{"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-label-embedding-for-multi","title":"Cost-Sensitive Label Embedding for Multi-Label Classification","arxiv_id":"1603.09048","date":"2016-03-30","proceeding":null,"authors":["Kuan-Hao Huang","Hsuan-Tien Lin"],"abstract":"Label embedding (LE) is an important family of multi-label classification\nalgorithms that digest the label information jointly for better performance.\nDifferent real-world applications evaluate performance by different cost\nfunctions of interest. Current LE algorithms often aim to optimize one specific\ncost function, but they can suffer from bad performance with respect to other\ncost functions. In this paper, we resolve the performance issue by proposing a\nnovel cost-sensitive LE algorithm that takes the cost function of interest into\naccount. The proposed algorithm, cost-sensitive label embedding with\nmultidimensional scaling (CLEMS), approximates the cost information with the\ndistances of the embedded vectors by using the classic multidimensional scaling\napproach for manifold learning. CLEMS is able to deal with both symmetric and\nasymmetric cost functions, and effectively makes cost-sensitive decisions by\nnearest-neighbor decoding within the embedded vectors. We derive theoretical\nresults that justify how CLEMS achieves the desired cost-sensitivity.\nFurthermore, extensive experimental results demonstrate that CLEMS is\nsignificantly better than a wide spectrum of existing LE algorithms and\nstate-of-the-art cost-sensitive algorithms across different cost functions.","url_abs":"http://arxiv.org/abs/1603.09048v5","url_pdf":"http://arxiv.org/pdf/1603.09048v5.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-label-embedding-for-multi","repo_url":"https://github.com/ej0cl6/csmlc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"cost-sensitive-label-embedding-for-multi","repo_url":"https://github.com/evantkchong/LEPAR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"multi-label-classification-2","task_name":"MUlTI-LABEL-ClASSIFICATION"},{"task_slug":"multi-label-classification","task_name":"Multi-Label 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":"ej0cl6/csmlc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"evantkchong/LEPAR","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":"2bb2db87917b4682d54832ba6dcdb257d75e83f7ea684be328a3492117128803","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}