# 3 Selecting Best Variables

## 3.1 General Aspects in Selecting Best Variables

### 3.1.1 What is this about?

This chapter covers the following topics:

- The best variables ranking from conventional machine learning algorithms, either predictive or clustering.
- The nature of selecting variables with and without predictive models.
- The effect of variables working in groups (intuition and information theory).
- Exploring the best variable subset in practice using R.

*Selecting the best variables is also known as feature selection, selecting the most important predictors, selecting the best predictors, among others.*

*Image: Is it a neural network? Nope. Dark matter, from the âThe Millennium Simulation Projectâ.*

### 3.1.2 Intuition

Selecting the best variables is like doing a summary of a story, we want to focus on those few details that best describe what weâre talking about. The balance threads between talking *too much* about unnecessary details (overfitting) and talking *too little* about the essence of the story (underfitting).

Another example can be the decision of buying a new laptop: *what are the features that we care about the most? Price, color and shipping method? Color and battery life? Or just price?*

From the **Information Theory** point of view -a key point in machine learning-, the data that we are working on has **entropy** (chaos). When we select variables, we are are reducing the entropy of our system by adding information.

### 3.1.3 The âbestâ selection?

The chapter says âbestâ, but weâd better mention a conceptual point, in general terms *there is no unique best variable selection.*

To start from this perspective is important, since in the exploration of many algorithms that *rank* the variables according to their predictive power, we can find different -and similar- results. That is:

- Algorithm 1 has chosen as the best variable
`var_1`

, followed by`var_5`

and`var_14`

. - Algorithm 2 did this ranking:
`var_1`

,`var_5`

and`var_3`

.

Letâs imagine, based on algorithm 1, the accuracy is 80%, while the accuracy based on algorithm 2 is 78%. Considering that every model has its inner variance, the result can be seen as the same.

This perspective can help us to reduce time in pursuing the perfect variable selection.

However going to the extremes, there will be a set of variables that will rank high across many algorithms, and the same goes for those with little predictive power. After several runs most reliable variables will emerge quickly, so:

**Conclusion**: If results are not good the focus should be on improving and checking the **data preparation** step. *The next section will exemplify it.*

#### 3.1.3.1 Going deeper into variable ranking

Itâs quite common to find in literature and algorithms, that covers this topic an univariate analysis, which is a ranking of variables given a particular metric.

Weâre going to create two models: random forest and gradient boosting machine (GBM) using `caret`

R package to cross-validate the data. Next, weâll compare the best variable ranking that every model returns.

```
library(caret)
library(funModeling)
library(dplyr)
# Excluding all NA rows from the data, in this
# case, NAs are not the main issue to solve, so
# we'll skip the 6 cases which have NA (or missing
# values).
heart_disease = na.omit(heart_disease)
# Setting a 4-fold cross-validation
fitControl = trainControl(method = "cv", number = 4,
classProbs = TRUE, summaryFunction = twoClassSummary)
# Creating the random forest model, finding the
# best tuning parameter set
set.seed(999)
fit_rf = train(x = select(heart_disease, -has_heart_disease,
-heart_disease_severity), y = heart_disease$has_heart_disease,
method = "rf", trControl = fitControl, verbose = FALSE,
metric = "ROC")
# Creating the gradient boosting machine model,
# finding the best tuning parameter set
fit_gbm = train(x = select(heart_disease, -has_heart_disease,
-heart_disease_severity), y = heart_disease$has_heart_disease,
method = "gbm", trControl = fitControl, verbose = FALSE,
metric = "ROC")
```

Now we can proceed with the comparison.

The columns `importance_rf`

and `importance_gbm`

represent the importance measured by each algorithm. Based on each metric, there are `rank_rf`

and `rank_gbm`

which represent the importance order, finally `rank_diff`

(`rank_rf`

- `rank_gbm`

) represents how different each algorithm rank the variables.

