Showing Items 241-260 of 676 on page 13 of 34: First Previous 8 9 10 11 12 13 14 15 16 17 18 Next Last
About: This code is provided by Jun Wan. It is used in the Chalearn one-shot learning gesture challenge (round 2). This code includes: bag of features, 3D MoSIFT-based features (i.e. 3D MoSIFT, 3D EMoSIFT and 3D SMoSIFT), and the MFSK feature. Changes:Initial Announcement on mloss.org.
|
About: Model Monitor is a Java toolkit for the systematic evaluation of classifiers under changes in distribution. It provides methods for detecting distribution shifts in data, comparing the performance [...] Changes:Improved AUROC calculation. Several minor bug fixes.
|
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 K-tree is a scalable approach to clustering inspired by the B+-tree and k-means algorithms. Changes:Release of K-tree implementation in Python. This is targeted at a research and rapid prototyping audience.
|
About: The goal of this project is to provide code for reading and writing machine learning data sets for as many programming languages as possible. Changes:Forgot to include the Java sources.
|
About: GradMC is an algorithm for MR motion artifact removal implemented in Matlab Changes:Added support for multi-rigid motion correction.
|
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: A Matlab implementation of Sparse PCA using the inverse power method for nonlinear eigenproblems. Changes:
|
About: This software is aimed at performing supervised/unsupervised learning on graph data, where each graph is represented as binary indicators of subgraph features. Changes:Initial Announcement on mloss.org.
|
About: An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet processes, Gaussian latent Dirichlet allocation and more. Changes:New maximum cluster argument for all algorithms. Also no more matlab interface since it seemed no one was using it, and I cannot support it any longer.
|
About: Fitting user specified models with Group Lasso penalty Changes:Fetched by r-cran-robot on 2013-04-01 00:00:05.428021
|
About: Easily prototype WEKA classifiers and filters using Python scripts. Changes:0.3.0
0.2.1
0.2.0
0.1.1
0.1.0
|
About: Visualizing the performance of scoring classifiers. Changes:Fetched by r-cran-robot on 2013-04-01 00:00:08.344833
|
About: PLearn is a large C++ machine-learning library with a set of Python tools and Python bindings. It is mostly a research platform for developing novel algorithms, and is being used extensively at [...] Changes:Initial Announcement on mloss.org.
|
About: Genetic Algorithm for Curve Fitting Changes:Fetched by r-cran-robot on 2012-10-01 00:00:04.684941
|
About: A Toolkit for Recursive Partytioning Changes:Fetched by r-cran-robot on 2013-04-01 00:00:06.838561
|
About: Incremental (Online) Nonparametric Classifier. You can classify both points (standard) or matrices (multivariate time series). Java and Matlab code already available. Changes:version 2: parameterless system, constant model size, prediction confidence (for active learning). NEW!! C++ version at: https://github.com/ilaria-gori/ABACOC
|
About: The spider is intended to be a complete object orientated environment for machine learning in Matlab. Aside from easy use of base learning algorithms, algorithms can be plugged together and can be [...] Changes:Initial Announcement on mloss.org.
|
About: hapFabia is an R package for identification of very short segments of identity by descent (IBD) characterized by rare variants in large sequencing data. It detects 100 times smaller segments than previous methods. Changes:o citation update o plot function improved
|