ID3 Classification using data.tree

This introduction provides a stylized example of the capabilities of the R package data.tree. The code for the implementation of the (already a bit outdated) ID3 algorithm was written in less than an hour. This is possible because, thanks to the data.tree package, the implementation of the training algorithm follows the algorithm’s pseudo code almost line by line.

Remember the RSeek!

Most people probably know this, but sometimes even I forget that there is the great Rseek.org. Purisitc as […]



F# made pipes popular among data scientists, and the magrittr package brought pipes to R. For example, […]


What is an R environment?

For many years as an R user, I didn’t care about environments. To run your statistics, you only […]

Ellipsis ... the gap is yours to fill

R … three dots ellipsis

If you have used R before, then you surely have come across the three dots, e.g. [crayon-5d2e3b6c75093199754411/] In […]

varchar and nvarchar

This is a bit off-topic. But today a had another case of an hour-long debugging session because of […]