<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>mloss.org new software</title><link>http://mloss.org</link><description>Updates and additions to mloss.org</description><language>en</language><lastBuildDate>Fri, 19 Mar 2010 08:14:29 -0000</lastBuildDate><item><title>scikitlearn 0.1</title><link>http://mloss.org/revision/view/419/</link><description>&lt;html&gt;&lt;p&gt;The focus of the scikit-learn is on having reliable and portable machine learning algorithm accessible in Python. Effort is put in reducing the dependencies and having excellent Python bindings, for instance by keeping a close look on the memory. 
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bertrand Thirion, Edouard Duschenay, Vincent Michel, Gael Varoquaux, Olivier Grisel,  Jacob VanderPlas, alexandre granfort, fabian pedregosa</dc:creator><pubDate>Fri, 19 Mar 2010 08:14:29 -0000</pubDate><comments>http://mloss.org/software/rss/comments/419</comments><guid>http://mloss.org/revision/view/419/</guid><category>icml2010</category></item><item><title>OpenOpt 0.28</title><link>http://mloss.org/revision/view/418/</link><description>&lt;html&gt;&lt;p&gt;Universal Python-written numerical optimization toolbox. 
   Problems: NLP, LP, QP, SDP, SOCP, DFP(Non-linear Data Fit), 
   NSP(nonsmooth), MILP, LSP, LLSP, MMP, GLP, MINLP etc.
   Connects to dozens of solvers (some are C- or Fortran-written).
&lt;/p&gt;
&lt;p&gt;Provides graphic output of convergence and some more numerical
   optimization "MUST HAVE" features.
&lt;/p&gt;
&lt;p&gt;Our another tool FuncDesigner allows to involve automatic 
   differentiation + more convenient modelling of some optimization 
   problems and SLEs (systems of linear equations, possibly 
   sparse/overdetermined). 
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Dmitrey Kroshko</dc:creator><pubDate>Mon, 15 Mar 2010 19:12:17 -0000</pubDate><comments>http://mloss.org/software/rss/comments/418</comments><guid>http://mloss.org/revision/view/418/</guid><category>python</category><category>optimization</category></item><item><title>Pyriel 1.0</title><link>http://mloss.org/revision/view/417/</link><description>&lt;html&gt;&lt;p&gt;Pyriel is an experimental rule learning system written in Python.  Given a set of data labeled with class names, it will learn a set of data classification rules of the form:
&lt;/p&gt;
&lt;p&gt;   If condition1 AND condition2 AND ... AND conditionN  ==&amp;gt;  CLASS
&lt;/p&gt;
&lt;p&gt;Pyriel has a number of desirable properties for data mining:
&lt;/p&gt;
&lt;ul&gt;
 &lt;li&gt;&lt;p&gt;Because PRIE maximizes ROC performance, it naturally handles skewed datasets.
&lt;/p&gt;

 &lt;/li&gt;

 &lt;li&gt;&lt;p&gt;PRIE is able to handle multiple classes.  It will attempt to optimize the combined AUC for any number of classes simultaneously.
&lt;/p&gt;

 &lt;/li&gt;

 &lt;li&gt;&lt;p&gt;PRIE's output is a single rulelist and thus is relatively intelligible and modular.  To use this rulelist on a new unseen instance, the rules are evaluated sequentially and the first one matching determines the class and probability.  Some data mining practitioners consider rulelists to be more intelligible than rulesets because only a single rule matches a new instance.
&lt;/p&gt;

 &lt;/li&gt;

 &lt;li&gt;&lt;p&gt;Because PRIE uses a rulelist whose rules are ordered decreasing by class likelihood, the rulelist may be used naturally with the ROC convex hull (Provost and Fawcett, 2001).  In use, if operating conditions (class skew and relative error costs) are known, the rulelist can be truncated to eliminate rules that will never affect a classification decision.
&lt;/p&gt;

 &lt;/li&gt;

 &lt;li&gt;&lt;p&gt;PRIE handles numerical attributes naturally, using the ROC curve implicitly to identify promising discretizations.  Other classification models may discretize variables in a preprocessing pass or may use techniques unrelated to model construction.  PRIE considers every discretization of a continuous attribute to comprise a separate point in ROC space, and handles these the same as any other discrete attribute.
