Examples: visualization, C++, networks, data cleaning, html widgets, ropensci.

Found 22 packages in 0.01 seconds

SOMbrero — by Nathalie Vialaneix, a year ago

SOM Bound to Realize Euclidean and Relational Outputs

The stochastic (also called on-line) version of the Self-Organising Map (SOM) algorithm is provided. Different versions of the algorithm are implemented, for numeric and relational data and for contingency tables as described, respectively, in Kohonen (2001) , Olteanu & Villa-Vialaneix (2005) and Cottrell et al (2004) . The package also contains many plotting features (to help the user interpret the results), can handle (and impute) missing values and is delivered with a graphical user interface based on 'shiny'.

RNAseqNet — by Nathalie Vialaneix, 3 years ago

Log-Linear Poisson Graphical Model with Hot-Deck Multiple Imputation

Infer log-linear Poisson Graphical Model with an auxiliary data set. Hot-deck multiple imputation method is used to improve the reliability of the inference with an auxiliary dataset. Standard log-linear Poisson graphical model can also be used for the inference and the Stability Approach for Regularization Selection (StARS) is implemented to drive the selection of the regularization parameter. The method is fully described in .

mixKernel — by Nathalie Vialaneix, 2 years ago

Omics Data Integration Using Kernel Methods

Kernel-based methods are powerful methods for integrating heterogeneous types of data. mixKernel aims at providing methods to combine kernel for unsupervised exploratory analysis. Different solutions are provided to compute a meta-kernel, in a consensus way or in a way that best preserves the original topology of the data. mixKernel also integrates kernel PCA to visualize similarities between samples in a non linear space and from the multiple source point of view . A method to select (as well as funtions to display) important variables is also provided .

NiLeDAM — by Nathalie Vialaneix, a year ago

Monazite Dating for the NiLeDAM Team

Th-U-Pb electron microprobe age dating of monazite, as originally described in .

SISIR — by Nathalie Vialaneix, 4 months ago

Select Intervals Suited for Functional Regression

Interval fusion and selection procedures for regression with functional inputs. Methods include a semiparametric approach based on Sliced Inverse Regression (SIR), as described in (standard ridge and sparse SIR are also included in the package) and a random forest based approach, as described in .

treediff — by Nathalie Vialaneix, 5 months ago

Testing Differences Between Families of Trees

Perform test to detect differences in structure between families of trees. The method is based on cophenetic distances and aggregated Student's tests.

adjclust — by Pierre Neuvial, a year ago

Adjacency-Constrained Clustering of a Block-Diagonal Similarity Matrix

Implements a constrained version of hierarchical agglomerative clustering, in which each observation is associated to a position, and only adjacent clusters can be merged. Typical application fields in bioinformatics include Genome-Wide Association Studies or Hi-C data analysis, where the similarity between items is a decreasing function of their genomic distance. Taking advantage of this feature, the implemented algorithm is time and memory efficient. This algorithm is described in Ambroise et al (2019) .

taxodist — by Rodrigo Fonseca Villa, 10 days ago

Taxonomic Hierarchy Distances and Lineage Analysis

Computes distances between taxonomic hierarchy nodes using lineage data retrieved from The Taxonomicon < http://taxonomicon.taxonomy.nl>. For distinct nodes, distance is defined as the reciprocal of the depth of their most recent common ancestor; identical nodes have distance zero. This definition yields an ultrametric within each connected hierarchy. Path length, Wu-Palmer, and rank-based distances are also available, together with the taxonomic diversity and distinctness indices of Clarke and Warwick (1998) and their randomization test. Functions are provided for auditable name resolution, online or user-supplied lineage analysis, node ranks, clade membership, pairwise, matrix, and cross-set distance calculation, classification trees with named clades, hierarchical clustering, principal coordinates analysis, portable and comparable JSON analysis bundles, and cache management. Distance matrices are returned as base R 'dist' objects. The distances represent classification depth rather than evolutionary time or phylogenetic branch length.

rmet — by Rodrigo Fonseca Villa, 4 days ago

Download and Read Brazilian Meteorological Data from INMET

Automates the download and processing of historical hourly weather data from automatic stations of the Brazilian National Institute of Meteorology (INMET). It provides the official station catalogue with an offline snapshot and nearest-station search, validated and resumable downloads that detect updated archives, and a fast parser for the formatting and encoding inconsistencies of raw CSV files across years. It returns analysis-ready data frames with standardized column names and UTC timestamps. It flags implausible values with transparent quality-control checks, reports data completeness, and builds daily summaries in each station's local time with explicit rules for incomplete days. Data are retrieved from < https://portal.inmet.gov.br/dadoshistoricos> and < https://apitempo.inmet.gov.br/estacoes/T>.

Rtwalk — by Rodrigo Fonseca Villa, 17 days ago

An MCMC Sampler Using the t-Walk Algorithm

Implements the t-walk algorithm, a general-purpose, self-adjusting Markov Chain Monte Carlo (MCMC) sampler for continuous distributions as described by Christen & Fox (2010) . The t-walk requires no tuning and is robust for a wide range of target distributions, including high-dimensional and multimodal problems. The sampler is implemented in C++ and validated against a pure R reference implementation of the published algorithm. The package supports reproducible parallel chains, continuation of runs, single transitions for hybrid samplers, and convergence diagnostics following Vehtari et al. (2021) .