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
biodiversitycommunity-detectionconservationconservation-planninggraph-theoryprioritization
4.88 score 5 stars 15 scripts 188 downloadsprior3D - 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
biodiversityconservationconservation-planningdepthmarine-spatial-planningmultidimensional-environmentsprioritization
4.54 score 7 stars 3 scripts 163 downloadsSeaGraphs - Sea Currents to Connectivity Transformation
Transformation of sea currents to connectivity data. Two files of horizontal and vertical currents flows are transformed into connectivity data in the form of 'sfnetwork', shapefile, edge list and adjacency matrix. An application example is shown at Nagkoulis et al. (2025) <doi:10.1016/j.dib.2024.111268>.
Last updated
corridorsecological-modellinggraph-theory
4.04 score 2 stars 11 scripts 544 downloadsscoredec - 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
graph-theoryrcpps-core-decompositioncpp
3.74 score 1 stars 11 scripts 557 downloadscorbouli - 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
frequency-domain-filteringtime-series-analysis
3.70 score 1 stars 7 scripts 234 downloadspoobly - 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
homogeneityhsiao-testpanel-data
3.70 score 1 stars 1 scripts 129 downloadslightAUC - 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
aucefficiencyfastrcpprcppparallelspeedcpp
3.70 score 193 downloads