The k-NN algorithm for compositional data with and without using the power transformation.
comp.knn(xnew, x, ina, a = 1, k = 5, apostasi = "ESOV", mesos = TRUE)alfa.knn(xnew, x, ina, a = 1, k = 5, mesos = TRUE,
apostasi = "euclidean", rann = FALSE)
ait.knn(xnew, x, ina, a = 1, k = 5, mesos = TRUE,
apostasi = "euclidean", rann = FALSE)
A matrix with the new compositional data whose group is to be predicted. Zeros are allowed, but you must be carefull to choose strictly positive values of \(\alpha\) or not to set apostasi= "Ait".
A matrix with the available compositional data. Zeros are allowed, but you must be carefull to choose strictly positive values of \(\alpha\) or not to set apostasi= "Ait".
A group indicator variable for the available data.
The value of \(\alpha\). As zero values in the compositional data are allowed, you must be careful to choose strictly positive vcalues of \(\alpha\). You have the option to put a = NULL. In this case, the xnew and x are assumed to be the already \(\alpha\)-transformed data.
The number of nearest neighbours to consider. It can be a single number or a vector.
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".
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).
If you have large scale datasets and want a faster k-NN search, you can use kd-trees implemented in the R package "RANN". In this case you must set this argument equal to TRUE. Note however, that in this case, the only available distance is by default "euclidean".
A vector with the estimated groups.
The k-NN algorithm is applied for the compositional data. There are many metrics and possibilities to choose from. The algorithm finds the k nearest observations to a new observation and allocates it to the class which appears most times in the neighbours. It then computes the arithmetic or the harmonic mean of the distances. The new point is allocated to the class with the minimum distance.
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 \(\alpha\)-transformation. Journal of classification 33(2): 243-261.
Connie Stewart (2017). An approach to measure distance between compositional diet estimates containing essential zeros. Journal of Applied Statistics 44(7): 1137-1152.
Clarotto L., Allard D. and Menafoglio A. (2022). A new class of \(\alpha\)-transformations for the spatial analysis of Compositional Data. Spatial Statistics, 47.
Endres, D. M. and Schindelin, J. E. (2003). A new metric for probability distributions. Information Theory, IEEE Transactions on 49, 1858-1860.
Osterreicher, F. and Vajda, I. (2003). A new class of metric divergences on probability spaces and its applicability in statistics. Annals of the Institute of Statistical Mathematics 55, 639-653.
compknn.tune, alfa.rda, comp.nb, alfa.nb, alfa,
esov, mix.compnorm
# NOT RUN {
x <- as.matrix( iris[, 1:4] )
x <- x/ rowSums(x)
ina <- iris[, 5]
mod <- comp.knn(x, x, ina, a = 1, k = 5)
table(ina, mod)
mod2 <- alfa.knn(x, x, ina, a = 1, k = 5)
table(ina, mod2)
# }
Run the code above in your browser using DataLab