Showing Items 351-360 of 448 on page 36 of 45: First Previous 31 32 33 34 35 36 37 38 39 40 41 Next Last
|
About: CRFSuite is a speed-oriented implementation of Conditional Random Fields (CRFs). This software features: parameter estimation using SGD and L-BFGS, l1/l2 regularization, simple data I/O format, etc. Changes:Initial Announcement on mloss.org.
|
|
About: The goal of this project is to provide code for reading and writing machine learning data sets for as many programming languages as possible. Changes:Forgot to include the Java sources.
|
|
About: Pebl is a python library and command line application for learning the structure of a Bayesian network given prior knowledge and observations. Changes:Updated version to 1.0.1
|
|
About: Gradient Boosted Regression Trees with Errors-in-Variables Changes:Fetched by r-cran-robot on 2012-06-01 00:00:05.010630
|
|
About: Very fast implementation of the chi-squared distance between histograms (or vectors with non-negative entries). Changes:Removed bug in symmetric chi-square distance and updated python wrapper to python 2.5 compatiblity. |
|
About: Pynopticon is a toolbox that allows you to create and train your own object recognition classifiers. It makes rapid prototyping of object recognition work flows a snap. Simply create a dataset of [...] Changes:Initial Announcement on mloss.org.
|
|
About: SVQP1 and SVQP2 are QP solvers for training SVM. Changes:Initial Announcement on mloss.org.
|
|
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 package contains an implementation of the Infinite Kernel Learning (IKL) algorithm and the SimpleMKL algorithm. This is realized by building on Coin-Ipopt-3.3.5 and Libsvm. Changes:Initial Announcement on mloss.org.
|
|
About: A K-means clustering implementation for command-line, Python, Matlab and C. This algorithm yields the very same solution as standard Kmeans, even after each iteration. However it uses some triangle [...] Changes:Initial Announcement on mloss.org.
|


