Skip to content

nlcv

0.3.6

Nested Loop Cross Validation

0packages depend
6.2Kdownloads / year
test coverage
12/13checks pass

Overview

About
Maintained by Laure CougnaudFirst published 2017-10-195 releasesCRAN page ↗

Nested loop cross validation for classification purposes for misclassification error rate estimation. The package supports several methodologies for feature selection: random forest, Student t-test, limma, and provides an interface to the following classification methods in the 'MLInterfaces' package: linear, quadratic discriminant analyses, random forest, bagging, prediction analysis for microarray, generalized linear model, support vector machine (svm and ksvm). Visualizations to assess the quality of the classifier are included: plot of the ranks of the features, scores plot for a specific classification algorithm and number of features, misclassification rate for the different number of features and classification algorithms tested and ROC plot. For further details about the methodology, please check: Markus Ruschhaupt, Wolfgang Huber, Annemarie Poustka, and Ulrich Mansmann (2004) doi:10.2202/1544-6115.1078.

Install

Health

CRAN checks
1ERROR12OK
Failing flavors
  • ERROR r-oldrel-macos-x86_64
Slowest check: 9.4 min · r-oldrel-windows-x86_64
Code health
Yes
Tests · ratio 0.04
not tracked
Coverage
100%
Documentation · exports
16
Dependencies · direct
Check history
  • ERROR2026-03-10
    13 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE

Documentation

Documentation
READMENoVignettesYes · dynamicpkgdown siteNoNEWSNoCode of conductNoContributing guideNo
Examples that run
100%
Documented parameters
99%
Return-value docs
78%
References docs
3%

Downloads

6.2K
CRAN downloads in the past year
Rank #6,560 · ~17/day · ~519/mo
Daily download trend is not available in this view yet.
24330 days
1.3K90 days
6.2K1 year
Compare downloads with other packages →
Also on467 r2u

Dependencies

Declared dependencies
15 external dependencies (excludes base and recommended)
Depends (4)
LinkingTo (0)
none
Suggests (2)
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Code & Tests

People & History

People (3)
Maintainer (1)
Maintainer · added in 0.3.6
Authors (2)
Package Timeline

5 releases. Pick two to compare their code metrics. R releases are shown for context.

  • R
    R 4.6.0 released · 2026-04-24
  • 0.3.6Latest
    2025-05-06 · current release · diff ↗
  • R
    R 4.5.0 released · 2025-04-11
  • R
    R 4.4.0 released · 2024-04-24
  • R
    R 4.3.0 released · 2023-04-21
  • R
    R 4.2.0 released · 2022-04-22
  • R
    R 4.1.0 released · 2021-05-18
  • R
    R 4.0.0 released · 2020-04-24
  • R
    R 3.6.0 released · 2019-04-26
  • 0.3.5
    2018-06-29 · diff ↗
  • 0.3.4
    2018-05-18 · diff ↗
  • 0.3.3
    2018-05-04 · diff ↗
  • R
    R 3.5.0 released · 2018-04-23
  • 0.3.2
    2017-10-19
  • R
    R 3.4.0 released · 2017-04-21

Package metadata

First published
2017-10-19
Total releases
5 / 9 yrs
License
GPL-3 OSI
Minimum R
≥ 2.10
Bundled data
1.1 MB / 11 files
Download size
1.5 MB
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("nlcv")
Cougnaud, L., Talloen, W., & Verbeke, T. (2025). nlcv: Nested Loop Cross Validation (Version 0.3.6) [Computer software]. https://doi.org/10.32614/CRAN.package.nlcv

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for nlcv version 0.3.6 [Data set]. HJJB, LLC. Data release v2026-08-18. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-18, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy