About: The Cognitive Foundry is a modular Java software library of machine learning components and algorithms designed for research and applications.

• General:
  • Made code able to compile under both Java 1.6 and 1.7. This required removing some potentially unsafe methods that used varargs with generics.
  • Upgraded XStream dependency to 1.4.4.
  • Improved support for regression algorithms in learning.
  • Added general-purpose adapters to make it easier to compose learning algorithms and adapt their input or output.
• Common Core:
  • Added isSparse, toArray, dotDivide, and dotDivideEquals methods for Vector and Matrix.
  • Added scaledPlus, scaledPlusEquals, scaledMinus, and scaledMinusEquals to Ring (and thus Vector and Matrix) for potentially faster such operations.
  • Fixed issue where matrix and dense vector equals was not checking for equal dimensionality.
  • Added transform, transformEquals, tranformNonZeros, and transformNonZerosEquals to Vector.
  • Made LogNumber into a signed version of a log number and moved the prior unsigned implementation into UnsignedLogNumber.
  • Added EuclideanRing interface that provides methods for times, timesEquals, divide, and divideEquals. Also added Field interface that provides methods for inverse and inverseEquals. These interfaces are now implemented by the appropriate number classes such as ComplexNumber, MutableInteger, MutableLong, MutableDouble, LogNumber, and UnsignedLogNumber.
  • Added interface for Indexer and DefaultIndexer implementation for creating a zero-based indexing of values.
  • Added interfaces for MatrixFactoryContainer and DivergenceFunctionContainer.
  • Added ReversibleEvaluator, which various identity functions implement as well as a new utility class ForwardReverseEvaluatorPair to create a reversible evaluator from a pair of other evaluators.
  • Added method to create an ArrayList from a pair of values in CollectionUtil.
  • ArgumentChecker now properly throws assertion errors for NaN values. Also added checks for long types.
  • Fixed handling of Infinity in subtraction for LogMath.
  • Fixed issue with angle method that would cause a NaN if cosine had a rounding error.
  • Added new createMatrix methods to MatrixFactory that initializes the Matrix with the given value.
  • Added copy, reverse, and isEmpty methods for several array types to ArrayUtil.
  • Added utility methods for creating a HashMap, LinkedHashMap, HashSet, or LinkedHashSet with an expected size to CollectionUtil.
  • Added getFirst and getLast methods for List types to CollectionUtil.
  • Removed some calls to System.out and Exception.printStackTrace.
• Common Data:
  • Added create method for IdentityDataConverter.
  • ReversibleDataConverter now is an extension of ReversibleEvaluator.
• Learning Core:
  • Added general learner transformation capability to make it easier to adapt and compose algorithms. InputOutputTransformedBatchLearner provides this capability for supervised learning algorithms by composing together a triplet. CompositeBatchLearnerPair does it for a pair of algorithms.
  • Added a constant and identity learners.
  • Added Chebyshev, Identity, and Minkowski distance metrics.
  • Added methods to DatasetUtil to get the output values for a dataset and to compute the sum of weights.
  • Made generics more permissive for supervised cost functions.
  • Added ClusterDistanceEvaluator for taking a clustering that encodes the distance from an input value to all clusters and returns the result as a vector.
  • Fixed potential round-off issue in decision tree splitter.
  • Added random subspace technique, implemented in RandomSubspace.
  • Separated functionality from LinearFunction into IdentityScalarFunction. LinearFunction by default is the same, but has parameters that can change the slope and offset of the function.
  • Default squashing function for GeneralizedLinearModel and DifferentiableGeneralizedLinearModel is now a linear function instead of an atan function.
  • Added a weighted estimator for the Poisson distribution.
  • Added Regressor interface for evaluators that are the output of (single-output) regression learning algorithms. Existing such evaluators have been updated to implement this interface.
  • Added support for regression ensembles including additive and averaging ensembles with and without weights. Added a learner for regression bagging in BaggingRegressionLearner.
  • Added a simple univariate regression class in UnivariateLinearRegression.
  • MultivariateDecorrelator now is a VectorInputEvaluator and VectorOutputEvaluator.
  • Added bias term to PrimalEstimatedSubGradient.
• Text Core:
  • Fixed issue with the start position for tokens from LetterNumberTokenizer being off by one except for the first one.

About: MyMediaLite is a lightweight, multi-purpose library of recommender system algorithms.

Important changes:

• new rating predictor GSVD++ (contributed by Marcelo Manzato)
• new recommenders ExternalRatingPredictor and ExternalItemRecommender to evaluate external tools with the MyMediaLite evaluation framework
• incremental update support for item recommendation UserKNN and ItemKNN (based on a pull request by João Vinagre)
• --cross-validation support for the rating_based_ranking tool (as requested by Pieter-Jan Verbrugen)
• removed the group recommendation code
• cleaner item recommendation evaluation, with a bug fix in the cross-validation code and a complete rewrite of online evaluation
• removed unused matrix and vector math, faster and simplified matrix code