```
# Here we manipulate to show a
# nice the table described
# before
var_imp_rf = data.frame(varImp(fit_rf,
scale = T)["importance"]) %>%
dplyr::mutate(variable = rownames(.)) %>%
dplyr::rename(importance_rf = Overall) %>%
dplyr::arrange(-importance_rf) %>%
dplyr::mutate(rank_rf = seq(1:nrow(.)))
var_imp_gbm = as.data.frame(varImp(fit_gbm,
scale = T)["importance"]) %>%
dplyr::mutate(variable = rownames(.)) %>%
dplyr::rename(importance_gbm = Overall) %>%
dplyr::arrange(-importance_gbm) %>%
dplyr::mutate(rank_gbm = seq(1:nrow(.)))
final_res = merge(var_imp_rf, var_imp_gbm,
by = "variable")
final_res$rank_diff = final_res$rank_rf -
final_res$rank_gbm
# Printing the results!
final_res
```

We can see that there are variables which are not important at all to both models (`fasting_blood_sugar`

). There are others that maintain a position at the top of importance like `chest_pain`

and `thal`

.

Different predictive model implementations have their criteria to report what are the best features, according to that particular model. This ends up in different ranking across different algorithms. *More info about the inner importance metrics can be found at the caret documentation.*

Even more, in tree based models like GBM and Random Forest there is a random component to picking up variables, and the importance is based on prior -and automatic- variable selection when building the trees. The importance of each variable depends on the others, not only on its isolated contribution: **Variables work in groups**. Weâll back on this later on this chapter.

Although the ranking will vary from algorithm to algorithm, in general terms there is a correlation between all of these results as we mentioned before.

**Conclusion:** Every ranking list is not the *âfinal truthâ*, it gives us orientation about where the information is.

### 3.1.4 The nature of the selection

There are two main approaches when doing variable selection:

**Predictive model dependent**:

Like the ones we saw before, this is the most common. The model will rank variables according to one intrinsic measure of accuracy. In tree-based models, metrics such as information gain, Gini index, node impurity. More info at (stackoverflow.com 2017) and (stats.stackexchange.com 2017a).

**Not predictive model dependent**:

This is interesting since they are not as popular as the other ones, but they are proved to perform really well in areas related to genomic data. They need to find those *relevant* genes (input variable) that are correlated with some disease, like cancer (target variable).

Data from this area is characterized by having a huge number of variables (in the order of thousands), which is much bigger than problems in other areas.

One algorithm to perform this is mRMR, acronym for Minimum Redundancy Maximum Relevance Feature Selection. It has its own implementation in R in mRMRe package.

### 3.1.5 Improving variables

Variables can increase their predictive power by treating them.

This book covers by now:

- Improvement of categorical variables.
- Reducing the noise in numerical variables through binning in the chapter: Discretizing numerical variables.
- How to deal with outliers in R.
- Missing Data: Analysis, Handling, and Imputation of

*And more to comeâŠ*

### 3.1.6 Cleaning by domain knowledge

Itâs not related to algorithmic procedures, but to the area from which the data comes.

Imagine data coming from a survey. This survey has one year of history, and during the first three months there was no good process control. When inserting data users could type whatever they wanted. Variables during this period will probably be spurious.

Itâs easy to recognize it when during a given period of time, the variable comes empty, null or with extreme values.

We should then ask a question:

*Is this data reliable?* Keep in mind the predictive model will learn *as a kid*, it will not judge the data, just learn from it. If data is spurious in a given period of time, then we may remove these input cases.

To go further on this point, we should do a deeper exploratory data analysis. Both numerically and graphically.

### 3.1.7 Variables work in groups

When selecting the *best* variables, the main aim is to get those variables which carry the most information regarding a target, outcome or dependent variable.

A predictive model will find its weights or parameters based on its 1 to âNâ input variables.

Variables usually donât work isolated when explaining an event. Quoting Aristotle:

âThe whole is greater than the sum of its parts.â

This is also true when selecting the *best* features:

