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: ES_1.1.zip, 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.
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.