<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>mloss.org dlib ml</title><link>http://mloss.org</link><description>Updates and additions to dlib ml</description><language>en</language><lastBuildDate>Mon, 25 Mar 2013 23:48:23 -0000</lastBuildDate><item><title>dlib ml 18.1</title><link>http://mloss.org/software/view/83/</link><description>&lt;html&gt;&lt;p&gt;A C++ toolkit containing machine learning algorithms and tools that facilitate creating complex software in C++ to solve real world problems.
&lt;/p&gt;
&lt;p&gt;The library provides efficient implementations of the following algorithms:
&lt;/p&gt;
&lt;ul&gt;
 &lt;li&gt;
     support vector machines for classification, regression, and ranking
 &lt;/li&gt;

 &lt;li&gt;
     reduced-rank methods for large-scale classification and regression.&lt;br /&gt;
  This includes an SVM implementation and a method for performing 
  kernel ridge regression with efficient LOO cross-validation.
 &lt;/li&gt;

 &lt;li&gt;
     multi-class SVM
 &lt;/li&gt;

 &lt;li&gt;
     structural SVM (modes: single-threaded, multi-threaded, and fully distributed)
 &lt;/li&gt;

 &lt;li&gt;
     sequence labeling using structured SVMs
 &lt;/li&gt;

 &lt;li&gt;
     relevance vector machines for regression and classification 
 &lt;/li&gt;

 &lt;li&gt;
     reduced set approximation of SV decision surfaces
 &lt;/li&gt;

 &lt;li&gt;
     online kernel RLS regression 
 &lt;/li&gt;

 &lt;li&gt;
     online kernelized centroid estimation/one class classifier
 &lt;/li&gt;

 &lt;li&gt;
     online SVM classification
 &lt;/li&gt;

 &lt;li&gt;
     kernel k-means clustering 
 &lt;/li&gt;

 &lt;li&gt;
     radial basis function networks
 &lt;/li&gt;

 &lt;li&gt;
     kernelized recursive feature ranking
 &lt;/li&gt;

 &lt;li&gt;
     Bayesian network inference using junction trees or MCMC
 &lt;/li&gt;

 &lt;li&gt;
     General purpose unconstrained non-linear optimization algorithms using the conjugate gradient, BFGS, and L-BFGS techniques
 &lt;/li&gt;

 &lt;li&gt;
     Levenberg-Marquardt for solving non-linear least squares problems
 &lt;/li&gt;

 &lt;li&gt;
     A general purpose cutting plane optimizer.
 &lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The library also comes with extensive documentation and example programs that walk the user through the use of these machine learning techniques.&lt;br /&gt;

&lt;/p&gt;
&lt;p&gt;Finally, dlib includes a fast matrix library that lets the user use a simple Matlab like syntax.  It is also capable of using BLAS and LAPACK libraries such as ATLAS or the Intel MKL when available.  Additionally, the use of BLAS and LAPACK is transparent to the user, that is, the dlib matrix object uses BLAS and LAPACK internally to optimize various operations while still allowing the user to use a simple MATLAB like syntax.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Davis King</dc:creator><pubDate>Mon, 25 Mar 2013 23:48:23 -0000</pubDate><comments>http://mloss.org/software/rss/comments/83</comments><guid>http://mloss.org/software/view/83/</guid><category>svm</category><category>classification</category><category>clustering</category><category>regression</category><category>kernel methods</category><category>matrix library</category><category>kkmeans</category><category>optimization</category><category>algorithms</category><category>exact bayesian methods</category><category>approximate inference</category><category>bayesian networks</category><category>junction tree</category></item></channel></rss>