*Building a predictive model with two variables may reach a higher accuracy than the models built with only one variable.*

For example: Building a model based on variable `var_1`

could lead to an overall accuracy of 60%. On the other hand, building a model based on `var_2`

could reach an accuracy of 72%. But when we combine these two `var_1`

and `var_2`

variables, we could achieve an accuracy above 80%.

#### 3.1.7.1 Example in R: Variables working in groups

The following code illustrates what Aristotle said *some* years ago.

It creates 3 models based on different variable subsets:

- model 1 is based on
`max_heart_rate`

input variable - model 2 is based on
`chest_pain`

input variable - model 3 is based on
`max_heart_rate`

**and**`chest_pain`

input variables

Each model returns the metric ROC, and the result contains the improvement of considering the two variables at the same time vs.Â taking each variable isolated.

```
library(caret)
library(funModeling)
library(dplyr)
# setting cross-validation 4-fold
fitControl = trainControl(method = "cv",
number = 4, classProbs = TRUE, summaryFunction = twoClassSummary)
create_model <- function(input_variables) {
# create gradient boosting machine model
# based on input variables
fit_model = train(x = select(heart_disease,
one_of(input_variables)), y = heart_disease$has_heart_disease,
method = "gbm", trControl = fitControl,
verbose = FALSE, metric = "ROC")
# returning the ROC as the performance
# metric
max_roc_value = max(fit_model$results$ROC)
return(max_roc_value)
}
roc_1 = create_model("max_heart_rate")
roc_2 = create_model("chest_pain")
roc_3 = create_model(c("max_heart_rate",
"chest_pain"))
avg_improvement = round(100 * (((roc_3 -
roc_1)/roc_1) + ((roc_3 - roc_2)/roc_2))/2,
2)
avg_improvement_text = sprintf("Average improvement: %s%%",
avg_improvement)
results = sprintf("ROC model based on 'max_heart_rate': %s.;
based on 'chest_pain': %s;
and based on both: %s",
round(roc_1, 2), round(roc_2, 2), round(roc_3,
2))
# printing the results!
cat(c(results, avg_improvement_text), sep = "\n\n")
```

```
## ROC model based on 'max_heart_rate': 0.73.;
## based on 'chest_pain': 0.74;
## and based on both: 0.82
##
## Average improvement: 10.56%
```

#### 3.1.7.2 Tiny example (based on Information Theory)

Consider the following *big data* table đ 4 rows, 2 input variables (`var_1`

, `var_2`

) and one outcome (`target`

):

If we build a predictive model based on `var_1`

only, what it will *see*?, the value `a`

is correlated with output `blue`

and `red`

in the same proportion (50%):

- If
`var_1='a'`

then likelihood of target=âredâ is 50% (row 1) - If
`var_1='b'`

then likelihood of target=âblueâ is 50% (row 2)

*Same analysis goes for var_2*

When the same input is related to different outcomes itâs defined as **noise**. The intuition is the same as one person telling us: *âHey itâs going to rain tomorrow!â*, and another one saying: *âFor sure tomorrow itâs not going to rainâ*. Weâd thinkâŠ *âOMG! do I need the umbrella or not đ±?â*

Going back to the example, taking the two variables at the same time, the correspondence between the input and the output in unique: âIf `var_1='a'`

and `var_2='x'`

then the likelihood of being `target='red'`

is 100%â. You can try other combinations.

**Summing-up:**

That was an example of **variables working in groups**, considering `var_1`

and `var_2`

at the same time increases the predictive power.

Nonetheless, itâs a deeper topic to cover, considering the last analysis; how about taking an `Id`

column (every value is unique) to predict something? The correspondence between input-output will also be uniqueâŠ but is it a useful model? Thereâll be more to come about information theory in this book.

#### 3.1.7.3 Conclusions

- The proposed R example based on
`heart_disease`

data shows an average**improvement of 9%**when considering two variables at a time, not too bad. This percentage of improvement is the result of the variables working in groups. - This effect appears if the variables contain information, such is the case of
`max_heart_rate`