&lt;/p&gt;

 &lt;/li&gt;

 &lt;li&gt;&lt;p&gt;PRIE can handle set-valued attributes (Cohen, 1996), in which an attribute of an instance may take on a set of discrete values instead of a single one.  Such features are useful, for example, in text classification domains in which the set may represent the "bag of words" of a text document.
&lt;/p&gt;

 &lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;PRIE is unusual in that it uses basic principles from rule learning and computational geometry to focus the search for promising rule combinations. The result is a system that can learn rulelists with high AUC scores.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">tom fawcett</dc:creator><pubDate>Sun, 14 Mar 2010 03:51:18 -0000</pubDate><comments>http://mloss.org/software/rss/comments/417</comments><guid>http://mloss.org/revision/view/417/</guid><category>classification</category><category>roc</category><category>rule learning</category><category>scoring</category></item><item><title>ALGLIB 2.4.0</title><link>http://mloss.org/revision/view/416/</link><description>&lt;html&gt;&lt;p&gt;ALGLIB is an open source numerical analysis library distributed under GPL 2+. It implements both general numerical algorithms and machine learning algorithms.
&lt;/p&gt;
&lt;p&gt;As for machine learning algorithms, ALGLIB implements: MLPs, early stopping ensembles, LDA, PCA, k-means++, several other data analysis algorithms. As for general numerical algorithms, ALGLIB implements linear algebra functions (subset of LAPACK), linear solvers, ODE solvers, nonlinear optimization, interpolation/fitting, integration, fast transforms.
&lt;/p&gt;
&lt;p&gt;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. So, C# version is written entirely in C#, C++ version is entirely C++, but they provide exactly the same interface.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Sergey Bochkanov</dc:creator><pubDate>Wed, 10 Mar 2010 14:07:35 -0000</pubDate><comments>http://mloss.org/software/rss/comments/416</comments><guid>http://mloss.org/revision/view/416/</guid></item><item><title>dlib ml 17.26</title><link>http://mloss.org/revision/view/415/</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
 &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;/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;dlib also comes with a fast matrix library that lets the user use a simple Matlab like syntax.  It is also capable of using BLAS libraries such as ATLAS or the Intel MKL when available.  Additionally, the use of BLAS is transparent to the user, that is, the dlib matrix object uses BLAS internally to optimize all the various forms of matrix multiplication 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>Sun, 07 Mar 2010 21:37:42 -0000</pubDate><comments>http://mloss.org/software/rss/comments/415</comments><guid>http://mloss.org/revision/view/415/</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><item><title>Continuous Time Bayesian Network Reasoning and Learning Engine 1.0.2</title><link>http://mloss.org/revision/view/414/</link><description>&lt;html&gt;&lt;p&gt;CTBN-RLE is a continuous time Bayesian network reasoning and learning
   engine.  A continuous time Bayesian network (CTBN) provides a compact (factored) description of a continuous-time Markov process.  This software provides libraries and executables for most of the algorithms developed for CTBNs.  For learning, CTBN-RLE implements structure and parameter learning for both complete and partial data.  For inference, it implements exact inference and Gibbs and importance sampling approximate inference for any type of evidence pattern.  Additionally, the library supplies visualization methods for graphically displaying CTBNs or trajectories of evidence.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Christian Shelton, Yu Fan, William Lam, Joon Lee, Jing Xu</dc:creator><pubDate>Fri, 05 Mar 2010 23:45:20 -0000</pubDate><comments>http://mloss.org/software/rss/comments/414</comments><guid>http://mloss.org/revision/view/414/</guid><category>graphical models</category><category>continuous time</category></item><item><title>Error Correcting Output Codes Library 0.1</title><link>http://mloss.org/revision/view/413/</link><description>&lt;html&gt;&lt;p&gt;In this work we present an open source Error-Correcting Output Codes (ECOC) library. The ECOC framework is a powerful tool to deal with multi-class categorization problems. This library contains both state-of-the-art coding (one-versus-one, one-versus-all, dense random, sparse random, DECOC, forest-ECOC, and ECOC-ONE) and decoding designs hamming, euclidean, inverse hamming, laplacian, Beta-density, attenuated, loss-based, probabilistic kernel-based, and loss-weighted) with the parameters defined by the authors, as well as the option to include your own coding, decoding, and base classifier.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Sergio Escalera, Oriol Pujol, Petia Radeva</dc:creator><pubDate>Fri, 05 Mar 2010 16:49:12 -0000</pubDate><comments>http://mloss.org/software/rss/comments/413</comments><guid>http://mloss.org/revision/view/413/</guid><category>ensemble of classifiers</category><category>error correcting output codes</category><category>multiclass classification</category></item><item><title>PyBrain 0.3</title><link>http://mloss.org/revision/view/366/</link><description>&lt;html&gt;&lt;p&gt;PyBrain is a versatile machine learning library for Python. Its goal is to provide flexible, easy-to-use yet still powerful algorithms for machine learning tasks, including a variety of predefined environments and benchmarks to test and compare algorithms. Implemented algorithms include Long Short-Term Memory (LSTM), policy gradient methods, (multidimensional) recurrent neural networks and evolution strategies like CMA-ES, NES or FEM.
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daan Wierstra, Justin Bayer, Tom Schaul, Martin Felder, Frank Sehnke, Thomas Rueckstiess</dc:creator><pubDate>Wed, 03 Mar 2010 15:00:08 -0000</pubDate><comments>http://mloss.org/software/rss/comments/366</comments><guid>http://mloss.org/revision/view/366/</guid><category>optimization</category><category>evolution</category><category>lstm</category><category>mlp</category><category>policy gradients</category><category>rnn</category></item><item><title>Jstacs 1.3.1</title><link>http://mloss.org/revision/view/412/</link><description>&lt;html&gt;&lt;p&gt;Sequence analysis is one of the major subjects of bioinformatics. Several existing libraries combine the representation of biological sequences with exact and approximate pattern matching as well as alignment algorithms. We present Jstacs, an open source Java library, which focuses on the statistical analysis of biological sequences instead. Jstacs comprises an efficient representation of sequence data and provides implementations of many statistical models with generative and discriminative approaches for parameter learning. Using Jstacs, classifiers can be assessed and compared on test datasets or by cross-validation experiments evaluating several performance measures. Due to its strictly object-oriented design Jstacs is easy to use and readily extensible. 
&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jens Keilwagen, Jan Grau, Andre Gohr</dc:creator><pubDate>Tue, 02 Mar 2010 14:15:46 -0000</pubDate><comments>http://mloss.org/software/rss/comments/412</comments><guid>http://mloss.org/revision/view/412/</guid><category>bioinformatics</category><category>r</category><category>classification</category><category>machine learning</category><category>bayesian networks</category><category>markov random fields</category><category>supervised learning</category><category>em</category><category>mixture models</category><category>java</category><category>learning principles</category><category>probabilistic models</category><category>motif discovery</category></item><item><title>NaN toolbox 2.1.0</title><link>http://mloss.org/revision/view/411/</link><description>&lt;html&gt;&lt;p&gt;The NaN-toolbox provides a number of statistics functions and machine learning methods for the use with Octave and Matlab. The functions can handle data with missing values encoded as NaNs, weighting of data samples, and multi-class classification (using a one-versus-rest scheme). There is a common interface to a number of different classification methods (including FDA, LDA, Naive Bayes, QDA, RDA, sparse classifiers, interfaces to some SVMs, regression/PLS, Wiener-Hopf).&lt;br /&gt;

&lt;/p&gt;&lt;/html&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">alois schloegl</dc:creator><pubDate>Sun, 28 Feb 2010 22:00:21 -0000</pubDate><comments>http://mloss.org/software/rss/comments/411</comments><guid>http://mloss.org/revision/view/411/</guid><category>classification</category><category>multi class</category><category>machine learning</category><category>missing data</category><category>statistics</category><category>weighting</category></item></channel></rss>