Showing Items 381-400 of 676 on page 20 of 34: First Previous 15 16 17 18 19 20 21 22 23 24 25 Next Last
About: JOP is a Java virtual machine implemented in hardware. It is a hard real-time open source multicore processor capable of worst case execution time analysis of Java code. Changes:Initial Announcement on mloss.org.
|
About: OLaRank is an online solver of the dual formulation of support vector machines for sequence labeling using viterbi decoding. Changes:Initial Announcement on mloss.org.
|
About: The JINSECT toolkit is a Java-based toolkit and library that supports and demonstrates the use of n-gram graphs within Natural Language Processing applications, ranging from summarization and summary evaluation to text classi?cation and indexing. Changes:
|
About: Source code for EM approximate learning in the Latent Topic Hypertext Model. Changes:Initial Announcement on mloss.org.
|
About: Feature Selection SVM using penalty functions Changes:Fetched by r-cran-robot on 2013-04-01 00:00:07.509844
|
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: Orthonormal wavelet transform for D dimensional tensors in L levels. Generic quadrature mirror filters and tensor sizes. Runtime is O(n), plain C, MEX-wrapper and demo provided. Changes:Initial Announcement on mloss.org. |
About: Nilearn is a Python module for fast and easy statistical learning on NeuroImaging data. It leverages the scikit-learn Python toolbox for multivariate statistics with applications such as predictive modelling, classification, decoding, or connectivity analysis. Changes:Initial Announcement on mloss.org.
|
About: markov thebeast is a Markov Logic interpreter. We also see it as structured prediction framework in which the user can define a loglinear distribution over a complex output space. Changes:Initial Announcement on mloss.org.
|
About: SnOB is a C++ library implementing fast Fourier transforms on the symmetric group (group of permutations). Such Fourier transforms are used by some ranking and identity management algorithms, as [...] Changes:Initial Announcement on mloss.org.
|
About: dANN is an Artificial Intelligence and Artificial Genetics library targeted at employing conventional techniques as well as acting as a platform for research & development of novel techniques. As new techniques are developed and proven to be effective they will be integrated into the core library. It is currently written in Java, C++, and C#. However only the java version is currently in active development. If you want to obtain a version other than the java version you will need to get it directly from GIT. Changes:Please get the version in GIT only, the released version is old.
|
About: Very simple code for training SVMs in the primal. Works particularly well on sparse linear problems. In the non-linear case the entire kernel matrix needs to be computed, so for large problems it is [...] Changes:Initial Announcement on mloss.org.
|
About: A work in progress Changes:Initial Announcement on mloss.org.
|
About: Efficient C++ library for analog reservoir computing neural networks (Echo State Networks). Changes:Initial Announcement on mloss.org.
|
About: This software is an implementation of Hidden Markov Support Vector Machines (HMSVMs). Changes:Initial Announcement on mloss.org.
|
About: Multi-class vector classification based on cost function-driven learning vector quantization , minimizing misclassification. 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: dysii is a C++ library for distributed probabilistic inference and learning in large-scale dynamical systems. It provides methods such as the Kalman, unscented Kalman, and particle filters and [...] Changes:Initial Announcement on mloss.org.
|
About: This software is designed for learning translation invariant kernels for classification with support vector machines. 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.
|