About: This page contains the implementation used in the paper „Experimental Design for Efficient Identification of Gene Regulatory Networks using Sparse Bayesian Models“ by Florian Steinke, Matthias [...]

Initial Announcement on mloss.org.

About: Experiment Databases for Machine Learning is a large public database of machine learning experiments as well as a framework for producing similar databases for specific goals. It provides a way to [...]

Initial Announcement on mloss.org.

About: Scalable tensor factorization

• Improve (speed up) initialization of A by summation

About: FABIA is a biclustering algorithm that clusters rows and columns of a matrix simultaneously. Consequently, members of a row cluster are similar to each other on a subset of columns and, analogously, members of a column cluster are similar to each other on a subset of rows. Biclusters are found by factor analysis where both the factors and the loading matrix are sparse. FABIA is a multiplicative model that extracts linear dependencies between samples and feature patterns. Applications include detection of transcriptional modules in gene expression data and identification of haplotypes/>identity by descent< consisting of rare variants obtained by next generation sequencing.

CHANGES IN VERSION 2.8.0

NEW FEATURES

o rescaling of lapla
o extractPlot does not plot sorted matrices

CHANGES IN VERSION 2.4.0

o spfabia bugfixes

CHANGES IN VERSION 2.3.1

NEW FEATURES

o Getters and setters for class Factorization

2.0.0:

• spfabia: fabia for a sparse data matrix (in sparse matrix format) and sparse vector/matrix computations in the code to speed up computations. spfabia applications: (a) detecting >identity by descent< in next generation sequencing data with rare variants, (b) detecting >shared haplotypes< in disease studies based on next generation sequencing data with rare variants;
• fabia for non-negative factorization (parameter: non_negative);
• changed to C and removed dependencies to Rcpp;
• improved update for lambda (alpha should be smaller, e.g. 0.03);
• introduced maximal number of row elements (lL);
• introduced cycle bL when upper bounds nL or lL are effective;
• reduced computational complexity;
• bug fixes: (a) update formula for lambda: tighter approximation, (b) corrected inverse of the conditional covariance matrix of z;

1.4.0:

• New option nL: maximal number of biclusters per row element;
• Sort biclusters according to information content;
• Improved and extended preprocessing;
• Update to R2.13

About: [FACTORIE](http://factorie.cs.umass.edu) is a toolkit for deployable probabilistic modeling, implemented as a software library in [Scala](http://scala-lang.org). It provides its users with a succinct language for creating [factor graphs](http://en.wikipedia.org/wiki/Factor_graph), estimating parameters and performing inference. It also has implementations of many machine learning tools and a full NLP pipeline.

Initial Announcement on mloss.org.

About: FAST is an implementation of Hidden Markov Models with Features. It allows features to modify both emissions and transition probabilities.

Initial Announcement on mloss.org.

About: The open-source C-package fastICA implements the fastICA algorithm of Aapo Hyvarinen et al. (URL: http://www.cs.helsinki.fi/u/ahyvarin/) to perform Independent Component Analysis (ICA) and Projection Pursuit. fastICA is released under the GNU Public License (GPL).

Initial Announcement on mloss.org.

About: FEAST provides implementations of common mutual information based filter feature selection algorithms (mim, mifs, mrmr, cmim, icap, jmi, disr, fcbf, etc), and an implementation of RELIEF. Written for C/C++ & Matlab.

Major refactoring of FEAST to improve speed and portability.

• FEAST now clones the input data if it's floating point and discretises it to unsigned ints once in a single pass. This improves the speed by about 30%.
• FEAST now has unsigned int entry points which avoid this discretisation and are much faster if the data is already categorical.
• Added weighted feature selection algorithms to FEAST which can be used for cost-sensitive feature selection.
• Added a Java API using JNI.
• FEAST now returns the internal score for each feature according to the criterion. Available in all three APIs.
• Rearranged the repository to make it easier to work with. Header files are now in `include`, source in `src`, the MATLAB API is in `matlab/` and the Java API is in `java/`.
• FEAST now compiles cleanly using `-std=c89 -Wall -Werror`.