# compknn.tune: Tuning of the he k-NN algorithm for compositional data In Compositional: Compositional Data Analysis

## Description

Tuning of the k-NN algorithm for compositional data with and without using the power or the α-transformation. In addition, estimation of the rate of correct classification via M-fold cross-validation.

## Usage

 1 2 3 4 5 compknn.tune(x, ina, M = 10, A = 5, type= "S", mesos = TRUE, a = seq(-1, 1, by = 0.1), apostasi = "ESOV", mat = NULL, graph = FALSE) alfaknn.tune(x, ina, M = 10, A = 5, type = "S", mesos = TRUE, a = seq(-1, 1, by = 0.1), apostasi = "euclidean", mat = NULL, graph = FALSE)

## Arguments

 x A matrix with the available compositional data. Zeros are allowed, but you must be carefull to choose strictly positive vcalues of α or not to set apostasi= "Ait". ina A group indicator variable for the avaiable data. M The number of folds to be used. This is taken into consideration only if the matrix "mat" is not supplied. A The maximum number of nearest neighbours to consider. Note that the 1 neasrest neighbour is not used. type This can be either "S" for the standard k-NN or "NS" for the non standard (see details). mesos This is used in the non standard algorithm. If TRUE, the arithmetic mean of the distances is calulated, otherwise the harmonic mean is used (see details). a A grid of values of α to be used only if the distance chosen allows for it. apostasi The type of distance to use. For the compk.knn this can be one of the following: "ESOV", "taxicab", "Ait", "Hellinger", "angular" or "CS". See the references for them. For the alfa.knn this can be either "euclidean" or "manhattan". mat You can specify your own folds by giving a mat, where each column is a fold. Each column contains indices of the observations. You can also leave it NULL and it will create folds. graph If set to TRUE a graph with the results will appear.

## Details

The k-NN algorithm is applied for the compositional data. There are many metrics and possibilities to choose from. The standard algorithm finds the k nearest observations to a new observation and allocates it to the class which appears most times in the neighbours. The non standard algorithm is slower but perhaps more accurate. For every group is finds the k nearest neighbours to the new observation. It then computes the arithmetic or the harmonic mean of the distances. The new point is allocated to the class with the minimum distance.

## Value

A list including:

 ela A matrix or a vector (depending on the distance chosen) with the averaged over all folds rates of correct classification for all hyper-parameters (α and k). performance The estimated rate of correct classification. best_a The best value of α. This is returned for "ESOV" and "taxicab" only. best_k The best number of nearest neighbours. runtime The run time of the cross-validation procedure.

## Author(s)

Michail Tsagris

R implementation and documentation: Michail Tsagris <[email protected]> and Giorgos Athineou <[email protected]>

## References

Tsagris, Michail (2014). The k-NN algorithm for compositional data: a revised approach with and without zero values present. Journal of Data Science, 12(3): 519-534.

Friedman Jerome, Trevor Hastie and Robert Tibshirani (2009). The elements of statistical learning, 2nd edition. Springer, Berlin

Tsagris Michail, Simon Preston and Andrew T.A. Wood (2016). Improved classification for compositional data using the α-transformation. Journal of classification 33(2): 243-261.

Connie Stewart (2016). An approach to measure distance between compositional diet estimates containing essential zeros. Journal of Applied Statistics 44.7 (2017): 1137-1152.