Function for Calculating the Achievable Benchmark of Care aspirational target; which is based on an adjusted performance fraction. The Achievable Benchmark of Care Approach estimates the benchmark based on the top performing records (e.g. clinicians, hospitals) that account for 10% of patients in the data.

100%

Function for Calculating the Achievable Benchmark of Care aspirational target; which is based on an adjusted performance fraction. The Achievable Benchmark of Care Approach estimates the benchmark based on the top performing records (e.g. clinicians, hospitals) that account for 10% of patients in the data.

✓ Published0🌍 Public

Last edited Aug 26, 2019

Created on Aug 19, 2019

This example demonstrates how a dplyr workflow can compute the Achievable Benchmark of Care (ABC), an aspirational quality target derived from the top-performing clinicians or hospitals that together cover at least 10% of patients. The ABCBenchmark function uses an adjusted performance fraction to rank records, then calculates cumulative totals and applies a minimum-contribution filter to select the benchmark group. It supports optional grouping by site or region and returns the benchmark as a new column. The code relies on the dplyr and rlang packages for tidy evaluation and piping.

AI-generated description

Similar vizzes

Loading thumbnail…

Comparing the performances of various DBMS using dplyr for large-ish data

This example compares the execution times of data manipulation operations across different database management systems using the `dplyr` and `dbplyr` R packages. It benchmarks a `group_by` with `summarise` and a `left_join` with `mutate` on a 50-million-row tibble, running the same queries against in-memory data frames, SQLite databases (in-memory and file-based), and PostgreSQL. The code uses `system.time` to measure the elapsed user and system times for each operation, recording results in a benchmark summary table. The visualization highlights performance differences across database backends for typical data wrangling tasks.

RRCura

49% match

Loading thumbnail…

Aider Benchmarks Scatter Plot

This interactive scatter plot visualizes Aider’s LLM leaderboard benchmarks, comparing models’ percent correct on coding exercises against their cost per run on a logarithmic x-axis. Built with React and D3 v7, it uses `scaleSymlog` for cost, `d3.forceSimulation` for label placement, and hover/click interactions to highlight selected models. Data comes from a TSV file with costs parsed from dollar strings.

CCurran Kelleher

46% match

Loading thumbnail…

Fork of Transforming Data

This example demonstrates the process of transforming a Healthy People 2020 dataset through binned aggregation and summary statistics, showing computed averages of final year estimates grouped by population group. The visualization begins by fetching a CSV file via a GitHub gist URL, then uses d3.csvParse to load the data. It employs d3.flatRollup, d3.sum, and d3.bin to calculate aggregated values and create binned distributions across numeric fields. The output displays the raw parsed data as JSON text using d3.select and .join.

KKhatera Alizada

46% match

Loading thumbnail…

Function for assigning a date to a bi-annual period: Useful when needing to group dates into a period for time-series visualisation

This visualization example demonstrates a utility function for converting individual dates into bi-annual period groupings, a preprocessing step for time-series analysis. The function uses `lubridate`'s `dmy`, `year`, and `floor_date` functions to compare each input date against two fixed cutpoints (June 30th and December 31st), then returns the first day of the month for the appropriate six-month period. Dates falling after the second cutpoint are assigned to the following year’s first period, ensuring all data maps to a two-category annual cycle. The code explicitly handles year boundaries through conditional `ifelse` logic.

JJustinCally

46% match

Loading thumbnail…

tut8

This example shows a machine-learning workflow for predicting Brexit referendum outcomes, comparing predicted versus actual Leave votes in a test dataset. It uses R to fit a final classification model, then applies the `predict` function to generate class predictions on held-out test data. The visualization or summary aspect centers on computing `base_accuracy`, the mean agreement between predicted and observed `Percent.Leave` values. The code relies on base R modeling and prediction APIs, with no plotting libraries, instead focusing on quantitative accuracy assessment rather than graphical output.

BBenHeubl

44% match

Loading thumbnail…

Gist 0e59d1c2d63aaea35573

This example demonstrates benchmark-driven optimization of recursion schemes in Haskell, using the Criterion library’s `defaultMain`, `bgroup`, and `bench` functions to measure performance. The code defines catamorphisms (`ffold`), anamorphisms (`funfold`), hylomorphisms, and build functions (`fbuild`, `funbuild`), then applies them to natural numbers, lists, and trees. It highlights how `INLINE` pragmas and `RULES` for fusion (e.g., `ffold/fbuild`) improve execution speed, as shown in benchmarks like `lengthL`, `mapL`, and `depthT` over sample data structures.

FFranklin Chen

44% match

Loading thumbnail…

tut17

This example builds a classification-ready dataset from income survey data, showing how raw income brackets are recoded into binary “Under 30k” versus “Over 30k” categories. It then splits the cleaned data into training and test sets using base R’s `sample` function. The code uses `dplyr`’s `mutate`, `if_else`, and `mutate_if` for transformations, along with `forcats::fct_explicit_na` to label missing factors as “Unknown.” The data is sourced from a remote CSV via `read.csv` and processed entirely in R, with no visualization rendering or plotting involved.

BBenHeubl

44% match

Loading thumbnail…

Tut3

This visualization demonstrates a machine-learning workflow for splitting a Brexit-related dataset into training and testing subsets. It shows how 70 percent of the data is randomly sampled for model training, with the remaining 30 percent held out for validation. The code uses base R’s `sample()` function and `nrow()` to compute indices, then applies bracket indexing to partition the data frame. The example highlights a common data-preparation step, with the split proportion clearly visible in the sampling logic. No plotting or rendering libraries are used; the focus is purely on the data-splitting mechanism.

BBenHeubl

44% match