{"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/inverse-category-frequency-based-supervised","title":"Inverse-Category-Frequency based supervised term weighting scheme for text categorization","arxiv_id":"1012.2609","date":"2010-12-13","proceeding":null,"authors":["Deqing Wang","HUI ZHANG"],"abstract":"Term weighting schemes often dominate the performance of many classifiers,\nsuch as kNN, centroid-based classifier and SVMs. The widely used term weighting\nscheme in text categorization, i.e., tf.idf, is originated from information\nretrieval (IR) field. The intuition behind idf for text categorization seems\nless reasonable than IR. In this paper, we introduce inverse category frequency\n(icf) into term weighting scheme and propose two novel approaches, i.e., tf.icf\nand icf-based supervised term weighting schemes. The tf.icf adopts icf to\nsubstitute idf factor and favors terms occurring in fewer categories, rather\nthan fewer documents. And the icf-based approach combines icf and relevance\nfrequency (rf) to weight terms in a supervised way. Our cross-classifier and\ncross-corpus experiments have shown that our proposed approaches are superior\nor comparable to six supervised term weighting schemes and three traditional\nschemes in terms of macro-F1 and micro-F1.","url_abs":"http://arxiv.org/abs/1012.2609v4","url_pdf":"http://arxiv.org/pdf/1012.2609v4.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":"inverse-category-frequency-based-supervised","repo_url":"https://github.com/textvec/textvec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"inverse-category-frequency-based-supervised","repo_url":"https://github.com/zveryansky/textvec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"cross-corpus","task_name":"Cross-corpus"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"multi-class-classification","task_name":"Multi-class Classification"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"text-categorization","task_name":"Text Categorization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/multi-class-classification-on-reuters-52","task":"Multi-class Classification","dataset":"Reuters-52","model":"SVM (tficf)","rank_in_archive_order":1,"of":1,"metrics":{"Macro F1":"73.9"},"uses_additional_data":false}],"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":"textvec/textvec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zveryansky/textvec","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":"cf5109aee3d5b3dc2eeec71c1c07e44c4d6c2c29d2602f1ec7b19ecba24d0568","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}