The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
The four functions svdcp() ('cp' for column partitioned), svdbip() or svdbip2() ('bip' for bipartitioned), and svdbips() ('s' for a simultaneous optimization of a set of 'r' solutions), correspond to a singular value decomposition (SVD) by blocks notion, by supposing each block depending on relative subspaces, rather than on two whole spaces as usual SVD does. The other functions, based on this notion, are relative to two column partitioned data matrices x and y defining two sets of subsets x_i and y_j of variables and amount to estimate a link between x_i and y_j for the pair (x_i, y_j) relatively to the links associated to all the other pairs. These methods were first presented in: Lafosse R. & Hanafi M.,(1997) <https://eudml.org/doc/106424> and Hanafi M. & Lafosse, R. (2001) <https://eudml.org/doc/106494>.
Version: | 2.0.0 |
Published: | 2024-05-02 |
DOI: | 10.32614/CRAN.package.BMconcor |
Author: | Roger Lafosse [aut],
Fabio Ashtar Telarico
|
Maintainer: | Fabio Ashtar Telarico <Fabio-Ashtar.Telarico at fdv.uni-lj.si> |
License: | GPL (≥ 3) |
URL: | https://fatelarico.github.io/BMconcor/ |
NeedsCompilation: | no |
CRAN checks: | BMconcor results |
Reference manual: | BMconcor.pdf |
Package source: | BMconcor_2.0.0.tar.gz |
Windows binaries: | r-devel: BMconcor_2.0.0.zip, r-release: BMconcor_2.0.0.zip, r-oldrel: BMconcor_2.0.0.zip |
macOS binaries: | r-release (arm64): BMconcor_2.0.0.tgz, r-oldrel (arm64): BMconcor_2.0.0.tgz, r-release (x86_64): BMconcor_2.0.0.tgz, r-oldrel (x86_64): BMconcor_2.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=BMconcor to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.