Skip to content

randomForestSGT

1.0.0

Random Forest Super Greedy Trees

0packages depend
1.2Kdownloads / year
test coverage
13/13checks pass

Overview

About
Maintained by Udaya B. KogalurFirst published 2026-05-111 releasesCRAN page ↗GitHub ↗

Implements random forest Super Greedy Trees (SGTs) for regression. SGTs extend classification and regression tree splitting by fitting lasso-penalized local parametric models at tree nodes, producing sparse univariate and multivariate geometric cuts such as axis-aligned splits, hyperplanes, ellipsoids, hyperboloids, and interaction-based cuts. Trees are grown best-split-first by selecting cuts that reduce empirical risk, and ensembles provide out-of-bag error estimation, prediction on new data, variable filtering, tuning of the hcut complexity parameter, coordinate-descent lasso fitting, variable importance, and local coefficient summaries. For the underlying method, see Ishwaran (2026) doi:10.1007/s10462-026-11541-6.

Install

Health

CRAN checks
13OK
Slowest check: 4.0 min · r-devel-windows-x86_64
Code health
None
Tests · ratio 0.00
not tracked
Coverage
100%
Documentation · exports
2
Dependencies · direct
Check history
  • OK2026-08-05
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • NOTE2026-08-01
    12 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • OK2026-06-09
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • ERROR2026-06-08
    12 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
  • OK2026-05-12
    8 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE

Documentation

Documentation
READMENoVignettesNopkgdown siteNoNEWSYes · 67% structuredCode of conductNoContributing guideNo
Examples that run
67%
Documented parameters
89%
Return-value docs
100%
References docs
50%

Downloads

1.2K
CRAN downloads in the past year
Rank #10,406 · ~3/day · ~100/mo
Daily download trend is not available in this view yet.
17930 days
92190 days
1.2K1 year
Compare downloads with other packages →
Also on76 r2u27 autocran

Repository

Repository
0Stars
1Forks
0Open issues
0Open PRs
0Releases
15Commits
1Contributors
License GPL-3.0 · 15 commits · Last activity 2025-07-16

Forks over time

2026-05-28 · 12026-07-07 · 1

Repository practices

Upstream repositoryBeta

Checks run against github.com/kogalur/randomforestsgt on 2026-08-16.

No development-tooling practices detected in the upstream repository.

How this is detected·Detection ruleset v1 (2026-07-18)

Dependencies

Declared dependencies
5 external dependencies (excludes base and recommended)
Depends (1)
R >= 4.3.0
LinkingTo (0)
none
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Code & Tests

People & History

People (3)
Maintainer (1)
Author, Maintainer
Authors (3)
Author, Maintainer
Author
Package Timeline

1 release. R releases are shown for context.

  • 1.0.0Latest
    2026-05-11 · current release
  • R
    R 4.6.0 released · 2026-04-24

Package metadata

First published
2026-05-11
Total releases
1 / 1 yrs
License
GPL (>= 3) OSI
Minimum R
≥ 4.3.0
Download size
166 KB
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("randomForestSGT")
Kogalur, U. B., Ishwaran, H., & Lu, M. (2026). randomForestSGT: Random Forest Super Greedy Trees (Version 1.0.0) [Computer software]. https://doi.org/10.32614/CRAN.package.randomForestSGT

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for randomForestSGT version 1.0.0 [Data set]. HJJB, LLC. Data release v2026-08-22. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-22, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy