Showing Items 201-220 of 676 on page 11 of 34: First Previous 6 7 8 9 10 11 12 13 14 15 16 Next Last
About: A bare-bones TensorFlow framework for Bayesian deep learning and Gaussian process approximation Changes:Release 0.7.0
|
About: HDDM is a python toolbox for hierarchical Bayesian parameter estimation of the Drift Diffusion Model (via PyMC). Drift Diffusion Models are used widely in psychology and cognitive neuroscience to study decision making. Changes:
|
About: TBEEF, a doubly ensemble framework for recommendation and prediction problems. Changes:Included the final technical report.
|
About: SVM Toolbox fully written in Matlab (even the QP solver). Features : SVM, MultiClassSVM, One-Class, SV Regression, AUC-SVM and Rankboost, 1-norm SVM, Regularization Networks, Kernel Basis Pursuit [...] Changes:Initial Announcement on mloss.org.
|
About: A (randomized) coordinate descent procedure to minimize L1 regularized loss for classification and regression purposes. Changes:Fixed some I/O bugs. Lines that ended with whitespace were not read correctly in the previous version.
|
About: CRF++ is a simple, customizable, and open source implementation of Conditional Random Fields (CRFs) for segmenting/labeling sequential data. Changes:Initial Announcement on mloss.org.
|
About: Divvy is a Mac OS X application for performing dimensionality reduction, clustering, and visualization. Changes:Initial Announcement on mloss.org.
|
About: Lush is an object-oriented Lisp dialect with a super-simple way of integrating C/C++ code and libraries. It includes extensive libraries for numerical computing, machine learning, and computer [...] Changes:Initial Announcement on mloss.org.
|
About: A comprehensive data mining environment, with a variety of machine learning components. Changes:Modifications following feedback from Knime main Author.
|
About: A chatterbot that learns natural languages learning from imitation. Changes:Alpha 1 - Codename: Wendell Borton ("Bllluuhhhhh...!!") Short term memory greatly improved.
|
About: The SGD-2.0 package contains implementations of the SGD and ASGD algorithms for linear SVMs and linear CRFs. Changes:Version 2.0 features ASGD.
|
About: Toolbox for circular statistics with Matlab (The Mathworks). Changes:Some bugfixes.
|
About: 3-layer neural network for regression with sigmoid activation function and command line interface similar to LibSVM. Changes:Initial Announcement on mloss.org.
|
About: GibbsLDA++: A C/C++ Implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling for parameter estimation and inference. GibbsLDA++ is fast and is designed to analyze hidden/latent topic [...] Changes:Initial Announcement on mloss.org.
|
About: Document/Text preprocessing for topic models: suite of Perl scripts for preprocessing text collections to create dictionaries and bag/list files for use by topic modelling software. Changes:Moved distribution and code across to GitHub. Changed "ldac" format to have 0 offset for word indices. Added "document frequency" (df) filtering on selection of tokens for linkTables. Playing with linkParse but its still unuseable generally.
|
About: The aim is to embed a given data relationship matrix into a low-dimensional Euclidean space such that the point distances / distance ranks correlate best with the original input relationships. Input relationships may be given as (sparse) (asymmetric) distance, dissimilarity, or (negative!) score matrices. Input-output relations are modeled as low-conditioned. (Weighted) Pearson and soft Spearman rank correlation, and unweighted soft Kendall correlation are supported correlation measures for input/output object neighborhood relationships. Changes:
|
About: R genetic programming framework Changes:Fetched by r-cran-robot on 2013-04-01 00:00:08.163887
|
About: A WEKA package for analyzing emotion and sentiment of tweets. Changes:Initial Announcement on mloss.org.
|
About: Stochastic neighbor embedding originally aims at the reconstruction of given distance relations in a low-dimensional Euclidean space. This can be regarded as general approach to multi-dimensional scaling, but the reconstruction is based on the definition of input (and output) neighborhood probability alone. The present implementation also allows for handling dissimilarity or score-induced neighborhood topologies and makes use of quasi 2nd order gradient-based (l-)BFGS optimization. Changes:
|
About: Reference implementation of the LASVM online and active SVM algorithms as described in the JMLR paper. The interesting bit is a small C library that implements the LASVM process and reprocess [...] Changes:Minor bug fix
|