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.

Updated to version 0.3.0

About: This is an optimization library based on Social Impact Theory(SITO). The optimizer works in the same way as PSO and GA.

bug removed

About: Data Sets, Functions and Examples from the Book

Fetched by r-cran-robot on 2018-01-01 00:00:07.925283

About: RapidMiner (formerly YALE) is one of the most widely used open-source data mining suites and software solutions due to its leading-edge technologies and its functional range. Applications of [...]

Initial Announcement on mloss.org.

About: A header-only C++ library for solving large scale eigenvalue problems

• Fixed regressions in v0.6.1 on some edge cases
• Improved the accuracy of restarting processes in SymEigsSolver and GenEigsSolver
• Code and documentation cleanup

About: Heteroscedastic Discriminant Analysis

Fetched by r-cran-robot on 2013-04-01 00:00:05.551691

About: APRIL-ANN toolkit (A Pattern Recognizer In Lua with Artificial Neural Networks). This toolkit incorporates ANN algorithms (as dropout, stacked denoising auto-encoders, convolutional neural networks), with other pattern recognition methods as hidden makov models (HMMs) among others.

• Updated home repository link to follow april-org github organization.
• Improved serialize/deserialize functions, reimplemented all the serialization procedure.
• Added exceptions support to LuaPkg and APRIL-ANN, allowing to capture C++ errors into Lua code.
• Added set class.
• Added series class.
• Added data_frame class, similar to Python Pandas DataFrame.
• Serialization and deserilization have been updated with more robust and reusable API, implemented in util.serialize() and util.deserialize() functions.
• Added matrix.ext.broadcast utility (similar to broadcast in numpy).
• Added ProbablisitcMatrixANNComponent, which allow to implement probabilistic mixtures of posteriors and/or likelihoods.
• Added batch normalization ANN component.
• Allowing matrix.join to add new axis.
• Added methods prod(), cumsum() and cumprod() at matrix classes.
• Added methods count_eq() and count_neq() at matrix classes.
• Serializable objects API have been augmented with methods ctor_name() and
  ctor_params() in Lua, refered to luaCtorName() and luaCtorParams() in C++.
• Added cast.to to dynamic cast C++ objects pushed into Lua, allowing to convert base class objects into any of its derived classes.
• Added matrix.sparse as valid values for targets in ann.loss.mse and
  ann.loss.cross_entropy.
• Changed matrix metamethods __index and __newindex, allowing to use
  matrix objects with standard Lua operator[].
• Added matrix.masked_fill and matrix.masked_copy matrix.
• Added matrix.indexed_fill and matrix.indexed_copy matrix.
• Added ann.components.probabilistic_matrix, and its corresponding specializations ann.components.left_probabilistic_matrix and
  ann.components.right_probabilistic_matrix.
• Added operator[] in the right side of matrix operations.
• Added ann.components.transpose.
• Added max_gradients_norm in traianble.supervised_trainer, to avoid gradients exploding.
• Added ann.components.actf.sparse_logistic a logistic activation function with sparsity penalty.
• Simplified math.add, math.sub, ... and other math extensions for reductions, their original behavior can be emulated by using bind function.
• Added bind function to freeze any positional argument of any Lua function.
• Function stats.boot uses multiple_unpack to allow a table of sizes and the generation of multiple index matrices.
• Added multiple_unpack Lua function.
• Added __tostring metamethod to numeric memory blocks in Lua.
• Added dataset.token.sparse_matrix, a dataset which allow to traverse by rows a sparse matrix instance.
• Added matrix.sparse.builders.dok, a builder which uses the Dictionary-of-Keys format to construct a sparse matrix from scratch.
• Added method data to numeric matrix classes.
• Added methods values, indices, first_index to sparse matrix class.
• Fixed bugs when reading bad formed CSV files.
• Fixed bugs at statistical distributions.
• FloatRGB bug solved on equal (+=, -=, ...) operators. This bug affected ImageRGB operations such as resize.
• Solved problems when chaining methods in Lua, some objects end to be garbage collected.
• Improved support of strings in auto-completion (rlcompleter package).
• Solved bug at SparseMatrix<T> when reading it from a file.
• Solved bug in Image<T>::rotate90_cw methods.
• Solved bug in SparseMatrix::toDense() method.

C/C++

• Better LuaTable accessors, using [] operator.
• Implementation of matrix __index, __newindex and __call metamethods in C++.
• Implementation of matProd(), matCumSum() and matCumProd() functions.
• Implementation of matCountEq() and matCountNeq() functions for
  Matrix<T>.