and`chest_pain`

(or`var_1`

and`var_2`

). - Putting
**noisy variables**next to good variables**will usually affect**overall performance. - Also the
**work in groups**effect is higher if the input variables**are not correlated between**them. This is difficult to optimize in practice. More on this on the next sectionâŠ

### 3.1.8 Correlation between input variables

The ideal scenario is to build a predictive model with only variables not correlated between them. In practice, itâs complicated to keep such a scenario for all variables.

Usually there will be a set of variables that are not correlated between them, but also there will be others that have at least some correlation.

**In practice** a suitable solution would be to exclude those variables with a **remarkably high-level** of correlation.

Regarding how to measure correlation. Results can be highly different based on linear or non-linear procedures. More info at the Correlation

*What is the problem with adding correlated variables?*

The problem is that weâre adding complexity to the model: itâs usually more time-consuming, harder to understand, less explainable, less accurate, etc. This is an effect we reviewed in Donât predictive models handle high cardinality?.The general rule would be: Try to add the top N variables that are correlated with the output but not correlated between them. This leads us to the next section.

### 3.1.9 Keep it simple

Nature operates in the shortest way possible. -Aristotle.

The principle of **Occamâs razor**: Among competing hypotheses, the one with the fewest assumptions should be selected.

Re-interpreting this sentence for machine learning, those âhypothesesâ can be seen as variables, so weâve got:

**Among different predictive models, the one with fewest variables should be selected.** (Wikipedia 2017c)

Of course, there is also the trade-off of adding-substracting variables and the accuracy of the model.

A predictive model with a *high* number of variables will tend to do **overfitting**. While on the other hand, a model with a *low* number of variables will lead to doing **underfitting**.

The concept of *high* and *low* is **highly subjective** to the data that is being analyzed. In practice, we may have some accuracy metric, for example, the ROC value. i.e.Â we would see something like:

The last picture shows the ROC accuracy metric given different subsets of variables (5, 10, 20, 30 and 58). Each dot represents the ROC value given a certain number of variables used to build the model.

We We can check that the highest ROC appears when the model is built with 30 variables. If we based the selection only on an automated process, we might be choosing a subset which tends to overfit the data. This report was produced by library `caret`

