Showing Items 481-500 of 676 on page 25 of 34: First Previous 20 21 22 23 24 25 26 27 28 29 30 Next Last
About: Variable selection using random forests Changes:Fetched by r-cran-robot on 2012-02-01 00:00:12.245883
|
About: Pyriel is a Python system for learning classification rules from data. Unlike other rule learning systems, it is designed to learn rule lists that maximize the area under the ROC curve (AUC) instead of accuracy. Pyriel is mostly an experimental research tool, but it's robust and fast enough to be used for lightweight industrial data mining. Changes:1.5 Changed CF (confidence factor) to do LaPlace smoothing of estimates. New flag "--score-for-class C" causes scores to be computed relative to a given (positive) class. For two-class problems. Fixed bug in example sampling code (--sample n) Fixed bug keeping old-style example formats (terminated by dot) from working. More code restructuring.
|
About: This Java software implements Profile Hidden Markov Models (PHMMs) for protein classification for the WEKA workbench. Standard PHMMs and newly introduced binary PHMMs are used. In addition the software allows propositionalisation of PHMMs. Changes:description changed
|
About: A Sortware for All Pairs Similarity Search Changes:Initial Announcement on mloss.org.
|
About: KeplerWeka represents the integration of all the functionality of the WEKA Machine Learning Workbench into the open-source scientific workflow Kepler. Among them are classification, [...] Changes:
|
About: Ordinal classification tree functions Changes:Initial Announcement on mloss.org by r-cran-robot
|
About: OpenViBE is an opensource platform that enables to design, test and use Brain-Computer Interfaces (BCI). Broadly speaking, OpenViBE can be used in many real-time Neuroscience applications [...] Changes:New release 0.8.0.
|
About: The SUMO Toolbox is a Matlab toolbox that automatically builds accurate surrogate models (also known as metamodels or response surface models) of a given data source (e.g., simulation code, data set, script, ...) within the accuracy and time constraints set by the user. The toolbox minimizes the number of data points (which it selects automatically) since they are usually expensive. Changes:Incremental update, fixing some cosmetic issues, coincides with JMLR publication.
|
About: Moses is a statistical machine translation system that allows you to automatically train translation models for any language pair. All you need is a collection of translated texts (parallel corpus). An efficient search algorithm finds quickly the highest probability translation among the exponential number of choices. Changes:Initial Announcement on mloss.org.
|
About: jblas is a fast linear algebra library for Java. jblas is based on BLAS and LAPACK, the de-facto industry standard for matrix computations, and uses state-of-the-art implementations like ATLAS for all its computational routines, making jBLAS very fast. Changes:Changes from 1.0:
|
About: redsvd is a library for solving several matrix decomposition (SVD, PCA, eigen value decomposition) redsvd can handle very large matrix efficiently, and optimized for a truncated SVD of sparse matrices. For example, redsvd can compute a truncated SVD with top 20 singular values for a 100K x 100K matrix with 10M nonzero entries in about two second. Changes:Initial Announcement on mloss.org.
|
About: The gmm toolbox contains code for density estimation using mixtures of Gaussians: Starting from simple kernel density estimation with spherical and diagonal Gaussian kernels over manifold Parzen window until mixtures of penalised full Gaussians with only a few components. The toolbox covers many Gaussian mixture model parametrisations from the recent literature. Most prominently, the package contains code to use the Gaussian Process Latent Variable Model for density estimation. Most of the code is written in Matlab 7.x including some MEX files. Changes:Initial Announcement on mloss.org
|
About: A collection of clustering algorithms implemented in Javascript. Changes:Initial Announcement on mloss.org.
|
About: A stochastic variant of the mirror descent algorithm employing Langford and Zhang's truncated gradient idea to minimize L1 regularized loss minimization problems for classification and regression. Changes:Fixed major bug in implementation. The components of the iterate where the current example vector is zero were not being updated correctly. Thanks to Jonathan Chang for pointing out the error to us.
|
About: Feature Selection SVM using penalty functions Changes:Fetched by r-cran-robot on 2013-04-01 00:00:07.509844
|
About: PSVM - Support vector classification, regression and feature extraction for non-square dyadic data, non-Mercer kernels. Changes:Initial Announcement on mloss.org.
|
About: Implementation of LSTM for biological sequence analysis (classification, regression, motif discovery, remote homology detection). Additionally a LSTM as logistic regression with spectrum kernel is included. Changes:Spectrum LSTM package included
|
About: An implementation of the infinite hidden Markov model. Changes:Since 0.4: Removed dependency from lightspeed (now using statistics toolbox). Updated to newer matlab versions.
|
About: BCPy2000 provides a platform for rapid, flexible development of experimental Brain-Computer Interface systems based on the BCI2000.org project. From the developer's point of view, the implementation [...] Changes:Bugfixes and tuneups, and an expanded set of (some more-, some less-documented, optional tools)
|
About: The library implements Optimized Cutting Plane Algorithm (OCAS) for efficient training of linear SVM classifiers from large-scale data. Changes:Implemented COFFIN framework which allows efficient training of invariant image classifiers via virtual examples.
|