About: Multivariate partitioning Changes:Fetched by r-cran-robot on 2013-04-01 00:00:06.387032
|
About: An implementation of the infinite hidden Markov model. Changes:Since 0.4: Removed dependency from lightspeed (now using statistics toolbox). Updated to newer matlab versions.
|
About: A MATLAB spectral clustering package to deal with large data sets. Our tool can handle large data sets (200,000 RCV1 data) on a 4GB memory general machine. Spectral clustering algorithm has been [...] Changes:
|
About: A collection of python code to perform research in optimization. The aim is to provide reusable components that can be quickly applied to machine learning problems. Used in: - Ellipsoidal multiple instance learning - difference of convex functions algorithms for sparse classfication - Contextual bandits upper confidence bound algorithm (using GP) - learning output kernels, that is kernels between the labels of a classifier. Changes:
|
About: A Java Toolbox for Scalable Probabilistic Machine Learning. Changes:
Detailed information can be found in the toolbox's web page
|
About: HSSVM is a software for solving multi-class problem using Hyper-sphere Support Vector Machines model, implemented by Java. Changes:
|
About: A header-only C++ library for solving large scale eigenvalue problems Changes:
|
About: An open source Java software providing collaborative filtering algorithms. Changes:Initial Announcement on mloss.org.
|
About: Neural Networks in R using the Stuttgart Neural Network Simulator (SNNS) Changes:Fetched by r-cran-robot on 2012-02-01 00:00:11.194183
|
About: ALGLIB is an open source numerical analysis library distributed under GPL 2+. It implements both general numerical algorithms and machine learning algorithms. ALGLIB can be used from C#, C++, FreePascal, VBA and other languages. It is the only numerical analysis library which uses automatic translation to generate source code written in different programming languages with 100% identical functionality. Changes:
|
About: A library for fast computation of Gauss transforms in multiple dimensions, using the Improved Fast Gauss Transform and a tree data structure. This library is useful for efficient Kernel Density [...] Changes:Initial Announcement on mloss.org.
|
About: This local and parallel computation toolbox is the Octave and Matlab implementation of several localized Gaussian process regression methods: the domain decomposition method (Park et al., 2011, DDM), partial independent conditional (Snelson and Ghahramani, 2007, PIC), localized probabilistic regression (Urtasun and Darrell, 2008, LPR), and bagging for Gaussian process regression (Chen and Ren, 2009, BGP). Most of the localized regression methods can be applied for general machine learning problems although DDM is only applicable for spatial datasets. In addition, the GPLP provides two parallel computation versions of the domain decomposition method. The easiness of being parallelized is one of the advantages of the localized regression, and the two parallel implementations will provide a good guidance about how to materialize this advantage as software. Changes:Initial Announcement on mloss.org.
|
About: The Gesture Recognition Toolkit (GRT) is a cross-platform, open-source, c++ machine learning library that has been specifically designed for real-time gesture recognition. It features a large number of machine-learning algorithms for both classification and regression in addition to a wide range of supporting algorithms for pre-processing, feature extraction and dataset management. The GRT has been designed for real-time gesture recognition, but it can also be applied to more general machine-learning tasks. Changes:Added Decision Tree and Random Forests.
|
About: Scalable tensor factorization Changes:
|
About: Boosting algorithms for classification and regression, with many variations. Features include: Scalable and robust; Easily customizable loss functions; One-shot training for an entire regularization path; Continuous checkpointing; much more Changes:
|
About: Feed-forward Neural Networks and Multinomial Log-Linear Models Changes:Fetched by r-cran-robot on 2013-04-01 00:00:06.544403
|
About: The library is focused on implementation of propagation based approximate inference methods. Also implemented are a clique tree based exact inference, Gibbs sampling, and the mean field algorithm. Changes:Initial Announcement on mloss.org.
|
About: This is the source code of the mloss.org website. Changes:Now works with newer django versions and fixes several warnings and minor bugs underneath. The only user visible change is probably that the subscription and bookmark buttons work again.
|
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 write-up in written/toeblitz.pdf describing the package.
|
About: Efficient and Flexible Distributed/Mobile Deep Learning Framework, for python, R, Julia and more Changes:This version comes with Distributed and Mobile Examples
|