All entries.
Showing Items 501-510 of 537 on page 51 of 54: First Previous 46 47 48 49 50 51 52 53 54 Next

Logo Variational Dirichlet process Gaussian mixtures 0.1

by kenkurihara - April 22, 2008, 01:41:49 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 6050 views, 1253 downloads, 0 subscriptions

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.


Logo MPIKmeans 1.5

by pgehler - January 16, 2009, 15:48:47 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 32376 views, 5060 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarWhole StarEmpty Star
(based on 1 vote)

About: A K-means clustering implementation for command-line, Python, Matlab and C. This algorithm yields the very same solution as standard Kmeans, even after each iteration. However it uses some triangle [...]

Changes:

Initial Announcement on mloss.org.


Logo Tekkotsu 4.0

by touretzky - December 5, 2007, 10:28:02 CET [ Project Homepage BibTeX Download ] 4494 views, 1003 downloads, 0 subscriptions

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.


Logo dysii Dynamic Systems Library 1.4.0

by lawmurray - December 17, 2008, 17:33:41 CET [ Project Homepage BibTeX Download ] 5252 views, 1298 downloads, 0 subscriptions

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.


Logo LibPG 126

by daa - December 3, 2007, 19:59:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5392 views, 1086 downloads, 0 subscriptions

About: The PG library is a high-performance reinforcement learning library. The name PG refers to policy-gradient methods, but this name is largely historical. The library also impliments value-based RL [...]

Changes:

Initial Announcement on mloss.org.


About: The High Dimensional Discriminant Analysis (HDDA) toolbox contains an efficient supervised classifier for high-dimensional data. This classifier is based on Gaussian models adapted for [...]

Changes:

Initial Announcement on mloss.org.


About: The High-Dimensional Data Clustering (HDDC) toolbox contains an efficient unsupervised classifier for high-dimensional data. This classifier is based on a mixture of Gaussian models adapted for [...]

Changes:

Initial Announcement on mloss.org.


Logo iBoost 0.1

by hiroto - December 1, 2007, 00:34:06 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4414 views, 1100 downloads, 0 subscriptions

About: Itemset boosting (iBoost) performs linear regression in the complete space of power sets of mutations. It implements a forward feature selection procedure where, in each iteration, one mutation [...]

Changes:

Initial Announcement on mloss.org.


Logo Local Alignment Kernels 0.3.2

by hiroto - December 1, 2007, 00:10:23 CET [ Project Homepage BibTeX Download ] 5282 views, 1239 downloads, 0 subscriptions

About: Local alignment kernels measure the similarity between two sequences by summing up scores obtained from local alignments with gaps of the sequences.

Changes:

Initial Announcement on mloss.org.


Logo boostree 0.1

by xavierc - December 1, 2007, 03:16:14 CET [ BibTeX Download ] 3834 views, 1322 downloads, 0 comments, 0 subscriptions

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.


Showing Items 501-510 of 537 on page 51 of 54: First Previous 46 47 48 49 50 51 52 53 54 Next