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.
Implementation of the Edge Selection Algorithm for undirected graph selection. The least angle regression-based algorithm selects edges of an undirected graph based on the projection of the current residuals on the two dimensional edge-planes. The algorithm selects symmetric adjacency matrix, which many other regression-based undirected graph selection procedures cannot do.
| Version: | 1.1 |
| Published: | 2025-10-06 |
| DOI: | 10.32614/CRAN.package.ES |
| Author: | Sanjay Chaudhuri [aut, cre], Victor Meng Hui [aut] |
| Maintainer: | Sanjay Chaudhuri <schaudhuri2 at unl.edu> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | ES results |
| Reference manual: | ES.html , ES.pdf |
| Package source: | ES_1.1.tar.gz |
| Windows binaries: | r-devel: ES_1.1.zip, r-release: not available, r-oldrel: ES_1.1.zip |
| macOS binaries: | r-release (arm64): ES_1.1.tgz, r-oldrel (arm64): ES_1.1.tgz, r-release (x86_64): ES_1.1.tgz, r-oldrel (x86_64): ES_1.1.tgz |
| Old sources: | ES archive |
Please use the canonical form https://CRAN.R-project.org/package=ES 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.