in R ((Kuhn 2017) but is analogous to any software.

Take a closer look at the difference between the subset of 20 and the 30; there is only an improvement of **1.8%** -from 0.9324 to 0.95- choosing **10 more variables.** In other words: *Choosing 50% more variables will impact in less than 2% of improvement.*

Even more, this 2% may be an error margin given the variance in the prediction that every predictive model has, as we seen in Knowing the error chapter. Conclusion:**

In this case, and being consequent with Occamâs Razor principle, the best solution is to build the model with the subset of 20 variables.

Explaining to others -and understanding- a model with 20 variables is easier than the similar one with 30.

### 3.1.10 Variable selection in Clustering?

This concept usually appears only in predictive modeling, i.e.Â having some variables to predict a target one. In clustering there is no target variable, we let the data speak, and the natural segments arise according to some distance metric.

However, **not every variable contributes in the same way to the dissimilarity in the cluster model**. Keeping it brief, if we have 3 clusters as output, and we measure the average of each variable, we expect to have these averages *quite* dissimilar between them, right?

Having built 2 cluster models, in the first one the averages of the `age`

variable is 24, 33 and 26 years; while on the second one we have: 23, 31 and 46. In the second model the variable `age`

is having more variability, thus it is more relevant to the model.

This was just an example considering two models, but itâs the same considering just one. Those variables with **more distance** across averages will tend to **define better** the cluster than the others.

Unlike predictive modeling, in clustering *less important* variables shouldnât be removed, those variables arenât important in that particular model, but they could be if we build another one with other parameters. The cluster modelsâ quality is highly subjective.

Finally, we could run, for example, a random forest model with the cluster as a target variable and in this way quickly collect the most important variables.

### 3.1.11 Selecting the best variables in practice

#### 3.1.11.1 The short answer

Pick up the top *N* variables from the algorithm youâre using and then re-build the model with this subset. Not every predictive model retrieves variable rankings, but if it does, use the same model (for example gradient boosting machine) to get the ranking and to build the final model.

For those models like k-nearest neighbors which donât have a built-in select best features procedure, itâs valid to use the selection of another algorithm. It will lead to better results than using all the variables.

#### 3.1.11.2 The long answer

- When possible,
**validate**the list with someone who knows about the context, the business or the data source. Either for the top*N*or the bottom*M*variables. As regards those*bad*variables, we may be missing something in the data munging that could be destroying their predictive power. - Understand each variable, its meaning in context (business, medical, other).
- Do
**exploratory data analysis**to see the distributions of the most important variables regarding a target variable,*does the selection make sense?*If the target is binary then the function Profiling target using cross_plot can be used. - Does the average of any variable
*significantly*change over time? Check for abrupt changes in distributions. - Suspect about high cardinality top-ranked variables (like postal code, letâs say above +100 categories). More information at <a High Cardinality Variable in Predictive ModelingWhen making the selection -as well as a predictive modeling-, try and use methods which contain some mechanism of re-sampling (like bootstrapping), and cross-validation. More information in Refowing the error](#knowing_the_error) chapter Try other methods to find
**groups of variables**, like the one mentioned before: mRMR. - If the selection doesnât meet the needs, try creating new variables, you can check the
**data preparation**chapter. Coming soon: Feature engineering chapter.

#### 3.1.11.3 Generate your own knowledge

Itâs difficult to generalize when the nature of the data is so different, from **genetics** in which there are thousands of variables and a few rows, to web-navigation when new data is coming all the time.

The same applies to the objective of the analysis. Is it to be used in a competition where precision is highly necessary? Perhaps the solution may include more varcorrelated iables thn comparison to with ad-hoc study in which the primary goal is a simple explanation.

There is no one-size-fits-all answer to face all possible challenges; youâll find powerful insights using your experience. Itâs just a matter of practice.

## 3.2 Target profiling with `cross_plot`

(dataViz)

### 3.2.1 What is this about?

This plot intent to show in real scenarios if a variable is or not important, making a visual summary of it, *(by grouping numerical variables into bins/groups)*.

### 3.2.3 How to extract conclusions from the plots? (Long version)

**From 1st plot (%):**

- The
**likelihood**of having heart disease for males is 55.3%, while for females is: 25.8%. - The heart disease rate for males
**doubles**the rate for females (55.3 vs.Â 25.8, respectively).

**From 2nd plot (count):**

- There is a total of
**97 females**:- 25 of them have heart disease (25/97=25.8%, which is the ratio of the 1st plot).
- the remaining 72 have not heart disease (74.2%)

- There is a total of
**206 males**:- 114 of them have heart disease (55.3%)
- the remaining 92 have not heart disease (44.7%)

- Total cases: Summing the values of four bars: 25+72+114+92=
**303**.

*Note: What would it happened if instead of having the rates of 25.8% vs.Â 55.3% (female vs.Â male), they had been more similar like 30.2% vs.Â 30.6%). In this case variable gender it would have been much less relevant, since it doesnât separate the has_heart_disease event.*

### 3.2.4 Example 2: Crossing with numerical variables

Numerical variables should be **binned** to plot them with a histogram, otherwise, the plot is not showing information, as it can be seen here:

#### 3.2.4.1 Equal frequency binning

There is a function included in the package (inherited from Hmisc package): `equal_freq`

, which returns the bins/buckets based on the **equal frequency criteria**. Which is *-or tries to-* have the same quantity of rows per bin.

For numerical variables, `cross_plot`

has by default the `auto_binning=T`

, which automatically calls the `equal_freq`

function with `n_bins=10`

(or the closest number).

