Showing Items 291300 of 619 on page 30 of 62: First Previous 25 26 27 28 29 30 31 32 33 34 35 Next Last
About: Efficient C++ library for analog reservoir computing neural networks (Echo State Networks). Changes:Initial Announcement on mloss.org.

About: Sequin is an open source sequence mining library written in C#. Changes:Sequin v1.1.0.0 released

About: PSVM  Support vector classification, regression and feature extraction for nonsquare dyadic data, nonMercer kernels. Changes:Initial Announcement on mloss.org.

About: Boosting algorithms for classification and regression, with many variations. Features include: Scalable and robust; Easily customizable loss functions; Oneshot training for an entire regularization path; Continuous checkpointing; much more Changes:

About: Itemset boosting (iBoost) performs linear regression in the complete space of power sets of mutations. It implements a forward feature selection procedure where, in each iteration, one mutation [...] Changes:Initial Announcement on mloss.org.

About: The KernelMachine Library is a free (released under the LGPL) C++ library to promote the use of and progress of kernel machines. Changes:Updated mloss entry (minor fixes).

About: OpenNN is an open source class library written in C++ programming language which implements neural networks, a main area of deep learning research. The library has been designed to learn from both data sets and mathematical models. Changes:New algorithms, correction of bugs, model selection algorithms.

About: EANT Without Structural Optimization is used to learn a policy in either complete or partially observable reinforcement learning domains of continuous state and action space. Changes:Initial Announcement on mloss.org.

About: The Hidden Topic Markov Model Changes:Initial Announcement on mloss.org.

About: Toeblitz is a MATLAB/Octave package for operations on positive definite Toeplitz matrices. It can solve Toeplitz systems Tx = b in O(n*log(n)) time and O(n) memory, compute matrix inverses T^(1) (with free log determinant) in O(n^2) time and memory, compute log determinants (without inverses) in O(n^2) time and O(n) memory, and compute traces of products A*T for any matrix A, in minimal O(n^2) time and memory. Changes:Adding a writeup in written/toeblitz.pdf describing the package.
