{"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/f-measure-maximization-in-multi-label","title":"F-measure Maximization in Multi-Label Classification with Conditionally Independent Label Subsets","arxiv_id":"1604.07759","date":"2016-04-26","proceeding":null,"authors":["Maxime Gasse","Alex Aussem"],"abstract":"We discuss a method to improve the exact F-measure maximization algorithm\ncalled GFM, proposed in (Dembczynski et al. 2011) for multi-label\nclassification, assuming the label set can be can partitioned into\nconditionally independent subsets given the input features. If the labels were\nall independent, the estimation of only $m$ parameters ($m$ denoting the number\nof labels) would suffice to derive Bayes-optimal predictions in $O(m^2)$\noperations. In the general case, $m^2+1$ parameters are required by GFM, to\nsolve the problem in $O(m^3)$ operations. In this work, we show that the number\nof parameters can be reduced further to $m^2/n$, in the best case, assuming the\nlabel set can be partitioned into $n$ conditionally independent subsets. As\nthis label partition needs to be estimated from the data beforehand, we use\nfirst the procedure proposed in (Gasse et al. 2015) that finds such partition\nand then infer the required parameters locally in each label subset. The latter\nare aggregated and serve as input to GFM to form the Bayes-optimal prediction.\nWe show on a synthetic experiment that the reduction in the number of\nparameters brings about significant benefits in terms of performance.","url_abs":"http://arxiv.org/abs/1604.07759v3","url_pdf":"http://arxiv.org/pdf/1604.07759v3.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":"f-measure-maximization-in-multi-label","repo_url":"https://github.com/gasse/fgfm-toy","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"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":"gasse/fgfm-toy","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":"d5b3f1d2e51e9b685c1642c1af7fbf61202602b44506b8692b3646bcbc1b6b66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}