Lossless conversion algorithm for converting Cortical Learning Algorithm binary vectors to Modular Composite Representation vectors. Implements Integer Sparse Distributed Memory.
-
Updated
Aug 2, 2019 - Python
Lossless conversion algorithm for converting Cortical Learning Algorithm binary vectors to Modular Composite Representation vectors. Implements Integer Sparse Distributed Memory.
An R package for regression analysis of data from extreme sampling
A Dual Surrogate-based Evolutionary Algorithm for High-Dimensional Expensive Multiobjective Optimization Problems
PH-tree (Permutation Hierarchical Tree) implementation in Go.
Random Forest Two Sample Testing
The Artificial Bee Colony (ABC) algorithm that optimizes high dimensional continuous model parameters.
High-Dimensional Expensive Optimization by Classification-based Multiobjective Evolutionary Algorithm with Dimensionality Reduction
Official Implementation of On Optimal Private Online Stochastic Optimization and High Dimensional Decision Making
Evolutionary multiobjective optimization assisted by scalarization function approximation for high-dimensional expensive problems
An Efficeint and Fast Wrapper-based High-dimensional Feature Selection(SIFE) in MATLAB
This is a repository associated with the chapter book "Towards optimal sampling for learning sparse approximations in high dimensions" by Ben Adcock, Juan M. Cardenas, Nick Dexter and Sebastian Moraga to be published by Springer in late 2021, available at https://arxiv.org/abs/2202.02360
Multiple Classifiers-Assisted Evolutionary Algorithm Based on Decomposition for High-Dimensional Multiobjective Problems
Characterization of intra-individual variability using physiologically relevant measurements provides important insights into fundamental biological questions ranging from cell type identity to tumor development. For each individual, the data measurements can be written as a matrix with the different subsamples of the individual recorded in the …
Implementation MWPCR with R
R package for Non-local Prior Based Iterative Variable Selection for Genome-Wide Association Studies, or Other High-Dimensional Data
This is a repository associated with the paper "Near-optimal sampling strategies for multivariate function on general domains" by Ben Adcock and Juan M. Cardenas available at https://epubs.siam.org/doi/10.1137/19M1279459 and https://arxiv.org/abs/1908.01249
Optimal Transport - Monge, Bregman and Occam Estimator (A Short Tutorial)
R Package: Adaptively weighted group lasso for semiparametic quantile regression models
Locally Sensitive Hashing based embedding for High Dimensional Multivariate Time Series
Bayesian optimization with Standard Gaussian Processes on high dimensional benchmarks
Add a description, image, and links to the high-dimensional topic page so that developers can more easily learn about it.
To associate your repository with the high-dimensional topic, visit your repo's landing page and select "manage topics."