RSS Feed - BlogShowing Items 401-420 of 676 on page 21 of 34: First Previous 16 17 18 19 20 21 22 23 24 25 26 Next Last
About: Gaussian process RTS smoothing (forward-backward smoothing) based on moment matching. Changes:Initial Announcement on mloss.org.
|
About: The Hidden Topic Markov Model Changes:Initial Announcement on mloss.org.
|
About: Tekkotsu is a high-level framework for robot programming that provides primitives for perception, manipulation, navigation, and control. It supports a variety of robot platforms. Changes:Initial Announcement on mloss.org.
|
About: Oblique Trees for Classification Data Changes:Fetched by r-cran-robot on 2013-04-01 00:00:06.648184
|
About: CXXNET (spelled as: C plus plus net) is a neural network toolkit build on mshadow(https://github.com/tqchen/mshadow). It is yet another implementation of (convolutional) neural network. It is in C++, with about 1000 lines of network layer implementations, easily configuration via config file, and can get the state of art performance. Changes:Initial Announcement on mloss.org.
|
About: Fast Multidimensional GP Inference using Projected Additive Approximation Changes:Initial Announcement on mloss.org.
|
About: Efficient implementation of penalized multiple logistic regression (aka multi-class) with Mercer kernels, aka MAP approximation to the multi-class Gaussian process model. This includes [...] Changes:Initial Announcement on mloss.org.
|
About: This software package implements a series of statistical mixture models for bilingual text classificacion trained by the EM algorihtm. Changes:Initial Announcement on mloss.org.
|
About: BACKGROUND:Over the last decade several prediction methods have been developed for determining the structural and functional properties of individual protein residues using sequence and sequence-derived information. Most of these methods are based on support vector machines as they provide accurate and generalizable prediction models. RESULTS:We present a general purpose protein residue annotation toolkit (svmPRAT) to allow biologists to formulate residue-wise prediction problems. svmPRAT formulates the annotation problem as a classification or regression problem using support vector machines. One of the key features of svmPRAT is its ease of use in incorporating any user-provided information in the form of feature matrices. For every residue svmPRAT captures local information around the reside to create fixed length feature vectors. svmPRAT implements accurate and fast kernel functions, and also introduces a flexible window-based encoding scheme that accurately captures signals and pattern for training eective predictive models. CONCLUSIONS:In this work we evaluate svmPRAT on several classification and regression problems including disorder prediction, residue-wise contact order estimation, DNA-binding site prediction, and local structure alphabet prediction. svmPRAT has also been used for the development of state-of-the-art transmembrane helix prediction method called TOPTMH, and secondary structure prediction method called YASSPP. This toolkit developed provides practitioners an efficient and easy-to-use tool for a wide variety of annotation problems. Availability: http://www.cs.gmu.edu/~mlbio/svmprat/ Changes:Initial Announcement on mloss.org.
|
About: Given many points in ROC (Receiver Operator Characteristics) space, computes the convex hull. Changes:Initial Announcement on mloss.org.
|
|
About: This package implements Ideal PCA in MATLAB. Ideal PCA is a (cross-)kernel based feature extraction algorithm which is (a) a faster alternative to kernel PCA and (b) a method to learn data manifold certifying features. Changes:Initial Announcement on mloss.org.
|
About: The incomplete Cholesky decomposition for a dense symmetric positive definite matrix A is a simple way of approximating A by a matrix of low rank (you can choose the rank). It has been used [...] Changes:Initial Announcement on mloss.org.
|
About: PLEASD: A Matlab Toolbox for Structured Learning Changes:Initial Announcement on mloss.org.
|
About: The goal of the project is to provide a programming environment for easily exploring advanced topics in artificial intelligence and robotics without having to worry about the low-level details of [...] Changes:Initial Announcement on mloss.org.
|
About: The source code of the mldata.org site - a community portal for machine learning data sets. Changes:Initial Announcement on mloss.org.
|
About: This letter proposes a new multiple linear regression model using regularized correntropy for robust pattern recognition. First, we motivate the use of correntropy to improve the robustness of the classicalmean square error (MSE) criterion that is sensitive to outliers. Then an l1 regularization scheme is imposed on the correntropy to learn robust and sparse representations. Based on the half-quadratic optimization technique, we propose a novel algorithm to solve the nonlinear optimization problem. Second, we develop a new correntropy-based classifier based on the learned regularization scheme for robust object recognition. Extensive experiments over several applications confirm that the correntropy-based l1 regularization can improve recognition accuracy and receiver operator characteristic curves under noise corruption and occlusion. Changes:Initial Announcement on mloss.org.
|
About: NetKit is an open-source Network Learning toolkit for statistical relational learning. Its architecture is extremely modular, making it easy to combine different learning algorithms. Changes:Initial Announcement on mloss.org.
|
About: PRoNTo is freely available software and aims to facilitate the interaction between the neuroimaging and machine learning communities. The toolbox is based on pattern recognition techniques for the analysis of neuroimaging data. PRoNTo supports the analysis of all image modalities as long as they are NIfTI format files. However, only the following modalites have been tested for version 1.1: sMRI, fMRI, PET, FA (fractional anisotropy) and Beta (GLM coefficients) images. Changes:Initial Announcement on mloss.org.
|
About: You should never compute, maintain, or update the inverse of a symmetric positive definite matrix if you do not have to. Computing the inverse or manipulating it is inherently instable. You can [...] Changes:Initial Announcement on mloss.org.
|
About: SeDuMi is a software package to solve optimization problems over symmetric cones. This includes linear, quadratic, second order conic and semidefinite optimization, and any combination of these. Changes:Initial Announcement on mloss.org.
|