|
7 | 7 |
|
8 | 8 | <!-- Devel badges start: --> |
9 | 9 |
|
10 | | -<!-- [](https://CRAN.R-project.org/package=FFTrees) --> |
11 | | - |
12 | | -<!-- [](https://www.r-pkg.org/pkg/FFTrees) --> |
13 | | - |
14 | | -<!-- [](https://www.r-pkg.org/pkg/FFTrees) --> |
15 | | - |
16 | | -<!-- [](https://github.com/ndphillips/FFTrees/actions/workflows/R-CMD-check.yaml) --> |
17 | | - |
18 | | -<!-- Devel badges end. --> |
19 | | - |
20 | | -<!-- Release badges start: --> |
21 | | - |
22 | 10 | [](https://CRAN.R-project.org/package=FFTrees) |
| 12 | +[](https://www.r-pkg.org/pkg/FFTrees) |
24 | 13 | [](https://www.r-pkg.org/pkg/FFTrees) |
| 15 | +[](https://github.com/ndphillips/FFTrees/actions/workflows/R-CMD-check.yaml) |
| 16 | +<!-- Devel badges end. --> |
| 17 | + |
| 18 | +<!-- Release badges start: --> |
| 19 | + |
| 20 | +<!-- [](https://CRAN.R-project.org/package=FFTrees) --> |
| 21 | + |
| 22 | +<!-- [](https://www.r-pkg.org/pkg/FFTrees) --> |
| 23 | + |
26 | 24 | <!-- Release badges end. --> |
27 | 25 |
|
28 | 26 | <!-- ALL badges start: --> |
@@ -109,8 +107,8 @@ library(FFTrees) # load package |
109 | 107 | A *fast-and-frugal tree* (FFT) provides answers to binary prediction |
110 | 108 | problems like: |
111 | 109 |
|
112 | | -- Which of 2 categories should I predict for each individual case in the |
113 | | - data? |
| 110 | +- Which of 2 categories should we predict for each individual case in |
| 111 | + the data? |
114 | 112 | - How successful is this prediction process for a sample of cases? |
115 | 113 |
|
116 | 114 | <!-- 1. Creating FFTs: --> |
@@ -364,6 +362,6 @@ for the full list). Examples include: |
364 | 362 |
|
365 | 363 | ------------------------------------------------------------------------ |
366 | 364 |
|
367 | | -\[File `README.Rmd` last updated on 2026-04-28.\] |
| 365 | +\[File `README.Rmd` last updated on 2026-05-02.\] |
368 | 366 |
|
369 | 367 | <!-- eof. --> |
0 commit comments