All entries.
Showing Items 431-440 of 536 on page 44 of 54: First Previous 39 40 41 42 43 44 45 46 47 48 49 Next Last

Logo XGBoost v0.2

by crowwork - May 17, 2014, 07:27:59 CET [ Project Homepage BibTeX Download ] 1476 views, 234 downloads, 1 subscription

About: eXtreme gradient boosting (tree) library. Features: - Sparse feature format allows easy handling of missing values, and improve computation efficiency. - Efficient parallel implementation that optimizes memory and computation. - Python interface

Changes:

New features: - Python interface - New objectives: weighted training, pairwise rank, multiclass softmax - Comes with example script on Kaggle Higgs competition, 20 times faster than skilearn's GBRT


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 tar directly instead of via link


About: TBEEF, a doubly ensemble framework for recommendation and prediction problems.

Changes:

Updated the included documentation.


Logo r-cran-grpreg 2.3-0

by r-cran-robot - February 10, 2013, 00:00:00 CET [ Project Homepage BibTeX Download ] 1439 views, 405 downloads, 0 subscriptions

About: Regularization paths for regression models with grouped covariates

Changes:

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


Logo Divvy 1.1.1

by jlewis - November 14, 2012, 20:21:29 CET [ Project Homepage BibTeX Download ] 1429 views, 695 downloads, 1 subscription

About: Divvy is a Mac OS X application for performing dimensionality reduction, clustering, and visualization.

Changes:

Initial Announcement on mloss.org.


About: A fast and robust learning of Bayesian networks

Changes:

Initial Announcement on mloss.org.


Logo pySPACE 1.0

by krell84 - August 23, 2013, 21:00:32 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 1417 views, 335 downloads, 1 subscription

About: --Signal Processing and Classification Environment in Python using YAML and supporting parallelization-- pySPACE is a modular software for processing of large data streams that has been specifically designed to enable distributed execution and empirical evaluation of signal processing chains. Various signal processing algorithms (so called nodes) are available within the software, from finite impulse response filters over data-dependent spatial filters (e.g. CSP, xDAWN) to established classifiers (e.g. SVM, LDA). pySPACE incorporates the concept of node and node chains of the MDP framework. Due to its modular architecture, the software can easily be extended with new processing nodes and more general operations. Large scale empirical investigations can be configured using simple text- configuration files in the YAML format, executed on different (distributed) computing modalities, and evaluated using an interactive graphical user interface.

Changes:

First release. Initial Announcement on mloss.org.


Logo Threshold Image for Small object 1.0

by openpr_nlpr - July 23, 2012, 11:25:46 CET [ Project Homepage BibTeX Download ] 1409 views, 384 downloads, 1 subscription

About: Including source code of Threshold Method,SVM,Play Scan and Play detection.

Changes:

Initial Announcement on mloss.org.


Logo GradMC 2.00

by tur - April 14, 2014, 15:48:48 CET [ BibTeX Download ] 1402 views, 486 downloads, 1 subscription

About: GradMC is an algorithm for MR motion artifact removal implemented in Matlab

Changes:

Added support for multi-rigid motion correction.


Logo Agglomerative MeanShift Clustering 1.0.0

by openpr_nlpr - December 2, 2011, 04:38:13 CET [ Project Homepage BibTeX Download ] 1384 views, 430 downloads, 1 subscription

About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity.

Changes:

Initial Announcement on mloss.org.


Showing Items 431-440 of 536 on page 44 of 54: First Previous 39 40 41 42 43 44 45 46 47 48 49 Next Last