RSS Feed - BlogShowing Items 501-520 of 676 on page 26 of 34: First Previous 21 22 23 24 25 26 27 28 29 30 31 Next Last
About: FAST is an implementation of Hidden Markov Models with Features. It allows features to modify both emissions and transition probabilities. Changes:Initial Announcement on mloss.org.
|
About: Approximate Rank One FACtorization of tensors. An algorithm for factorization of three-way-tensors and determination of their rank, includes example applications. Changes:Initial Announcement on mloss.org.
|
About: Embarrassingly Parallel Array Computing: EPAC is a machine learning workflow builder. Changes:Initial Announcement on mloss.org.
|
|
About: C++ generic programming tools for machine learning Changes:Initial Announcement on mloss.org.
|
About: Toolkit for parametric and nonparametric regression and classification. Changes:Initial Announcement on mloss.org.
|
About: [FACTORIE](http://factorie.cs.umass.edu) is a toolkit for deployable probabilistic modeling, implemented as a software library in [Scala](http://scala-lang.org). It provides its users with a succinct language for creating [factor graphs](http://en.wikipedia.org/wiki/Factor_graph), estimating parameters and performing inference. It also has implementations of many machine learning tools and a full NLP pipeline. Changes:Initial Announcement on mloss.org.
|
About: Relevant Dimension Estimation (RDE) in Feature Spaces: The package provides functions for estimating the relevant dimension of a data set in feature spaces, applications to model selection, [...] Changes:Initial Announcement on mloss.org.
|
About: GPU-accelerated java deep neural networks Changes:Initial Announcement on mloss.org.
|
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.
|
About: minFunc is a Matlab function for unconstrained optimization of differentiable real-valued multivariate functions using line-search methods. It uses an interface very similar to the Matlab Optimization Toolbox function fminunc, and can be called as a replacement for this function. On many problems, minFunc requires fewer function evaluations to converge than fminunc (or minimize.m). Further it can optimize problems with a much larger number of variables (fminunc is restricted to several thousand variables), and uses a line search that is robust to several common function pathologies. Changes:Initial Announcement on mloss.org.
|
About: Classification and Regression Training LSF Style: Augment some caret functions for parallel processing Changes:Initial Announcement on mloss.org.
|
About: LOFS is a software toolbox for online streaming feature selection Changes:Initial Announcement on mloss.org.
|
About: revised version of BACOM Changes:Initial Announcement on mloss.org.
|
About: A Sortware for All Pairs Similarity Search Changes:Initial Announcement on mloss.org.
|
About: OpenPR-NBEM is an C++ implementation of Naive Bayes Classifier, which is a well-known generative classification algorithm for the application such as text classification. The Naive Bayes algorithm requires the probabilistic distribution to be discrete. OpenPR-NBEM uses the multinomial event model for representation. The maximum likelihood estimate is used for supervised learning, and the expectation-maximization estimate is used for semi-supervised and un-supervised learning. Changes:Initial Announcement on mloss.org.
|
About: CN24 is a complete semantic segmentation framework using fully convolutional networks. Changes:Initial Announcement on mloss.org.
|
About: Jatecs is an open source Java library focused on automatic text categorization. Changes:Initial Announcement on mloss.org.
|
About: A community detection method based on constrained fractional set programming (CFSP). Changes:Initial Announcement on mloss.org.
|
About: Crino: a neural-network library based on Theano Changes:1.0.0 (7 july 2014) : - Initial release of crino - Implements a torch-like library to build artificial neural networks (ANN) - Provides standard implementations for : * auto-encoders * multi-layer perceptrons (MLP) * deep neural networks (DNN) * input output deep architecture (IODA) - Provides a batch-gradient backpropagation algorithm, with adaptative learning rate
|
About: This is a Matlab/C++ "toolbox" of code for learning and inference with graphical models. It is focused on parameter learning using marginalization in the high-treewidth setting. Changes:Initial Announcement on mloss.org.
|