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: 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: The Hidden Topic Markov Model Changes:Initial Announcement on mloss.org.
|
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: 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: 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: 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: 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: 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: Fast Multidimensional GP Inference using Projected Additive Approximation 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: 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: Quantile Regression Forests Changes:Fetched by r-cran-robot on 2013-04-01 00:00:07.576421
|
About: Multi-class vector classification based on cost function-driven learning vector quantization , minimizing misclassification. Changes:Initial Announcement on mloss.org.
|
About: A Java library to create, process and manage mixtures of exponential families. Changes:Initial Announcement on mloss.org.
|
About: This is an implementation of variational Dirichlet process Gaussian mixtures. Thus, this works like the k-means, but it searched for the number of clusters as well. Couple algorithms are [...] Changes:Initial Announcement on mloss.org.
|
About: This software contains several matlab scripts for computing the RDE (relevant dimensionality estimate). The RDE measures the number of leading PCA components in feature space which contain the [...] 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: 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.
|