Skip to content

bikm1

1.1.0

Co-Clustering Adjusted Rand Index and Bikm1 Procedure for Contingency and Binary Data-Sets

0packages depend
3.3Kdownloads / year
test coverage
13/13checks pass

Overview

About
Maintained by Valerie RobertFirst published 2019-08-243 releasesCRAN page ↗

Co-clustering of the rows and columns of a contingency or binary matrix, or double binary matrices and model selection for the number of row and column clusters. Three models are considered: the Poisson latent block model for contingency matrix, the binary latent block model for binary matrix and a new model we develop: the multiple latent block model for double binary matrices. A new procedure named bikm1 is implemented to investigate more efficiently the grid of numbers of clusters. Then, the studied model selection criteria are the integrated completed likelihood (ICL) and the Bayesian integrated likelihood (BIC). Finally, the co-clustering adjusted Rand index (CARI) to measure agreement between co-clustering partitions is implemented. Robert Valerie, Vasseur Yann, Brault Vincent (2021) doi:10.1007/s00357-020-09379-w.

Install

Health

CRAN checks
13OK
Slowest check: 2.7 min · r-oldrel-windows-x86_64
Code health
None
Tests · ratio 0.00
not tracked
Coverage
87%
Documentation · exports
12
Dependencies · direct
Check history
  • OK2026-08-05
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • NOTE2026-08-01
    12 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • OK2026-03-10
    14 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE

Documentation

Documentation
READMENoVignettesNopkgdown siteNoNEWSYes · 67% structuredCode of conductNoContributing guideNo
Examples that run
39%
Documented parameters
100%
Return-value docs
100%
References docs
21%

Downloads

3.3K
CRAN downloads in the past year
Rank #13,066 · ~9/day · ~275/mo
Daily download trend is not available in this view yet.
20930 days
78990 days
3.3K1 year
Compare downloads with other packages →
Also on106 r2u43 autocran

Dependencies

Declared dependencies
6 external dependencies (excludes base and recommended)
Depends (0)
none
Imports (12)
gtoolsstatsgraphicsgrDevicesmethodsparallelade4pracmaggplot2reshape2gridlpSolve
LinkingTo (0)
none
Suggests (0)
none
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Code & Tests

People & History

People (1)
Maintainer (1)
Author, Maintainer
Authors (1)
Author, Maintainer
Package Timeline

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

  • R
    R 4.6.0 released · 2026-04-24
  • 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
  • 1.1.0Latest
    2021-07-16 · current release · diff ↗
  • R
    R 4.1.0 released · 2021-05-18
  • R
    R 4.0.0 released · 2020-04-24
  • 1.0.0
    2020-01-28 · diff ↗
  • 0.9.0
    2019-08-24
  • R
    R 3.6.0 released · 2019-04-26

Package metadata

First published
2019-08-24
Total releases
3 / 7 yrs
License
GPL-2 OSI
Download size
46 KB
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("bikm1")
Robert, V. (2021). bikm1: Co-Clustering Adjusted Rand Index and Bikm1 Procedure for Contingency and Binary Data-Sets (Version 1.1.0) [Computer software]. https://doi.org/10.32614/CRAN.package.bikm1

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 bikm1 version 1.1.0 [Data set]. HJJB, LLC. Data release v2026-08-23. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-23, 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