All entries.
Showing Items 291-300 of 658 on page 30 of 66: First Previous 25 26 27 28 29 30 31 32 33 34 35 Next Last

Logo mSplicer 0.3

by sonne - May 18, 2008, 13:07:40 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8552 views, 1815 downloads, 3 subscriptions

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

About: For modern biology, precise genome annotations are of prime importance as they allow the accurate definition of genic regions. We employ state of the art machine learning methods to assay and [...]

Changes:

Initial Announcement on mloss.org.


Logo Logistic regression with dual spectral regularization 1.0

by ryota - April 27, 2008, 08:44:51 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7568 views, 1814 downloads, 1 subscription

About: It solves a classification problem over symmetric matrices with dual spectral norm (trace norm) regularization using a simple interior point method. It was successfully applied to single trial EEG [...]

Changes:

Initial Announcement on mloss.org.


Logo Variational Dirichlet process Gaussian mixtures 0.1

by kenkurihara - April 22, 2008, 01:41:49 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8493 views, 1814 downloads, 0 subscriptions

About: This is an implementation of variational Dirichlet process Gaussian mixtures. Thus, this works like the k-means, but it searched for the number of clusters as well. Couple algorithms are [...]

Changes:

Initial Announcement on mloss.org.


Logo r-cran-BPHO 1.3-0

by r-cran-robot - December 1, 2012, 00:00:03 CET [ Project Homepage BibTeX Download ] 8045 views, 1809 downloads, 1 subscription

About: Bayesian Prediction with High-order Interactions

Changes:

Fetched by r-cran-robot on 2012-12-01 00:00:03.777292


About: Matlab code for semi-supervised regression and dimensionality reduction using Hessian energy.

Changes:

Initial Announcement on mloss.org.


Logo BenchMarking Via Weka 0.0.4

by fracpete - December 4, 2008, 01:15:15 CET [ Project Homepage BibTeX Download ] 9954 views, 1792 downloads, 0 comments, 2 subscriptions

About: BenchMarking Via Weka is a client-server architecture that supports interoperability between different machine learning systems. Machine learning systems need to provide mechanisms for processing [...]

Changes:

Initial Announcement on mloss.org.


Logo Linear SVM with general regularization 1.0

by rflamary - October 5, 2012, 15:34:21 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 6511 views, 1789 downloads, 1 subscription

About: This package is an implementation of a linear svm solver with a wide class of regularizations on the svm weight vector (l1, l2, mixed norm l1-lq, adaptive lasso). We provide solvers for the classical single task svm problem and for multi-task with joint feature selection or similarity promoting term.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-grplasso 0.4-2

by r-cran-robot - April 1, 2009, 00:00:00 CET [ Project Homepage BibTeX Download ] 8733 views, 1781 downloads, 1 subscription

About: Fitting user specified models with Group Lasso penalty

Changes:

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


Logo Nen Beta

by pascal - February 19, 2012, 00:31:34 CET [ Project Homepage BibTeX Download ] 7450 views, 1778 downloads, 1 subscription

About: 3-layer neural network for regression with sigmoid activation function and command line interface similar to LibSVM.

Changes:

Initial Announcement on mloss.org.


Logo TurboParser 2.0

by afm - October 11, 2012, 02:59:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8239 views, 1773 downloads, 1 subscription

About: TurboParser is a free multilingual dependency parser based on linear programming developed by André Martins. It is based on joint work with Noah Smith, Mário Figueiredo, Eric Xing, Pedro Aguiar.

Changes:

This version introduces a number of new features:

  • The parser does not depend anymore on CPLEX (or any other non-free LP solver). Instead, the decoder is now based on AD3, our free library for approximate MAP inference.

  • The parser now outputs dependency labels along with the backbone structure.

  • As a bonus, we now provide a trainable part-of-speech tagger, called TurboTagger, which can be used in standalone mode, or to provide part-of-speech tags as input for the parser. TurboTagger has state-of-the-art accuracy for English (97.3% on section 23 of the Penn Treebank) and is fast (~40,000 tokens per second).

  • The parser is much faster than in previous versions. You may choose among a basic arc-factored parser (~4,300 tokens per second), a standard second-order model with consecutive sibling and grandparent features (the default; ~1,200 tokens per second), and a full model with head bigram and arbitrary sibling features (~900 tokens per second).

Note: The runtimes above are approximate, and based on experiments with a desktop machine with a Intel Core i7 CPU 3.4 GHz and 8GB RAM. To run this software, you need a standard C++ compiler. This software has the following external dependencies: AD3, a library for approximate MAP inference; Eigen, a template library for linear algebra; google-glog, a library for logging; gflags, a library for commandline flag processing. All these libraries are free software and are provided as tarballs in this package.

This software has been tested on Linux, but it should run in other platforms with minor adaptations.


Showing Items 291-300 of 658 on page 30 of 66: First Previous 25 26 27 28 29 30 31 32 33 34 35 Next Last