About: The TiMBL software package is a fast, decision-tree-based implementation of k-nearest neighbor classification. The package includes the IB1, IB2, TRIBL, TRIBL2, and IGTree algorithms, and offers [...] Changes:Initial Announcement on mloss.org.
|
About: Message passing for topic modeling Changes:
|
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: Toolkit for parametric and nonparametric regression and classification. Changes:Initial Announcement on mloss.org.
|
About: A novel method to create parallel coordinates plots on large data sets without causing a "black screen" problem. Changes:Initial Announcement on mloss.org.
|
About: Torch is a statistical machine learning library written in C++ at IDIAP, Changes:Initial Announcement on mloss.org.
|
About: Torch5 provides a matlab-like environment for state-of-the-art machine learning algorithms. It is easy to use and provides a very efficient implementation, thanks to a easy and fast scripting [...] Changes:Initial Announcement on mloss.org.
|
About: A Python based library for running experiments with Deep Learning and Ensembles on GPUs. Changes:Initial Announcement on mloss.org.
|
About: A python implementation of Breiman's Random Forests. Changes:Initial Announcement on mloss.org.
|
About: TurboParser is a free multilingual dependency parser based on linear programming developed by André Martins. It is based on joint work with Noah Smith, Mário Figueiredo, Eric Xing, Pedro Aguiar. Changes:This version introduces a number of new features:
Note: The runtimes above are approximate, and based on experiments with a desktop machine with a Intel Core i7 CPU 3.4 GHz and 8GB RAM. To run this software, you need a standard C++ compiler. This software has the following external dependencies: AD3, a library for approximate MAP inference; Eigen, a template library for linear algebra; google-glog, a library for logging; gflags, a library for commandline flag processing. All these libraries are free software and are provided as tarballs in this package. This software has been tested on Linux, but it should run in other platforms with minor adaptations.
|
About: C++ Library for High-level Computer Vision Tasks Changes:Initial Announcement on mloss.org.
|
About: Q. Dong, Two-dimensional relaxed representation, Neurocomputing, 121:248-253, 2013, http://dx.doi.org/10.1016/j.neucom.2013.04.044 Changes:Initial Announcement on mloss.org.
|
About: This program implements a novel robust sparse representation method, called the two-stage sparse representation (TSR), for robust recognition on a large-scale database. Based on the divide and conquer strategy, TSR divides the procedure of robust recognition into outlier detection stage and recognition stage. The extensive numerical experiments on several public databases demonstrate that the proposed TSR approach generally obtains better classification accuracy than the state-of-the-art Sparse Representation Classification (SRC). At the same time, by using the TSR, a significant reduction of computational cost is reached by over fifty times in comparison with the SRC, which enables the TSR to be deployed more suitably for large-scale dataset. Changes:Initial Announcement on mloss.org.
|
About: A Matlab implementation of Uncorrelated Multilinear Discriminant Analysis (UMLDA) for dimensionality reduction of tensor data via tensor-to-vector projection Changes:Initial Announcement on mloss.org.
|
About: A Matlab implementation of Uncorrelated Multilinear PCA (UMPCA) for dimensionality reduction of tensor data via tensor-to-vector projection Changes:Initial Announcement on mloss.org.
|
About: The Universal Java Matrix Package (UJMP) is a data processing tool for Java. Unlike JAMA and Colt, it supports multi-threading and is therefore much faster on current hardware. It does not only support matrices with double values, but instead handles every type of data as a matrix through a common interface, e.g. CSV files, Excel files, images, WAVE audio files, tables in SQL data bases, and much more. Changes:Updated to version 0.3.0
|
About: The UniverSVM is a SVM implementation written in C/C++. Its functionality comprises large scale transduction via CCCP optimization, sparse solutions via CCCP optimization and data-dependent [...] Changes:Minor changes: fix bug on set_alphas_b0 function (thanks to Ferdinand Kaiser - ferdinand.kaiser@tut.fi)
|
About: You should never compute, maintain, or update the inverse of a symmetric positive definite matrix if you do not have to. Computing the inverse or manipulating it is inherently instable. You can [...] Changes:Initial Announcement on mloss.org.
|
About: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23). Changes:Initial Announcement on mloss.org.
|
About: Matlab implementation of variational gaussian approximate inference for Bayesian Generalized Linear Models. Changes:Code restructure and bug fix.
|