All entries.
Showing Items 131-140 of 638 on page 14 of 64: First Previous 9 10 11 12 13 14 15 16 17 18 19 Next Last

Logo JMLR EnsembleSVM 2.0

by claesenm - March 31, 2014, 08:06:20 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 14953 views, 4831 downloads, 2 subscriptions

About: The EnsembleSVM library offers functionality to perform ensemble learning using Support Vector Machine (SVM) base models. In particular, we offer routines for binary ensemble models using SVM base classifiers. Experimental results have shown the predictive performance to be comparable with standard SVM models but with drastically reduced training time. Ensemble learning with SVM models is particularly useful for semi-supervised tasks.

Changes:

The library has been updated and features a variety of new functionality as well as more efficient implementations of original features. The following key improvements have been made:

  1. Support for multithreading in training and prediction with ensemble models. Since both of these are embarassingly parallel, this has induced a significant speedup (3-fold on quad-core).
  2. Extensive programming framework for aggregation of base model predictions which allows highly efficient prototyping of new aggregation approaches. Additionally we provide several predefined strategies, including (weighted) majority voting, logistic regression and nonlinear SVMs of your choice -- be sure to check out the esvm-edit tool! The provided framework also allows you to efficiently program your own, novel aggregation schemes.
  3. Full code transition to C++11, the latest C++ standard, which enabled various performance improvements. The new release requires moderately recent compilers, such as gcc 4.7.2+ or clang 3.2+.
  4. Generic implementations of convenient facilities have been added, such as thread pools, deserialization factories and more.

The API and ABI have undergone significant changes, many of which are due to the transition to C++11.


Logo epac 0.10

by jinpengli - October 9, 2013, 14:00:15 CET [ Project Homepage BibTeX Download ] 3658 views, 888 downloads, 1 subscription

About: Embarrassingly Parallel Array Computing: EPAC is a machine learning workflow builder.

Changes:

Initial Announcement on mloss.org.


Logo Epistatic MAP Imputation 1.1

by colm - November 25, 2010, 21:01:10 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4764 views, 1080 downloads, 1 subscription

About: Epistatic miniarray profiles (E-MAPs) are a high-throughput approach capable of quantifying aggravating or alleviating genetic interactions between gene pairs. The datasets resulting from E-MAP experiments typically take the form of a symmetric pairwise matrix of interaction scores. These datasets have a significant number of missing values - up to 35% - that can reduce the effectiveness of some data analysis techniques and prevent the use of others. This project contains nearest neighbor based tools for the imputation and prediction of these missing values. The code is implemented in Python and uses a nearest neighbor based approach. Two variants are used - a simple weighted nearest neighbors, and a local least squares based regression.

Changes:

Initial Announcement on mloss.org.


Logo JMLR Error Correcting Output Codes Library 0.1

by sescalera - March 5, 2010, 16:49:12 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 13105 views, 1753 downloads, 1 subscription

About: The open source Error-Correcting Output Codes (ECOC) library contains both state-of-the-art coding and decoding designs, as well as the option to include your own coding, decoding, and base classifier.

Changes:

Initial Announcement on mloss.org.


Logo Evaluation toolkit 1.0

by openpr_nlpr - August 13, 2013, 08:58:25 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3359 views, 696 downloads, 1 subscription

About: This evaluation toolkit provides a unified framework for evaluating bag-of-words based encoding methods over several standard image classification datasets.

Changes:

Initial Announcement on mloss.org.


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

Changes:

Initial Announcement on mloss.org.


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 ] 8450 views, 1432 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 ] 9145 views, 1711 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 ] 16129 views, 3278 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 ] 4059 views, 821 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.


Showing Items 131-140 of 638 on page 14 of 64: First Previous 9 10 11 12 13 14 15 16 17 18 19 Next Last