|
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: This package provides an implementation Schapire and Singer's AdaBoost.MH for multi-label classification. As a main feature, the package provides decision-tree weak learning, a generalization of [...] Changes:Initial Announcement on mloss.org.
|
|
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: The GraphDemo provides Matlab GUIs to explore similarity graphs and their use in machine learning. It aims to highlight the behavior of different kinds of similarity graphs and to demonstrate their [...] Changes:Initial Announcement on mloss.org.
|
|
About: PALMA computes the optimal spliced alignment of a mRNA sequence to a genomic sequence. The main python script takes two FASTA files containing the target (e.g. a DNA sequence, part of the genome) [...] Changes:Initial Announcement on mloss.org.
|
|
About: RapidMiner (formerly YALE) is one of the most widely used open-source data mining suites and software solutions due to its leading-edge technologies and its functional range. Applications of [...] Changes:Initial Announcement on mloss.org.
|
|
About: Torch is a statistical machine learning library written in C++ at IDIAP, Changes:Initial Announcement on mloss.org.
|
|
About: Lush is an object-oriented Lisp dialect with a super-simple way of integrating C/C++ code and libraries. It includes extensive libraries for numerical computing, machine learning, and computer [...] 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: 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: This page contains the implementation used in the paper „Experimental Design for Efficient Identification of Gene Regulatory Networks using Sparse Bayesian Models“ by Florian Steinke, Matthias [...] Changes:Initial Announcement on mloss.org.
|


