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

Logo TiMBL 6.1

by antalvdb - January 11, 2008, 09:20:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7442 views, 1620 downloads, 0 comments, 0 subscriptions

About: The TiMBL software package is a fast, decision-tree-based implementation of k-nearest neighbor classification. The package includes the IB1, IB2, TRIBL, TRIBL2, and IGTree algorithms, and offers [...]

Changes:

Initial Announcement on mloss.org.


Logo HLearn 1.0

by mikeizbicki - May 9, 2013, 05:58:18 CET [ Project Homepage BibTeX Download ] 6264 views, 1615 downloads, 1 subscription

About: HLearn makes simple machine learning routines available in Haskell by expressing them according to their algebraic structure

Changes:

Updated to version 1.0


Logo CVX, a modeling system for disciplined convex programming 1.2

by mcgrant - October 21, 2008, 23:55:08 CET [ Project Homepage BibTeX Download ] 8508 views, 1615 downloads, 2 subscriptions

About: CVX is a Matlab-based modeling system for convex optimization. CVX turns Matlab into a modeling language, allowing constraints and objectives to be specified using standard Matlab expression syntax. [...]

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 ] 7703 views, 1603 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 Rchemcpp 1.99.0

by klambaue - September 10, 2013, 09:10:13 CET [ Project Homepage BibTeX Download ] 6764 views, 1601 downloads, 1 subscription

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

About: The Rchemcpp package implements the marginalized graph kernel and extensions, Tanimoto kernels, graph kernels, pharmacophore and 3D kernels suggested for measuring the similarity of molecules.

Changes:

Moved from CRAN to Bioconductor. Improved handling of molecules, visualization and examples.


Logo aiParts 0.9.0

by bmarshall - September 8, 2008, 02:56:43 CET [ Project Homepage BibTeX Download ] 5585 views, 1594 downloads, 0 comments, 1 subscription

About: aiParts implements the High-Hope technique - options have models of emotions which affect and are affected by repeated attempts to solve a multi-decision problem. C++ classes for AI development.

Changes:

Initial Announcement on mloss.org.


Logo Sparse PCA 2.0

by tbuehler - December 31, 2015, 16:24:42 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7082 views, 1591 downloads, 3 subscriptions

About: A Matlab implementation of Sparse PCA using the inverse power method for nonlinear eigenproblems.

Changes:
  • Added deflation scheme to compute multiple principal components
  • Several internal runtime and memory optimizations
  • API change: sparsePCA.m is now used to compute multiple components; use computeTradeOffCurve.m to reproduce the examples in the NIPS paper

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

Changes:

Initial Announcement on mloss.org.


Logo r-cran-boost 1.0-0

by r-cran-robot - December 9, 2004, 22:57:00 CET [ Project Homepage BibTeX Download ] 5659 views, 1583 downloads, 1 subscription

About: Boosting Methods for Real and Simulated Data

Changes:

Fetched by r-cran-robot on 2009-06-24 07:16:09.478727


Logo TurboParser 2.0

by afm - October 11, 2012, 02:59:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7102 views, 1582 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 635 on page 30 of 64: First Previous 25 26 27 28 29 30 31 32 33 34 35 Next Last