{"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/accurate-parameter-estimation-for-bayesian","title":"Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes","arxiv_id":"1708.07581","date":"2017-08-25","proceeding":null,"authors":["Francois Petitjean","Wray Buntine","Geoffrey I. Webb","Nayyar Zaidi"],"abstract":"This paper introduces a novel parameter estimation method for the probability\ntables of Bayesian network classifiers (BNCs), using hierarchical Dirichlet\nprocesses (HDPs). The main result of this paper is to show that improved\nparameter estimation allows BNCs to outperform leading learning methods such as\nRandom Forest for both 0-1 loss and RMSE, albeit just on categorical datasets.\n  As data assets become larger, entering the hyped world of \"big\", efficient\naccurate classification requires three main elements: (1) classifiers with\nlow-bias that can capture the fine-detail of large datasets (2) out-of-core\nlearners that can learn from data without having to hold it all in main memory\nand (3) models that can classify new data very efficiently.\n  The latest Bayesian network classifiers (BNCs) satisfy these requirements.\nTheir bias can be controlled easily by increasing the number of parents of the\nnodes in the graph. Their structure can be learned out of core with a limited\nnumber of passes over the data. However, as the bias is made lower to\naccurately model classification tasks, so is the accuracy of their parameters'\nestimates, as each parameter is estimated from ever decreasing quantities of\ndata. In this paper, we introduce the use of Hierarchical Dirichlet Processes\nfor accurate BNC parameter estimation.\n  We conduct an extensive set of experiments on 68 standard datasets and\ndemonstrate that our resulting classifiers perform very competitively with\nRandom Forest in terms of prediction, while keeping the out-of-core capability\nand superior classification time.","url_abs":"http://arxiv.org/abs/1708.07581v3","url_pdf":"http://arxiv.org/pdf/1708.07581v3.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":"accurate-parameter-estimation-for-bayesian","repo_url":"https://github.com/fpetitjean/HierarchicalDirichletProcessEstimation","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"accurate-parameter-estimation-for-bayesian","repo_url":"https://github.com/HerrmannM/HDP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"accurate-parameter-estimation-for-bayesian","repo_url":"https://github.com/HerrmannM/MonashMLHDP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"accurate-parameter-estimation-for-bayesian","repo_url":"https://github.com/fpetitjean/HDP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"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":"fpetitjean/HierarchicalDirichletProcessEstimation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"HerrmannM/HDP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"HerrmannM/MonashMLHDP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fpetitjean/HDP","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":"ba0ca0c1bfaafcc1fae7e89d1347f6a4a143fc180f6d81526214abc9a7b54e34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}