This is an upcoming presentation deck on July 12, 2021.

Data Science 2021 R-project

Stack Overflow tree using Rpart.plot

if the notch is TRUE, a notch is drawn on each side of the boxes. If the notches of two plots do not overlap this is ‘strong evidence’ that the two medians differ

minsplit = 20, minbucket=2

with minsplit=20, minbucket=1

DBSCAN technique

By DBSCAN & OPTICS with radius 5

Silhouette score to find the optimal value for the number of clusters k.

Performance of pupil groups at two intermediate examinations. Clustering: k-means Distance metric: Euclidean Clusters: 8

Made in Rmarkdown. (Packages: Knitr, packrat, rsconnect, pagedown)