{"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/revisiting-the-vector-space-model-sparse","title":"Revisiting the Vector Space Model: Sparse Weighted Nearest-Neighbor Method for Extreme Multi-Label Classification","arxiv_id":"1802.03938","date":"2018-02-12","proceeding":null,"authors":["Tatsuhiro Aoshima","Kei Kobayashi","Mihoko Minami"],"abstract":"Machine learning has played an important role in information retrieval (IR)\nin recent times. In search engines, for example, query keywords are accepted\nand documents are returned in order of relevance to the given query; this can\nbe cast as a multi-label ranking problem in machine learning. Generally, the\nnumber of candidate documents is extremely large (from several thousand to\nseveral million); thus, the classifier must handle many labels. This problem is\nreferred to as extreme multi-label classification (XMLC). In this paper, we\npropose a novel approach to XMLC termed the Sparse Weighted Nearest-Neighbor\nMethod. This technique can be derived as a fast implementation of\nstate-of-the-art (SOTA) one-versus-rest linear classifiers for very sparse\ndatasets. In addition, we show that the classifier can be written as a sparse\ngeneralization of a representer theorem with a linear kernel. Furthermore, our\nmethod can be viewed as the vector space model used in IR. Finally, we show\nthat the Sparse Weighted Nearest-Neighbor Method can process data points in\nreal time on XMLC datasets with equivalent performance to SOTA models, with a\nsingle thread and smaller storage footprint. In particular, our method exhibits\nsuperior performance to the SOTA models on a dataset with 3 million labels.","url_abs":"http://arxiv.org/abs/1802.03938v1","url_pdf":"http://arxiv.org/pdf/1802.03938v1.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":"revisiting-the-vector-space-model-sparse","repo_url":"https://github.com/hiro4bbh/sticker","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"extreme-multi-label-classification","task_name":"Extreme Multi-Label Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"multi-label-classification-2","task_name":"MUlTI-LABEL-ClASSIFICATION"},{"task_slug":"multi-label-classification","task_name":"Multi-Label Classification"},{"task_slug":"retrieval","task_name":"Retrieval"}],"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":"hiro4bbh/sticker","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":"de23c9087aa27c644a52e69b1d2a06ecadf4ec8ef6c9acdf6af2d9ac4c432693","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}