{"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/canonical-correlation-forests","title":"Canonical Correlation Forests","arxiv_id":"1507.05444","date":"2015-07-20","proceeding":null,"authors":["Tom Rainforth","Frank Wood"],"abstract":"We introduce canonical correlation forests (CCFs), a new decision tree\nensemble method for classification and regression. Individual canonical\ncorrelation trees are binary decision trees with hyperplane splits based on\nlocal canonical correlation coefficients calculated during training. Unlike\naxis-aligned alternatives, the decision surfaces of CCFs are not restricted to\nthe coordinate system of the inputs features and therefore more naturally\nrepresent data with correlated inputs. CCFs naturally accommodate multiple\noutputs, provide a similar computational complexity to random forests, and\ninherit their impressive robustness to the choice of input parameters. As part\nof the CCF training algorithm, we also introduce projection bootstrapping, a\nnovel alternative to bagging for oblique decision tree ensembles which\nmaintains use of the full dataset in selecting split points, often leading to\nimprovements in predictive accuracy. Our experiments show that, even without\nparameter tuning, CCFs out-perform axis-aligned random forests and other\nstate-of-the-art tree ensemble methods on both classification and regression\nproblems, delivering both improved predictive accuracy and faster training\ntimes. We further show that they outperform all of the 179 classifiers\nconsidered in a recent extensive survey.","url_abs":"http://arxiv.org/abs/1507.05444v6","url_pdf":"http://arxiv.org/pdf/1507.05444v6.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":"canonical-correlation-forests","repo_url":"https://github.com/twgr/ccfs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"canonical-correlation-forests","repo_url":"https://github.com/plai-group/ccfs-python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"canonical-correlation-forests","repo_url":"https://github.com/tonyjo/ccfs-python","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":"regression-1","task_name":"regression"}],"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":"twgr/ccfs","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"plai-group/ccfs-python","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tonyjo/ccfs-python","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":"6805daf009c79c11bb3ecc7cea2807dcdcf2509a12e1867b870eed0962246c20","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}