All entries.
Showing Items 151-160 of 674 on page 16 of 68: First Previous 11 12 13 14 15 16 17 18 19 20 21 Next Last

Logo Experiment Databases for Machine Learning 0.1

by JoaquinVanschoren - October 7, 2008, 18:06:55 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 9594 views, 1604 downloads, 1 subscription

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 [...]

Changes:

Initial Announcement on mloss.org.


Logo ExtRESCAL 0.7.2

by nzhiltsov - January 20, 2015, 00:35:15 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 12119 views, 2216 downloads, 2 subscriptions

About: Scalable tensor factorization

Changes:
  • Improve (speed up) initialization of A by summation

Logo FABIA 2.8.0

by hochreit - October 18, 2013, 10:14:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 19839 views, 4032 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarWhole Star1/2 Star
(based on 1 vote)

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.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

Logo factorie 1.0.0-M7

by apassos - October 7, 2013, 23:10:37 CET [ Project Homepage BibTeX Download ] 5254 views, 1007 downloads, 1 subscription

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.

Changes:

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.

Changes:

Initial Announcement on mloss.org.


Logo JMLR fastclime 1.2.3

by colin1898 - March 10, 2014, 08:54:41 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7707 views, 2305 downloads, 1 subscription

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.


Logo fastICA 0.1

by maitra - February 28, 2013, 06:30:20 CET [ Project Homepage BibTeX Download ] 5166 views, 1180 downloads, 1 subscription

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).

Changes:

Initial Announcement on mloss.org.


Logo JMLR FastInf 1.0

by arielj - June 4, 2010, 14:04:37 CET [ Project Homepage BibTeX Download ] 13135 views, 4807 downloads, 1 subscription

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.


Logo FEAST 2.0.0

by apocock - January 8, 2017, 00:49:19 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 54492 views, 9281 downloads, 4 subscriptions

Rating Whole StarWhole StarWhole StarWhole StarWhole Star
(based on 2 votes)

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:

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`.

Logo fertilized forests 1.0beta

by Chrisl_S - January 23, 2015, 16:04:31 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4089 views, 968 downloads, 1 subscription

About: The fertilized forests project has the aim to provide an easy to use, easy to extend, yet fast library for decision forests. It summarizes the research in this field and provides a solid platform to extend it. Offering consistent interfaces to C++, Python and Matlab and being available for all major compilers gives the user high flexibility for using the library.

Changes:

Initial Announcement on mloss.org.


Showing Items 151-160 of 674 on page 16 of 68: First Previous 11 12 13 14 15 16 17 18 19 20 21 Next Last