Showing Items 111120 of 537 on page 12 of 54: First Previous 7 8 9 10 11 12 13 14 15 16 17 Next Last
About: Scalable tensor factorization Changes:

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:CHANGES IN VERSION 2.8.0NEW FEATURES
CHANGES IN VERSION 2.4.0
CHANGES IN VERSION 2.3.1NEW FEATURES
2.0.0:
1.4.0:

About: [FACTORIE](http://factorie.cs.umass.edu) is a toolkit for deployable probabilistic modeling, implemented as a software library in [Scala](http://scalalang.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. Changes:Initial Announcement on mloss.org.

About: The package "fastclime" provides a method of recover the precision matrix efficiently by applying parametric simplex method. The computation is based on a linear optimization solver. It also contains a generic LP solver and a parameterized LP solver using parametric simplex method. Changes:Initial Announcement on mloss.org.

About: The opensource Cpackage 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). Changes:Initial Announcement on mloss.org.

About: The library is focused on implementation of propagation based approximate inference methods. Also implemented are a clique tree based exact inference, Gibbs sampling, and the mean field algorithm. Changes: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. Changes:

About: A library for fast computation of Gauss transforms in multiple dimensions, using the Improved Fast Gauss Transform and a tree data structure. This library is useful for efficient Kernel Density [...] Changes:Initial Announcement on mloss.org.

About: A collection of clustering algorithms implemented in Javascript. Changes:Initial Announcement on mloss.org.

About: The Delay vector variance (DVV) method uses predictability of the signal in phase space to characterize the time series. Using the surrogate data methodology, so called DVV plots and DVV scatter [...] Changes:Initial Announcement on mloss.org.
