{"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/kaggle-lshtc4-winning-solution","title":"Kaggle LSHTC4 Winning Solution","arxiv_id":"1405.0546","date":"2014-05-03","proceeding":null,"authors":["Antti Puurula","Jesse Read","Albert Bifet"],"abstract":"Our winning submission to the 2014 Kaggle competition for Large Scale\nHierarchical Text Classification (LSHTC) consists mostly of an ensemble of\nsparse generative models extending Multinomial Naive Bayes. The\nbase-classifiers consist of hierarchically smoothed models combining document,\nlabel, and hierarchy level Multinomials, with feature pre-processing using\nvariants of TF-IDF and BM25. Additional diversification is introduced by\ndifferent types of folds and random search optimization for different measures.\nThe ensemble algorithm optimizes macroFscore by predicting the documents for\neach label, instead of the usual prediction of labels per document. Scores for\ndocuments are predicted by weighted voting of base-classifier outputs with a\nvariant of Feature-Weighted Linear Stacking. The number of documents per label\nis chosen using label priors and thresholding of vote scores. This document\ndescribes the models and software used to build our solution. Reproducing the\nresults for our solution can be done by running the scripts included in the\nKaggle package. A package omitting precomputed result files is also\ndistributed. All code is open source, released under GNU GPL 2.0, and GPL 3.0\nfor Weka and Meka dependencies.","url_abs":"http://arxiv.org/abs/1405.0546v2","url_pdf":"http://arxiv.org/pdf/1405.0546v2.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":[],"tasks":[{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[{"method_slug":"random-search","method_name":"Random Search"}],"datasets_introduced":[{"slug":"mall-customer","name":"Online retail dataset","full_name":""}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e028cff43a8e2170fe5e42beec4033ffa4456ded89ae93f224a2e4de6858b797","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}