Found 1684 packages in 0.02 seconds
Evolutionary Learning of Globally Optimal Trees
Commonly used classification and regression tree methods like the CART algorithm are recursive partitioning methods that build the model in a forward stepwise search. Although this approach is known to be an efficient heuristic, the results of recursive tree methods are only locally optimal, as splits are chosen to maximize homogeneity at the next step only. An alternative way to search over the parameter space of trees is to use global optimization methods like evolutionary algorithms. The 'evtree' package implements an evolutionary algorithm for learning globally optimal classification and regression trees in R. CPU and memory-intensive tasks are fully computed in C++ while the 'partykit' package is leveraged to represent the resulting trees in R, providing unified infrastructure for summaries, visualizations, and predictions.
Optimally Robust Estimation
R infrastructure for optimally robust estimation in general smoothly
parameterized models using S4 classes and methods as described Kohl, M.,
Ruckdeschel, P., and Rieder, H. (2010),
Random Orthonormal Matrix Generation and Optimization on the Stiefel Manifold
Simulation of random orthonormal matrices from linear and quadratic exponential family distributions on the Stiefel manifold. The most general type of distribution covered is the matrix-variate Bingham-von Mises-Fisher distribution. Most of the simulation methods are presented in Hoff(2009) "Simulation of the Matrix Bingham-von Mises-Fisher Distribution, With Applications to Multivariate and Relational Data"
Tools for Modeling Bumblebee Colony Growth and Decline
Bumblebee colonies grow during worker production, then
decline after switching to production of reproductive individuals
(drones and gynes). This package provides tools for modeling and
visualizing this pattern by identifying a switchpoint with a growth
rate before and a decline rate after the switchpoint. The mathematical
models fit by bumbl are described in Crone and Williams (2016)
Discrete and Global Optimization Routines
The R package 'adagio' will provide methods and algorithms for (discrete) optimization, e.g. knapsack and subset sum procedures, derivative-free Nelder-Mead and Hooke-Jeeves minimization, and some (evolutionary) global optimization functions.
A Solver for 'ompr' that Uses the R Optimization Infrastructure ('ROI')
A solver for 'ompr' based on the R Optimization Infrastructure ('ROI'). The package makes all solvers in 'ROI' available to solve 'ompr' models. Please see the 'ompr' website < https://dirkschumacher.github.io/ompr/> and package docs for more information and examples on how to use it.
Determining the Best Number of Clusters in a Data Set
It provides 30 indexes for determining the optimal number of clusters in a data set and offers the best clustering scheme from different results to the user.
Highly Optimized Protocol Buffer Serializers
Pure C++ implementations for reading and writing several common data formats based on Google protocol-buffers. Currently supports 'rexp.proto' for serialized R objects, 'geobuf.proto' for binary geojson, and 'mvt.proto' for vector tiles. This package uses the auto-generated C++ code by protobuf-compiler, hence the entire serialization is optimized at compile time. The 'RProtoBuf' package on the other hand uses the protobuf runtime library to provide a general- purpose toolkit for reading and writing arbitrary protocol-buffer data in R.
Machine Learning in R
Interface to a large number of classification and regression techniques, including machine-readable parameter descriptions. There is also an experimental extension for survival analysis, clustering and general, example-specific cost-sensitive learning. Generic resampling, including cross-validation, bootstrapping and subsampling. Hyperparameter tuning with modern optimization techniques, for single- and multi-objective problems. Filter and wrapper methods for feature selection. Extension of basic learners with additional operations common in machine learning, also allowing for easy nested resampling. Most operations can be parallelized.
Tools for Matrix Algebra, Optimization and Inference
Matrix is an universal and sometimes primary object/unit in applied mathematics and statistics. We provide a number of algorithms for selected problems in optimization and statistical inference. For general exposition to the topic with focus on statistical context, see the book by Banerjee and Roy (2014, ISBN:9781420095388).