Is this good for educators?

Yes — this version of "Recommender System for an insurance risk" is framed for educators teaching it to a class. Drop a live demo into a lecture or assign it as a shareable link — no lab installs.

Do I need to install anything?

No. It runs in any modern browser, free, with no account required.

For Educators · Recommender System

Recommender System for an insurance risk

Built for educators teaching it to a class. Drop a live demo into a lecture or assign it as a shareable link — no lab installs. Simulate an insurance risk live below — adjust the inputs and watch it respond, right in your browser.

Pagerank

open full solver →

PageRankLive

the algorithm that built Google

Controls

Presets

Damping factor d

PageRank ranks nodes by importance: a page is important if important pages link to it. It is computed by imagining a random surfer who follows links with probability d and jumps randomly otherwise, then finding where they spend the most time. This eigenvector of the link matrix launched Google and now ranks everything from proteins to social influence.

▶ Run in Python

Data Inspector

Damping0.85

Top node23.6%

Methodpower iteration

Governing equation

P R (p) = \frac{1 - 0.85}{6} + 0.85 q \sum \frac{P R ( q )}{L ( q )}

Reading this result: PageRank is the stationary distribution of a random surfer who follows links with probability d and teleports to a random page with probability 1−d. At d=0.85 link structure dominates but teleport still keeps every node reachable.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

↓

Kmeans

open full solver →

k-Means ClusteringLive

Lloyd's algorithm · live

Controls

Speed1×

Presets

k (centroids)

True clusters

Lloyd's algorithm: assign each point to its nearest centroid, then move each centroid to the mean of its members. Repeat until stable. Try setting k different from the true cluster count.

▶ Run in Python

Data Inspector

Iteration0

Inertia0.00e+0

Governing equation

J = k = 1 \sum 4 x \in C_{k} \sum ∥ x - μ_{k} ∥^{2}, μ_{k} = \frac{1}{∣ C _{k} ∣} x \in C_{k} \sum x

Reading this result: k matches the 4 true clusters, so each centroid can settle onto one real group and inertia falls to a clean minimum.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

Also for:Students Researchers Engineers Hobbyists & Makers K-12 Students First Responders General version →

More with Recommender System

Recommender System for an A/B test Recommender System for a survey sample Recommender System for a poll margin Recommender System for a quality-control chart Recommender System for a clinical trial Recommender System for a customer churn Recommender System for a click-through rate Recommender System for an exam-score curve

Frequently asked questions

Is this good for educators?: Yes — this version of "Recommender System for an insurance risk" is framed for educators teaching it to a class. Drop a live demo into a lecture or assign it as a shareable link — no lab installs.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.