• Updated matrix_ext_operations.h to change API of matrix operations. All functions have been overloaded to accept an in-place operation and another version which receives a destination matrix.
• Adding iterators to language models.
• Added MatrixScalarMap2 which receives as input2 a SparaseMatrix instance. This functions needs to be generalized to work with CPU and CUDA.
• The method SparseMatrix<T>::fromDenseMatrix() uses a DOKBuilder object to build the sparse matrix.
• The conversion of a Matrix<T> into a SparseMatrix<T> has been changed from a constructor overload to the static method
  SparseMatrix<T>::fromDenseMatrix().
• Added support for IPyLua.
• Optimized matrix access for confusion matrix.
• Minor changes in class.lua.
• Improved binding to avoid multiple object copies when pushing C++ objects.
• Added Git commit hash and compilation time.

About: Scalable tensor factorization

• Improve (speed up) initialization of A by summation

About: R package facilitating the simulation and evaluation of context-free and contextual Multi-Armed Bandit policies.

Minor update.

About: The VLFeat open source library implements popular computer vision algorithms including affine covariant feature detectors, HOG, SIFT, MSER, k-means, hierarchical k-means, agglomerative information bottleneck, SLIC superpixels, and quick shift. It is written in C for efficiency and compatibility, with interfaces in MATLAB for ease of use, and detailed documentation throughout. It supports Windows, Mac OS X, and Linux. The latest version of VLFeat is 0.9.16.

VLFeat 0.9.16: Added VL_COVDET() (covariant feature detectors). This function implements the following detectors: DoG, Hessian, Harris Laplace, Hessian Laplace, Multiscale Hessian, Multiscale Harris. It also implements affine adaptation, estiamtion of feature orientation, computation of descriptors on the affine patches (including raw patches), and sourcing of custom feature frame. Addet the auxiliary function VL_PLOTSS(). This is the second point update supported by the PASCAL Harvest programme.

VLFeat 0.9.15: Added VL_HOG() (HOG features). Added VL_SVMPEGASOS() and a vastly improved SVM implementation. Added IHASHSUM (hashed counting). Improved INTHIST (integral histogram). Added VL_CUMMAX(). Improved the implementation of VL_ROC() and VL_PR(). Added VL_DET() (Detection Error Trade-off (DET) curves). Improved the verbosity control to AIB. Added support for Xcode 4.3, improved support for past and future Xcode versions. Completed the migration of the old test code in toolbox/test, moving the functionality to the new unit tests toolbox/xtest. Improved credits. This is the first point update supported by the PASCAL Harvest (several more to come shortly).

About: OpenGM is a free C++ template library, a command line tool and a set of MATLAB functions for optimization in higher order graphical models. Graphical models of any order and structure can be built either in C++ or in MATLAB, using simple and intuitive commands. These models can be stored in HDF5 files and subjected to state-of-the-art optimization algorithms via the OpenGM command line optimizer. All library functions can also be called directly from C++ code. OpenGM realizes the Inference Algorithm Interface (IAI), a concept that makes it easy for programmers to use their own algorithms and factor classes with OpenGM.

Initial Announcement on mloss.org.

About: Large scale, distributed graph processing made easy.

Graph partitioning methods APSP approximation method Performance improvements License change Bug fixes

About: OpenViBE is an opensource platform that enables to design, test and use Brain-Computer Interfaces (BCI). Broadly speaking, OpenViBE can be used in many real-time Neuroscience applications [...]

New release 0.8.0.

About: svm-struct-matlab is a MATLAB wrapper of T. Joachims' SVM^struct solver for structured output support vector machines.

Adds support for Xcode 4.0 and Mac OS X 10.7 and greater.

About: This package contains a python and a matlab implementation of the most widely used algorithms for multi-armed bandit problems. The purpose of this package is to provide simple environments for comparison and numerical evaluation of policies.

Initial Announcement on mloss.org.

About: THIS VERSION DISCONTINUED, see "http://mloss.org/software/view/424/". This library provides ways of computing generalised 2nd-order Stirling numbers for Pitman-Yor and Dirichlet processes. Included is a tester and parameter optimiser. This accompanies Buntine and Hutter's article: http://arxiv.org/abs/1007.0296

See the alternative MLOSS entry "libstb". Updated to 1.4!

About: A generalized version of spectral clustering using the graph p-Laplacian.

various internal optimizations

About: Multivariate partitioning

Fetched by r-cran-robot on 2013-04-01 00:00:06.387032

About: hapFabia is an R package for identification of very short segments of identity by descent (IBD) characterized by rare variants in large sequencing data.

o citation update

o plot function improved

About: The SGD-2.0 package contains implementations of the SGD and ASGD algorithms for linear SVMs and linear CRFs.

Version 2.0 features ASGD.