```
cross_plot(heart_disease, str_input = "max_heart_rate",
str_target = "has_heart_disease")
```

### 3.2.5 Example 3: Manual binning

If you donât want the automatic binning, then set the `auto_binning=F`

in `cross_plot`

function.

For example, creating `oldpeak_2`

based on equal frequency, with three buckets.

```
heart_disease$oldpeak_2 = equal_freq(var = heart_disease$oldpeak,
n_bins = 3)
summary(heart_disease$oldpeak_2)
```

```
## [0.0,0.2) [0.2,1.5) [1.5,6.2]
## 106 107 90
```

Plotting the binned variable (`auto_binning = F`

):

```
cross_oldpeak_2 = cross_plot(heart_disease, str_input = "oldpeak_2",
str_target = "has_heart_disease", auto_binning = F)
```

#### 3.2.5.1 **Conclusion**

This new plot based on `oldpeak_2`

shows clearly how: the likelihood of **having heart disease increases** as **oldpeak_2 increases** as well. *Again, it gives an order to the data.*

### 3.2.6 Example 4: Noise reducing

Converting variable `max_heart_rate`

into a one of 10 bins:

```
heart_disease$max_heart_rate_2 = equal_freq(var = heart_disease$max_heart_rate,
n_bins = 10)
cross_plot(heart_disease, str_input = "max_heart_rate_2",
str_target = "has_heart_disease")
```

At first glance, `max_heart_rate_2`

shows a negative and linear relationship. However, there are some buckets which add noise to the relationship. For example, the bucket `(141, 146]`

has a higher heart disease rate than the previous bucket, and it was expected to have a lower. *This could be noise in data.*

**Key note**: One way to reduce the **noise** (at the cost of **losing** some information), is to split with less bins:

```
heart_disease$max_heart_rate_3 = equal_freq(var = heart_disease$max_heart_rate,
n_bins = 5)
cross_plot(heart_disease, str_input = "max_heart_rate_3",
str_target = "has_heart_disease")
```

**Conclusion**: As it can be seen, now the relationship is much clean and clear. Bucket *âNâ* has a higher rate than *âN+1â*, which implies a negative correlation.

**How about saving the cross_plot result into a folder?**

Just set the parameter `path_out`

with the folder you want -It creates a new one if it doesnât exists-.

```
cross_plot(heart_disease, str_input = "max_heart_rate_3",
str_target = "has_heart_disease", path_out = "my_plots")
```

It creates the folder `my_plots`

into the working directory.

### 3.2.7 Example 5: `cross_plot`

on multiple variables

Imagine you want to run cross_plot for several variables at the same time. To achieve this goal just define a vector containing the variable names.

If you want to analyze these 3 variables:

`vars_to_analyze = c("age", "oldpeak", "max_heart_rate")`

```
cross_plot(data = heart_disease, str_target = "has_heart_disease",
str_input = vars_to_analyze)
```

### 3.2.8 Exporting plots

`plotar`

and `cross_plot`

can handle from 1 to N input variables, and plots generated by them can be easily exported in high quality with parameter `path_out`

.

```
plotar(data = heart_disease, str = c("max_heart_rate",
"resting_blood_pressure"), str_target = "has_heart_disease",
plot_type = "boxplot", path_out = "my_awsome_folder")
```

## 3.3 Target profiling using BoxPlots

### 3.3.1 What is this about?

The use of Boxplots in importance variable analysis gives a quick view of how different the quartiles are among the various values in a binary target variable.

```
# Loading funModeling !
library(funModeling)
data(heart_disease)
```

```
plotar(data = heart_disease, str_input = "age",
str_target = "has_heart_disease", plot_type = "boxplot")
```

*Rhomboid near the mean line represents the median.*

*When to use boxplots?* When yoweeed to analyze different percentiles across the classes to predict. Note this is a powerful technique since the bias produced due to outliers doesnât affect as much as it does to the mean.

### 3.3.2 Boxplot: Good vs.Â Bad variable

