diff --git a/DESCRIPTION b/DESCRIPTION index fb7ce28c..c3857029 100644 --- a/DESCRIPTION +++ b/DESCRIPTION @@ -2,7 +2,7 @@ Package: FFTrees Type: Package Title: Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees Version: 2.0.0.9010 -Date: 2024-02-18 +Date: 2024-02-20 Authors@R: c(person("Nathaniel", "Phillips", role = c("aut"), email = "Nathaniel.D.Phillips.is@gmail.com", comment = c(ORCID = "0000-0002-8969-7013")), person("Hansjoerg", "Neth", role = c("aut", "cre"), email = "h.neth@uni.kn", comment = c(ORCID = "0000-0001-5427-3141")), person("Jan", "Woike", role = "aut", comment = c(ORCID = "0000-0002-6816-121X")), diff --git a/README.Rmd b/README.Rmd index ebf81a79..ed85ac20 100644 --- a/README.Rmd +++ b/README.Rmd @@ -27,13 +27,13 @@ url_JDM_html <- "https://journal.sjdm.org/17/17217/jdm17217.html" url_JDM_pdf <- "https://journal.sjdm.org/17/17217/jdm17217.pdf" url_JDM_doi <- "https://doi.org/10.1017/S1930297500006239" +doi_JDM <- "10.1017/S1930297500006239" ``` # FFTrees `r packageVersion("FFTrees")` FFTrees - [![CRAN status](https://www.r-pkg.org/badges/version/FFTrees)](https://CRAN.R-project.org/package=FFTrees) [![Downloads/month](https://cranlogs.r-pkg.org/badges/FFTrees?color='00a9e0')](https://www.r-pkg.org/pkg/FFTrees) @@ -41,7 +41,6 @@ url_JDM_doi <- "https://doi.org/10.1017/S1930297500006239" [![R-CMD-check](https://github.com/ndphillips/FFTrees/actions/workflows/R-CMD-check.yaml/badge.svg)](https://github.com/ndphillips/FFTrees/actions/workflows/R-CMD-check.yaml) - @@ -58,7 +57,7 @@ url_JDM_doi <- "https://doi.org/10.1017/S1930297500006239" -The R package **FFTrees** creates, visualizes and evaluates _fast-and-frugal decision trees_ (FFTs) for solving binary classification tasks, using the algorithms and methods described in Phillips, Neth, Woike & Gaissmaier (2017, doi\ [10.1017/S1930297500006239](`r url_JDM_doi`) | [html](`r url_JDM_html`) | [PDF](`r url_JDM_pdf`)). +The R package **FFTrees** creates, visualizes and evaluates _fast-and-frugal decision trees_ (FFTs) for solving binary classification tasks, using the algorithms and methods described in Phillips, Neth, Woike & Gaissmaier (2017, [`r doi_JDM`](`r url_JDM_doi`)). ## What are fast-and-frugal trees (FFTs)? @@ -263,7 +262,7 @@ As a comprehensive, yet accessible introduction to FFTs, we recommend our articl - Phillips, N. D., Neth, H., Woike, J. K. & Gaissmaier, W. (2017). FFTrees: A toolbox to create, visualize, and evaluate fast-and-frugal decision trees. _Judgment and Decision Making_, _12_ (4), 344–368. -doi\ [10.1017/S1930297500006239](`r url_JDM_doi`) +doi\ [`r doi_JDM`](`r url_JDM_doi`) We encourage you to read the article to learn more about the history of FFTs and how the **FFTrees** package creates, visualizes, and evaluates them. @@ -272,7 +271,7 @@ When using **FFTrees** in your own work, please cite us and share your experienc -By\ 2023, over 100\ scientific publications have used or cited **FFTrees** (see [Google Scholar](https://scholar.google.com/scholar?oi=bibs&hl=en&cites=205528310591558601) for the full list). +By\ 2024, over 120\ scientific publications have used or cited **FFTrees** (see [Google Scholar](https://scholar.google.com/scholar?oi=bibs&hl=en&cites=205528310591558601) for the full list). Examples include: - Lötsch, J., Haehner, A., & Hummel, T. (2020). Machine-learning-derived rules set excludes risk of Parkinson’s disease in patients with olfactory or gustatory symptoms with high accuracy. diff --git a/README.md b/README.md index c2ce013a..8e4d69d1 100644 --- a/README.md +++ b/README.md @@ -31,9 +31,7 @@ The R package **FFTrees** creates, visualizes and evaluates *fast-and-frugal decision trees* (FFTs) for solving binary classification tasks, using the algorithms and methods described in Phillips, Neth, Woike & Gaissmaier (2017, -doi [10.1017/S1930297500006239](https://doi.org/10.1017/S1930297500006239) -\| [html](https://journal.sjdm.org/17/17217/jdm17217.html) \| -[PDF](https://journal.sjdm.org/17/17217/jdm17217.pdf)). +[10.1017/S1930297500006239](https://doi.org/10.1017/S1930297500006239)). ## What are fast-and-frugal trees (FFTs)? @@ -302,11 +300,10 @@ continue developing the package. -By 2023, over 100 scientific publications have used or cited **FFTrees** +By 2024, over 120 scientific publications have used or cited **FFTrees** (see [Google Scholar](https://scholar.google.com/scholar?oi=bibs&hl=en&cites=205528310591558601) -for the full list). -Examples include: +for the full list). Examples include: - Lötsch, J., Haehner, A., & Hummel, T. (2020). Machine-learning-derived rules set excludes risk of Parkinson’s disease in patients with @@ -343,6 +340,6 @@ Examples include: ------------------------------------------------------------------------ -\[File `README.Rmd` last updated on 2024-02-19.\] +\[File `README.Rmd` last updated on 2024-02-20.\] diff --git a/inst/logo.png b/inst/logo.png index 8c2a918d..b82031af 100644 Binary files a/inst/logo.png and b/inst/logo.png differ