About: a dbms for resonating neural networks. Create and use different types of machine learning algorithms.

AIML compatible (AIML files can be imported); new 'Grid channel' for developing board games; improved topics editor; new demo project: ALice (from AIML); lots of bug-fixes and speed improvements

About: ELKI is a framework for implementing data-mining algorithms with support for index structures, that includes a wide variety of clustering and outlier detection methods.

This is mostly a bug fix release. A lot of small issues have been fixed that improve performance, make error reporting a lot better, ease the use of sparse vectors and external precomputed distances, for example.

This will be the last ELKI release to support Java 6. The next ELKI release will require Java 7.

Algorithms

• Some new LOF variants (LDF, SimpleLOF, SimpleKernelDensityLOF)
• Correlation Outlier Probabilities (ICDM 2012)
• A naive mean-shift clustering
• Single-link clustering (SLINK algorithm) should be significantly faster due to optimized data structures
• "Benchmarking" algorithms for measuring the performance of index structures

Index layer

• Bulk loading R-Trees should be faster - in particular Sort Tile Recursive can work very well.
• M-Trees have been refactored and optimized for double distances

Database layer

• Bundle format (work in progress): low-level binary format for fast data exchange
• DBID and DataStore layer received some additional classes for further performance improvements
• KNN heap structures were revisited. The code is less clean now, but performs better in benchmarks.

Visualizations

• General clean up and API simplifications
• Some additional modules and improvements

Various

• There is a new parameter class, RandomParameter
• Some new distributions were added, also to the data set generator.

Tutorials

• The website has new tutorials, including one on a k-means variation that produces equal sized clusters.

About: Accord.NET provides statistical analysis, machine learning, image processing and computer vision methods for .NET applications. The Accord.NET Framework extends the popular AForge.NET with new features, adding to a more complete environment for scientific computing in .NET.

This release brings Cox's proportional hazards models and the partial Newton-Raphson learning algorithm. It also provides a reorganization of the (Hidden Conditional Random) Fields namespace, together with more bugfixes, improvements and optimizations.

For a complete list of changes, please see the full release notes at the release details page.

About: An implementation of MROGH descriptor. For more information, please refer to: “Bin Fan, Fuchao Wu and Zhanyi Hu, Aggregating Gradient Distributions into Intensity Orders: A Novel Local Image Descriptor, CVPR 2011, pp.2377-2384.” The most up-to-date information can be found at : http://vision.ia.ac.cn/Students/bfan/index.htm

Initial Announcement on mloss.org.

About: This package is an implementation of a linear svm solver with a wide class of regularizations on the svm weight vector (l1, l2, mixed norm l1-lq, adaptive lasso). We provide solvers for the classical single task svm problem and for multi-task with joint feature selection or similarity promoting term.

Initial Announcement on mloss.org.

About: MDP is a Python library of widely used data processing algorithms that can be combined according to a pipeline analogy to build more complex data processing software. The base of available algorithms includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others.

What's new in version 3.3?

• support sklearn versions up to 0.12
• cleanly support reload
• fail gracefully if pp server does not start
• several bug-fixes and improvements

About: Matlab SVM toolbox for learning large margin filters in signal or images.

Initial Announcement on mloss.org.

About: MATLAB toolbox for advanced Brain-Computer Interface (BCI) research.

Initial Announcement on mloss.org.

About: Tools for functional network analysis.

Initial Announcement on mloss.org.

About: yaplf (Yet Another Python Learning Framework) is an extensible machine learning framework written in python

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.

Initial Announcement on mloss.org.

About: Piqle (Platform for Implementing Q-Learning Experiments) is a Java framework for fast design, prototyping and test of reinforcement learning experiments (RL). By clearly separating algorithms and problems, it allows users to focus on either part of the RL paradigm:designing new algorithms or implementing new problems. Piqle implements many classical RL algorithms, making their parameters easily tunable. At this time, 13 problems are implemented, several with one or more variants. The user's manual explains in detail how to code a new problem. Written in Java, Piqle is as platform-independent as Java itself. Its components can easily be embedded as part of complex implementations, like robotics or decision making.

Initial Announcement on mloss.org.

About: Aleph is both a multi-platform machine learning framework aimed at simplicity and performance, and a library of selected state-of-the-art algorithms.

Initial Announcement on mloss.org.

About: LaRank is an online solver for multiclass Support Vector Machines.

Initial Announcement on mloss.org.

About: Nested Effects Models (NEMs) are a class of directed graphical models originally introduced to analyze the effects of gene perturbation screens with high-dimensional phenotypes. In contrast to other [...]

Initial Announcement on mloss.org.

About: MinorThird is a collection of Java classes for storing text, annotating text, and learning to extract entities and categorize text. It was written primarily by William W. Cohen, a professor at [...]

Initial Announcement on mloss.org.