Search Results for "egm2008-1"

The cheatsheets repository from RStudio is a curated collection of official cheat sheets for R, RStudio, the tidyverse, Shiny, and related data science tools. Each cheat sheet is a single (or double) page PDF that condenses important syntax, functions, workflows, and best practices into a visually organized format ideal for quick reference. The repository contains source files (R Markdown or LaTeX) that generate the cheat sheets, version history, and metadata (title, author, description) for...

...Its goal is to estimate the effect of an intervention (e.g. a marketing campaign, policy change) on a time series outcome by predicting what would have happened in a counterfactual “no intervention” world. The package requires as input a response time series plus one or more control (covariate) time series that are assumed unaffected by the intervention, and it divides the time horizon into “pre-intervention” and “post-intervention” periods. It uses Bayesian modeling to fit a structural time series to the pre-period and extrapolate a counterfactual prediction for the post period, then compares observed vs predicted to infer the causal effect. ...

“R for Data Science” (r4ds) is the source material (book + examples) by Hadley Wickham et al., intended to teach data science using R and the tidyverse. It covers the workflow from importing data, tidying, transforming, visualizing, modelling, communicating results, and programming in R. The repository contains the source files (Quarto / RMarkdown), example datasets, visualizations, exercises, and all content needed to build the book. Includes many example datasets, diagrams, code samples,...

This repository is designed to provide a minimal benchmark framework comparing commonly used machine learning libraries in terms of scalability, speed, and classification accuracy. The focus is on binary classification tasks without missing data, where inputs can be numeric or categorical (after one-hot encoding). It targets large scale settings by varying the number of observations (n) up to millions and the number of features (after expansion) to about a thousand, to stress test different implementations. The benchmarks cover algorithms like logistic regression, random forest, gradient boosting, and deep neural networks, and they compare across toolkits such as scikit-learn, R packages, xgboost, H2O, Spark MLlib, etc. ...

...It builds on a worked example that caches the mean of a numeric vector, demonstrating how the operator preserves state across function calls. You then implement analogous logic for matrices via two functions, one to construct the cache-aware object and another to compute or retrieve the cached inverse. The instructions emphasize using solve for inversion and assuming that the supplied matrix is always invertible. The repository outlines the workflow for forking, editing the provided R stub, committing your solution, and submitting your repository URL as the final deliverable.