{"id":25148898,"url":"https://github.com/bethatkinson/rpart","last_synced_at":"2025-04-04T21:11:39.830Z","repository":{"id":42501839,"uuid":"136485653","full_name":"bethatkinson/rpart","owner":"bethatkinson","description":"Recursive Partitioning and Regression Trees","archived":false,"fork":false,"pushed_at":"2024-07-12T14:55:19.000Z","size":312,"stargazers_count":49,"open_issues_count":44,"forks_count":24,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-10-30T01:39:48.137Z","etag":null,"topics":["cart","classification","cran","r","statistics"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bethatkinson.png","metadata":{"files":{"readme":"README.md","changelog":"ChangeLog","contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-06-07T14:01:48.000Z","updated_at":"2024-10-28T02:25:39.000Z","dependencies_parsed_at":"2024-06-18T21:15:38.419Z","dependency_job_id":"6517c80c-6d95-45f5-aa03-9c708e423123","html_url":"https://github.com/bethatkinson/rpart","commit_stats":{"total_commits":29,"total_committers":6,"mean_commits":4.833333333333333,"dds":0.3448275862068966,"last_synced_commit":"87ac1acea87d0d6da6ff73f62b3e2dc017477a7b"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bethatkinson%2Frpart","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bethatkinson%2Frpart/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bethatkinson%2Frpart/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bethatkinson%2Frpart/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bethatkinson","download_url":"https://codeload.github.com/bethatkinson/rpart/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247249536,"owners_count":20908212,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cart","classification","cran","r","statistics"],"created_at":"2025-02-08T21:17:30.671Z","updated_at":"2025-04-04T21:11:39.811Z","avatar_url":"https://github.com/bethatkinson.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# The `rpart` package \u003cimg src=\"man/figures/rpart.png\" alt=\"Rpart logo\" style=\"float:right;height:232.25px\" align=\"right\" height=\"232.25\"\u003e\n\n\n[![CRAN_STATUS_BADGE](http://www.r-pkg.org/badges/version/rpart)](https://CRAN.R-project.org/package=rpart)\n[![Downloads](http://cranlogs.r-pkg.org/badges/rpart)](https://CRAN.R-project.org/package=rpart)\n\n\n\nThis is the source code for the  `rpart` package, which is a recommended package in R.\nIt gets posted to the comprehensive R archive (CRAN) as needed after undergoing a thorough testing.\n\n\n## Overview\n\nThe `rpart` code builds classification or regression models of a very\ngeneral structure using a two stage procedure; the resulting models can be\nrepresented as binary trees. The package implements many of the ideas found\nin the CART (Classification and Regression Trees) book and programs of\nBreiman, Friedman, Olshen and Stone.  Because CART is the trademarked name\nof a particular software implementation of these ideas and `tree` was used\nfor the Splus routines of Clark and Pregibon, a different acronym -\nRecursive PARTitioning or rpart - was chosen.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbethatkinson%2Frpart","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbethatkinson%2Frpart","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbethatkinson%2Frpart/lists"}