prior3D - 3D Prioritization Algorithm

Three-dimensional systematic conservation planning, conducting nested prioritization analyses across multiple depth levels and ensuring efficient resource allocation throughout the water column. It provides a structured workflow designed to address biodiversity conservation and management challenges in the 3 dimensions, while facilitating users’ choices and parameterization (Doxa et al. 2025 <doi:10.1016/j.ecolmodel.2024.110919>).

Last updated 26 days ago

biodiversityconservationconservation-planningdepthmarine-spatial-planningmultidimensional-environmentsprioritization

5.62 score 6 stars 3 scripts 509 downloads

priorCON - Graph Community Detection Methods into Systematic Conservation Planning

An innovative tool-set that incorporates graph community detection methods into systematic conservation planning. It is designed to enhance spatial prioritization by focusing on the protection of areas with high ecological connectivity. Unlike traditional approaches that prioritize individual planning units, 'priorCON' focuses on clusters of features that exhibit strong ecological linkages. The 'priorCON' package is built upon the 'prioritizr' package <doi:10.32614/CRAN.package.prioritizr>, using commercial and open-source exact algorithm solvers that ensure optimal solutions to prioritization problems.

Last updated 27 days ago

biodiversitycommunity-detectionconservationconservation-planninggraph-theoryprioritization

5.37 score 3 stars 13 scripts 258 downloads

corbouli - Corbae-Ouliaris Frequency Domain Filtering

Corbae-Ouliaris frequency domain filtering. According to Corbae and Ouliaris (2006) <doi:10.1017/CBO9781139164863.008>, this is a solution for extracting cycles from time series, like business cycles etc. when filtering. This method is valid for both stationary and non-stationary time series.

Last updated 1 months ago

frequency-domain-filteringtime-series-analysis

4.70 score 7 scripts 435 downloads

scoredec - S-Core Graph Decomposition

S-Core Graph Decomposition algorithm for graphs. This is a method for decomposition of a weighted graph, as proposed by Eidsaa and Almaas (2013) <doi:10.1103/PhysRevE.88.062819>. The high speed and the low memory usage make it suitable for large graphs.

Last updated 3 months ago

graph-theoryrcpps-core-decompositioncpp

4.65 score 1 stars 3 scripts 527 downloads

lightAUC - Fast AUC Computation

Fast calculation of Area Under Curve (AUC) metric of a Receiver Operating Characteristic (ROC) curve, using the algorithm of Fawcett (2006) <doi:10.1016/j.patrec.2005.10.010>. Therefore it is appropriate for large-scale AUC metric calculations.

Last updated 9 days ago

aucefficiencyfastrcpprcppparallelspeedcpp

4.18 score 94 downloads

poobly - Poolability Tests in Panel Data

Homogeneity tests of the coefficients in panel data. Currently, only the Hsiao test for determining coefficient homogeneity between the panel data individuals is implemented, as described in Hsiao (2022), "Analysis of Panel Data" (<doi:10.1017/9781009057745>).

Last updated 1 months ago

homogeneityhsiao-testpanel-data

4.00 score 1 stars 267 downloads