- using R version 4.4.2 (2024-10-31)
- using platform: x86_64-pc-linux-gnu
- R was compiled by
gcc-14 (Debian 14.2.0-8) 14.2.0
GNU Fortran (Debian 14.2.0-8) 14.2.0
- running under: Debian GNU/Linux trixie/sid
- using session charset: UTF-8
- checking for file ‘Anthropometry/DESCRIPTION’ ... OK
- checking extension type ... Package
- this is package ‘Anthropometry’ version ‘1.19’
- checking package namespace information ... OK
- checking package dependencies ... OK
- checking if this is a source package ... OK
- checking if there is a namespace ... OK
- checking for executable files ... OK
- checking for hidden files and directories ... OK
- checking for portable file names ... OK
- checking for sufficient/correct file permissions ... OK
- checking serialization versions ... OK
- checking whether package ‘Anthropometry’ can be installed ... OK
See the install log for details.
- used C compiler: ‘gcc-14 (Debian 14.2.0-8) 14.2.0’
- checking package directory ... OK
- checking for future file timestamps ... OK
- checking ‘build’ directory ... OK
- checking DESCRIPTION meta-information ... OK
- checking top-level files ... OK
- checking for left-over files ... OK
- checking index information ... OK
- checking package subdirectories ... OK
- checking code files for non-ASCII characters ... OK
- checking R files for syntax errors ... OK
- checking whether the package can be loaded ... [2s/3s] OK
- checking whether the package can be loaded with stated dependencies ... [2s/2s] OK
- checking whether the package can be unloaded cleanly ... [2s/3s] OK
- checking whether the namespace can be loaded with stated dependencies ... [2s/3s] OK
- checking whether the namespace can be unloaded cleanly ... [2s/3s] OK
- checking loading without being on the library search path ... [2s/3s] OK
- checking use of S3 registration ... OK
- checking dependencies in R code ... OK
- checking S3 generic/method consistency ... OK
- checking replacement functions ... OK
- checking foreign function calls ... OK
- checking R code for possible problems ... [23s/33s] OK
- checking Rd files ... [1s/1s] NOTE
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:16: Lost braces; missing escapes or markup?
16 | Several internal functions used by both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms
| ^
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:16: Lost braces; missing escapes or markup?
16 | Several internal functions used by both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms
| ^
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:19: Lost braces; missing escapes or markup?
19 | This file contains several functions called for both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms. Therefore, they are not used directly.
| ^
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:19: Lost braces; missing escapes or markup?
19 | This file contains several functions called for both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms. Therefore, they are not used directly.
| ^
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:21: Lost braces; missing escapes or markup?
21 | The $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms are different in the way to generate and validate a clustering partition. However, the functions related to the further clustering steps are common to both of them. These functions are those collected in this file.
| ^
checkRd: (-1) Anthropometry-internalHipamAnthropom.Rd:21: Lost braces; missing escapes or markup?
21 | The $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms are different in the way to generate and validate a clustering partition. However, the functions related to the further clustering steps are common to both of them. These functions are those collected in this file.
| ^
checkRd: (-1) Anthropometry-package.Rd:22: Lost braces; missing escapes or markup?
22 | Anthropometry-internalHipamAnthropom: Several internal functions used by both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms.\cr
| ^
checkRd: (-1) Anthropometry-package.Rd:22: Lost braces; missing escapes or markup?
22 | Anthropometry-internalHipamAnthropom: Several internal functions used by both $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms.\cr
| ^
checkRd: (-1) Anthropometry-package.Rd:31: Lost braces; missing escapes or markup?
31 | checkBranchLocalIMO: Evaluation of the candidate clustering partition in $HIPAM_{IMO}$.\cr
| ^
checkRd: (-1) Anthropometry-package.Rd:32: Lost braces; missing escapes or markup?
32 | checkBranchLocalMO: Evaluation of the candidate clustering partition in $HIPAM_{MO}$.\cr
| ^
checkRd: (-1) Anthropometry-package.Rd:39: Lost braces; missing escapes or markup?
39 | getBestPamsamIMO: Generation of the candidate clustering partition in $HIPAM_{IMO}$. \cr
| ^
checkRd: (-1) Anthropometry-package.Rd:40: Lost braces; missing escapes or markup?
40 | getBestPamsamMO: Generation of the candidate clustering partition in $HIPAM_{MO}$.\cr
| ^
checkRd: (-1) checkBranchLocalIMO.Rd:4: Lost braces; missing escapes or markup?
4 | Evaluation of the candidate clustering partition in $HIPAM_{IMO}$
| ^
checkRd: (-1) checkBranchLocalIMO.Rd:9: Lost braces; missing escapes or markup?
9 | In this version of HIPAM, called $HIPAM_{IMO}$, there are three different stopping criteria: First, if $|P| leq 2$, then P is a terminal node. If not, the second stopping refers to the INCA (Index Number Clusters Atypical) criterion (Irigoien et al. (2008)): if $INCA_k leq 0.2$ for all k, then P is a terminal node. Finally, the third stopping criteria uses the Mean Split Silhouette. See Vinue et al. (2014) for more details.
| ^
checkRd: (-1) checkBranchLocalIMO.Rd:40: Lost braces; missing escapes or markup?
40 | Option 'IMO' for using $HIPAM_{IMO}$.
| ^
checkRd: (-1) checkBranchLocalIMO.Rd:70: Lost braces; missing escapes or markup?
70 | This function belongs to the $HIPAM_{IMO}$ algorithm and it is not solely used. That is why there is no section of \emph{examples} in this help page. See \code{\link{hipamAnthropom}}.
| ^
checkRd: (-1) checkBranchLocalMO.Rd:4: Lost braces; missing escapes or markup?
4 | Evaluation of the candidate clustering partition in $HIPAM_{MO}$
| ^
checkRd: (-1) checkBranchLocalMO.Rd:9: Lost braces; missing escapes or markup?
9 | In this version of HIPAM, called $HIPAM_{MO}$, there are two different stopping criteria: First, if $|P| leq 2$, then P is a terminal node. If not, the second stopping criteria uses the Mean Split Silhouette. See Vinue et al. (2014) for more details.
| ^
checkRd: (-1) checkBranchLocalMO.Rd:40: Lost braces; missing escapes or markup?
40 | Option 'MO' for using $HIPAM_{MO}$.
| ^
checkRd: (-1) checkBranchLocalMO.Rd:66: Lost braces; missing escapes or markup?
66 | This function belongs to the $HIPAM_{MO}$ algorithm and it is not solely used. That is why there is no section of \emph{examples} in this help page. See \code{\link{hipamAnthropom}}.
| ^
checkRd: (-1) getBestPamsamIMO.Rd:4: Lost braces; missing escapes or markup?
4 | Generation of the candidate clustering partition in $HIPAM_{IMO}$
| ^
checkRd: (-1) getBestPamsamIMO.Rd:9: Lost braces; missing escapes or markup?
9 | In this version of HIPAM, called $HIPAM_{IMO}$, the number k of (child) clusters is obtained by using the INCA (Index Number Clusters Atypical) criterion (Irigoien et al. (2008)) in the following way: at each node P, if there is k such that $INCA_k > 0.2$, then the k prior to the first largest slope decrease is selected. However, this procedure does not apply either to the top node or to the generation of the new partitions from which the Mean Split Silhouette is calculated. In these cases, even when all $INCA_k < 0.2$, k = 3 is fixed as the number of groups to divide and proceed. See Vinue et al. (2014) for more details.
| ^
checkRd: (-1) getBestPamsamIMO.Rd:27: Lost braces; missing escapes or markup?
27 | Option 'IMO' for using $HIPAM_{IMO}$.
| ^
checkRd: (-1) getBestPamsamIMO.Rd:74: Lost braces; missing escapes or markup?
74 | This function belongs to the $HIPAM_{IMO}$ algorithm and it is not solely used. That is why there is no section of \emph{examples} in this help page. See \code{\link{hipamAnthropom}}.
| ^
checkRd: (-1) getBestPamsamMO.Rd:4: Lost braces; missing escapes or markup?
4 | Generation of the candidate clustering partition in $HIPAM_{MO}$
| ^
checkRd: (-1) getBestPamsamMO.Rd:9: Lost braces; missing escapes or markup?
9 | In this version of HIPAM, called $HIPAM_{MO}$, the number k of (child) clusters is obtained by maximizing the silhouette width (asw). See Vinue et al. (2014) for more details.
| ^
checkRd: (-1) getBestPamsamMO.Rd:27: Lost braces; missing escapes or markup?
27 | Option 'MO' for using $HIPAM_{MO}$.
| ^
checkRd: (-1) getBestPamsamMO.Rd:70: Lost braces; missing escapes or markup?
70 | This function belongs to the $HIPAM_{MO}$ algorithm and it is not solely used. That is why there is no section of \emph{examples} in this help page. See \code{\link{hipamAnthropom}}.
| ^
checkRd: (-1) hipamAnthropom.Rd:9: Lost braces; missing escapes or markup?
9 | This function is a HIPAM algorithm adapted to deal with anthropometric data. To that end, a different dissimilarity function is incorporated. This function is that explained in McCulloch et al. (1998) and it is implemented in \code{\link{getDistMatrix}}. We call it $d_{MO}$. In addition, a different method to obtain a classification tree is also incorporated.
| ^
checkRd: (-1) hipamAnthropom.Rd:11: Lost braces; missing escapes or markup?
11 | Two HIPAM algorithms are proposed. The first one, called $HIPAM_{MO}$, is a HIPAM that uses $d_{MO}$. The second one, $HIPAM_{IMO}$, is a HIPAM algorithm that uses $d_{MO}$ and the INCA (Index Number Clusters Atypical) statistic criterion (Irigoien et al. (2008)) to decide the number of child clusters and as a stopping rule.
| ^
checkRd: (-1) hipamAnthropom.Rd:11: Lost braces; missing escapes or markup?
11 | Two HIPAM algorithms are proposed. The first one, called $HIPAM_{MO}$, is a HIPAM that uses $d_{MO}$. The second one, $HIPAM_{IMO}$, is a HIPAM algorithm that uses $d_{MO}$ and the INCA (Index Number Clusters Atypical) statistic criterion (Irigoien et al. (2008)) to decide the number of child clusters and as a stopping rule.
| ^
checkRd: (-1) hipamAnthropom.Rd:11: Lost braces; missing escapes or markup?
11 | Two HIPAM algorithms are proposed. The first one, called $HIPAM_{MO}$, is a HIPAM that uses $d_{MO}$. The second one, $HIPAM_{IMO}$, is a HIPAM algorithm that uses $d_{MO}$ and the INCA (Index Number Clusters Atypical) statistic criterion (Irigoien et al. (2008)) to decide the number of child clusters and as a stopping rule.
| ^
checkRd: (-1) hipamAnthropom.Rd:11: Lost braces; missing escapes or markup?
11 | Two HIPAM algorithms are proposed. The first one, called $HIPAM_{MO}$, is a HIPAM that uses $d_{MO}$. The second one, $HIPAM_{IMO}$, is a HIPAM algorithm that uses $d_{MO}$ and the INCA (Index Number Clusters Atypical) statistic criterion (Irigoien et al. (2008)) to decide the number of child clusters and as a stopping rule.
| ^
checkRd: (-1) hipamAnthropom.Rd:36: Lost braces; missing escapes or markup?
36 | Type of HIPAM algorithm to be used. The possible options are 'MO' (for $HIPAM_{MO}$) and 'IMO' (for $HIPAM_{IMO}$).
| ^
checkRd: (-1) hipamAnthropom.Rd:36: Lost braces; missing escapes or markup?
36 | Type of HIPAM algorithm to be used. The possible options are 'MO' (for $HIPAM_{MO}$) and 'IMO' (for $HIPAM_{IMO}$).
| ^
checkRd: (-1) hipamAnthropom.Rd:49: Lost braces; missing escapes or markup?
49 | The $HIPAM_{MO}$ algorithm uses the \code{\link{getBestPamsamMO}} and \code{\link{checkBranchLocalMO}} functions, while the $HIPAM_{IMO}$ algorithm uses the \code{\link{getBestPamsamIMO}} and \code{\link{checkBranchLocalIMO}} functions.
| ^
checkRd: (-1) hipamAnthropom.Rd:49: Lost braces; missing escapes or markup?
49 | The $HIPAM_{MO}$ algorithm uses the \code{\link{getBestPamsamMO}} and \code{\link{checkBranchLocalMO}} functions, while the $HIPAM_{IMO}$ algorithm uses the \code{\link{getBestPamsamIMO}} and \code{\link{checkBranchLocalIMO}} functions.
| ^
checkRd: (-1) hipamAnthropom.Rd:94: Lost braces; missing escapes or markup?
94 | All the functions related to the HIPAM algorithm were originally created by E. Wit et al., and they are available freely on \url{https://www.math.rug.nl/~ernst/book/smida.html}. In order to develop the $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms, we have used and adapted them.
| ^
checkRd: (-1) hipamAnthropom.Rd:94: Lost braces; missing escapes or markup?
94 | All the functions related to the HIPAM algorithm were originally created by E. Wit et al., and they are available freely on \url{https://www.math.rug.nl/~ernst/book/smida.html}. In order to develop the $HIPAM_{MO}$ and $HIPAM_{IMO}$ algorithms, we have used and adapted them.
| ^
- checking Rd metadata ... OK
- checking Rd line widths ... OK
- checking Rd cross-references ... OK
- checking for missing documentation entries ... OK
- checking for code/documentation mismatches ... OK
- checking Rd \usage sections ... OK
- checking Rd contents ... OK
- checking for unstated dependencies in examples ... OK
- checking contents of ‘data’ directory ... OK
- checking data for non-ASCII characters ... [0s/0s] OK
- checking LazyData ... OK
- checking data for ASCII and uncompressed saves ... OK
- checking line endings in C/C++/Fortran sources/headers ... OK
- checking pragmas in C/C++ headers and code ... OK
- checking compilation flags used ... OK
- checking compiled code ... OK
- checking sizes of PDF files under ‘inst/doc’ ... OK
- checking installed files from ‘inst/doc’ ... OK
- checking files in ‘vignettes’ ... OK
- checking examples ... [17s/22s] OK
- checking for unstated dependencies in vignettes ... OK
- checking package vignettes ... OK
- checking re-building of vignette outputs ... [10s/14s] OK
- checking PDF version of manual ... [7s/9s] OK
- checking HTML version of manual ... [3s/5s] OK
- checking for non-standard things in the check directory ... OK
- DONE
Status: 1 NOTE