**R snippets**, and kindly contributed to R-bloggers)

Some time ago I read a nice post Solving easy problems the hard way where linear regression is used to solve an interesting puzzle. Following the idea I used rpart to find optimal decision tree sorting five elements.

It is well known that in order to sort five elements it is enough to use seven comparisons. Interestingly it is possible to adjust rpart function to find the optimal decision tree.

To see this first let us start with generating the appropriate training data using the following code:

**(**gtools

**)**

**<-**permutations

**(**5,5

**)**

**<-**combinations

**(**5,2

**)**

**<-**data.frame

**(**perm5c

**=**apply

**(**perm5, 1,

**=**“”

**))**

**for**

**(**k

**in**1

**:**nrow

**(**comb5

**))**

**{**

**<-**comb5

**[**k, 1

**]**

**<-**comb5

**[**k, 2

**]**

**<-**factor

**(**apply

**(**perm5, 1,

**function**

**(**v

**)**

**{**

**(**i

**==**v

**)**

**<**which

**(**j

**==**v

**)**

**}))**

**[**, paste

**(**“v”, i, j, sep

**=**“”

**)]**

**<-**val

**}**

We get a data set with 120 rows. Each row contains a column perm5c representing one permutation of the set from 1 to 5 and 10 columns representing pairwise comparison results between variables. We want to find a decision tree that partitions this data set into one-element leaves with seven decisions in the worst case.

Simply applying rpart in the following way:

**<-**rpart

**(**perm5c

**~**., data

**=**data.set,

**=**rpart.control

**(**minsplit

**=**1, cp

**=**0

**)**

**)**

**(**tree.model

**)**

unfortunately generates a tree where ten decisions are neeeded in the worst case.

The trick to solve this problem is that you can supply rpart with your own split evaluation function. In this case the appropriate splitting rule should favour balanced splits (so for example 30-30 split is better than 40-20). Here is the code that does the work:

**(**rpart

**)**

**<-**

**function**

**(**y, wt, parms

**)**

**{**

**<-**ifelse

**(**length

**(**y

**)**

**==**1,

**(**paste

**(**perm5

**[**y,

**]**, collapse

**=**“”

**))**,

**NaN**

**)**

**(**label

**=**lab, deviance

**=**length

**(**y

**)**

**–**1

**)**

**}**

**<-**

**function**

**(**y, wt, x, parms, continuous

**)**

**{**

**(**goodness

**=**nrow

**(**perm5

**)^**2

**–**sum

**(**table

**(**x

**)^**2

**)**,

**=**unique

**(**x

**))**

**}**

**<-**

**function**

**(**y, offset, parms, wt

**)**

**{**

**(**y

**=**y, parms

**=**0, numresp

**=**1, numy

**=**1,

**=**

**function(**yval, dev, wt, ylevel, digits

**)**

**{**

**})**

**}**

**<-**rpart

**(**perm5c

**~**., data

**=**data.set,

**=**rpart.control

**(**minsplit

**=**1, cp

**=**0

**)**,

**=**list

**(**eval

**=**temp1, split

**=**temp2, init

**=**temp3

**))**

**(**tree.model

**)**

If you look at the output after printing tree.model you can see which paths lead to which classifications.

As you can see on the figure below at most seven comparisons are needed:

Additionally it is easy to modify the code to produce optimal trees for other numbers of elements to be sorted.

**leave a comment**for the author, please follow the link and comment on their blog:

**R snippets**.

R-bloggers.com offers

**daily e-mail updates**about R news and tutorials on topics such as: Data science, Big Data, R jobs, visualization (ggplot2, Boxplots, maps, animation), programming (RStudio, Sweave, LaTeX, SQL, Eclipse, git, hadoop, Web Scraping) statistics (regression, PCA, time series, trading) and more...