Using more than one variable as inputs is useful in order to compare boxplots quickly, and thus getting the best variablesâŠ

```
plotar(data = heart_disease, str_input = c("max_heart_rate",
"resting_blood_pressure"), str_target = "has_heart_disease",
plot_type = "boxplot")
```

`max_heart_rate`

is clearly a better predictor than `resting_blood_pressure`

.

As a general rule, a variable will rank as **more important** if boxplots are **not aligned** horizontally.

*Statistical tests: percentiles are another used feature used by them in order to determine -for example- if means across groups are or not the same.*

### 3.3.3 Exporting plots

`plotar`

and `cross_plot`

can handle from 1 to N input variables, and plots generated by them can be easily exported in high quality with parameter `path_out`

.

```
plotar(data = heart_disease, str_input = c("max_heart_rate",
"resting_blood_pressure"), str_target = "has_heart_disease",
plot_type = "boxplot", path_out = "my_awsome_folder")
```

**Key in mind this when using Histograms and BoxPlots**They are nice to see when the variable:- Has a good spread -not concentrated on a bunch of
*3, 4..6..*different values,**and** - It has not extreme outliersâŠ
*(this point can be treated with*`prep_outliers`

function present in this package)

- Has a good spread -not concentrated on a bunch of

## 3.4 Target profiling using Density Histograms

### 3.4.1 What is this about?

Density histograms are quite standard in any book/resource when plotting distributions. To use them in selecting variables gives a quick view on how well certain variable separates the class.

```
plotar(data = heart_disease, str_input = "age", str_target = "has_heart_disease",
plot_type = "histdens")
```

*Note: The dashed-line represents variable mean.*

**Density histograms** are helpful to visualize the general shape of a numeric distribution.

This *general shape* is calculated based on a technique called **Kernel Smoother**, its general idea is to reduce high/low peaks (noise) present in near points/bars by estimating the function that describes the points. Here some pictures to illustrate the concept: https://en.wikipedia.org/wiki/Kernel_smoother

### 3.4.2 What is the relationship with a statistical test?

Something similar is what a **statistical test** sees: they measured **how different** the curves are reflecting it in some statistics like the p-value using in the frequentist approach. It gives to the analyst reliable information to determine if the curves have -for example- the same mean.

### 3.4.3 Good vs.Â bad variable

```
plotar(data = heart_disease, str = c("resting_blood_pressure",
"max_heart_rate"), str_target = "has_heart_disease",
plot_type = "histdens")
```

And the model will see the sameâŠ if the curves are quite overlapped, like it is in `resting_blood_pressure`

, then itâs **not a good predictor** as if they were **more spaced** -like `max_heart_rate`

.

**Key in mind this when using Histograms & BoxPlots**They are nice to see when the variable:- Has a good spread -not concentrated on a bunch of
*3, 4..6..*different values,**and** - It has not extreme outliersâŠ
*(this point can be treated with*`prep_outliers`

function present in this package)

- Has a good spread -not concentrated on a bunch of

### References

stackoverflow.com. 2017. âWhat Is Entropy and Information Gain?â http://stackoverflow.com/questions/1859554/what-is-entropy-and-information-gain.

stats.stackexchange.com. 2015. âGradient Boosting Machine Vs Random Forest.â https://stats.stackexchange.com/questions/173390/gradient-boosting-tree-vs-random-forest.

2017a. âHow to Interpret Mean Decrease in Accuracy and Mean Decrease Gini in Random Forest Models.â http://stats.stackexchange.com/questions/197827/how-to-interpret-mean-decrease-in-accuracy-and-mean-decrease-gini-in-random-fore.Wikipedia. 2017c. âOccamâs Razor.â https://en.wikipedia.org/wiki/Occam's_razor#Probability_theory_and_statistics.

Kuhn, Max. 2017. âRecursive Feature Elimination in R Package Caret.â https://topepo.github.io/caret/recursive-feature-elimination.html.