All entries.
Showing Items 371-380 of 552 on page 38 of 56: First Previous 33 34 35 36 37 38 39 40 41 42 43 Next Last

Logo QuickDT 0.1

by sanity - September 21, 2011, 13:43:37 CET [ Project Homepage BibTeX Download ] 2336 views, 701 downloads, 1 subscription

About: A decision tree learner that is designed to be reasonably fast, but the primary goal is ease of use

Changes:

Initial Announcement on mloss.org.


Logo A Pattern Recognizer In Lua with ANNs v0.3.1

by pakozm - May 30, 2014, 10:49:10 CET [ Project Homepage BibTeX Download ] 2981 views, 697 downloads, 2 subscriptions

About: APRIL-ANN toolkit (A Pattern Recognizer In Lua with Artificial Neural Networks). This toolkit incorporates ANN algorithms (as dropout, stacked denoising auto-encoders, convolutional neural networks), with other pattern recognition methods as hidden makov models (HMMs) among others.

Changes:
  • Removed bugs.
  • Added Travis CI support.
  • KNN and clustering algorithms.
  • ZCA and PCA whitening.
  • Quickprop and ASGD optimization algorithms.
  • QLearning trainer.
  • Sparse float matrices are available in CSC an CSR formats.
  • Compilation with Homebrew and MacPorts available.
  • Compilation issues in Ubuntu 12.04 solved.

Logo Toeblitz Toolkit for Fast Toeplitz Matrix Operations 1.03

by cunningham - August 13, 2014, 02:21:36 CET [ BibTeX Download ] 2737 views, 695 downloads, 2 subscriptions

About: Toeblitz is a MATLAB/Octave package for operations on positive definite Toeplitz matrices. It can solve Toeplitz systems Tx = b in O(n*log(n)) time and O(n) memory, compute matrix inverses T^(-1) (with free log determinant) in O(n^2) time and memory, compute log determinants (without inverses) in O(n^2) time and O(n) memory, and compute traces of products A*T for any matrix A, in minimal O(n^2) time and memory.

Changes:

Adding a write-up in written/toeblitz.pdf describing the package.


Logo Gibbs RTSS 1.0

by marc - April 4, 2011, 19:58:43 CET [ BibTeX BibTeX for corresponding Paper Download ] 2667 views, 695 downloads, 1 subscription

About: The software provides an implementation of a filter/smoother based on Gibbs sampling, which can be used for inference in dynamical systems.

Changes:

Initial Announcement on mloss.org.


About: The package provides a Lagrangian approach to the posterior regularization of given linear mappings. This is important in two cases, (a) when systems are under-determined and (b) when the external model for calculating the mapping is invariant to properties such as scaling. The software may be applied in cases when the external model does not provide its own regularization strategy. In addition, the package allows to rank attributes according to their distortion potential to a given linear mapping.

Changes:

Version 1.1 (May 23, 2012) memory and time optimizations distderivrel.m now supports assessing the relevance of attribute pairs

Version 1.0 (Nov 9, 2011) * 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 ] 2866 views, 675 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 C5.0 2.07

by zenog - September 2, 2011, 14:49:04 CET [ Project Homepage BibTeX Download ] 2662 views, 667 downloads, 1 subscription

About: C5.0 is the successor of the C4.5 decision tree algorithm/tool. In particular, it is faster and more memory-efficient.

Changes:

Initial Announcement on mloss.org.


Logo Sparse PCA 1.0

by tbuehler - January 8, 2012, 19:01:47 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2881 views, 653 downloads, 1 subscription

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

Changes:

Initial Announcement on mloss.org.


Logo Action Recognition by Dense Trajectories 1.0

by openpr_nlpr - June 6, 2012, 11:38:07 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3437 views, 652 downloads, 1 subscription

About: The code is for computing state-of-the-art video descriptors for action recognition. The most up-to-date information can be found at: http://lear.inrialpes.fr/people/wang/dense_trajectories

Changes:

Initial Announcement on mloss.org.


Logo r-cran-partykit 0.1-5

by r-cran-robot - March 22, 2013, 00:00:00 CET [ Project Homepage BibTeX Download ] 2954 views, 644 downloads, 0 subscriptions

About: A Toolkit for Recursive Partytioning

Changes:

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


Showing Items 371-380 of 552 on page 38 of 56: First Previous 33 34 35 36 37 38 39 40 41 42 43 Next Last