All entries.
Showing Items 181-190 of 550 on page 19 of 55: First Previous 14 15 16 17 18 19 20 21 22 23 24 Next Last

Logo K tree 0.4.2

by cdevries - July 4, 2011, 06:01:59 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 6066 views, 1330 downloads, 1 subscription

About: The K-tree is a scalable approach to clustering inspired by the B+-tree and k-means algorithms.

Changes:

Release of K-tree implementation in Python. This is targeted at a research and rapid prototyping audience.


Logo multi assignment clustering of Boolean data 2.001

by mafrank - March 3, 2012, 09:04:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 6053 views, 804 downloads, 1 subscription

About: Implementation of the multi-assignment clustering method for Boolean vectors.

Changes:

new bib added


Logo r-cran-gbm 2.0-8

by r-cran-robot - January 17, 2013, 00:00:00 CET [ Project Homepage BibTeX Download ] 6039 views, 1169 downloads, 1 subscription

About: Generalized Boosted Regression Models

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:05.019963


Logo OpenCV, The Open Computer Vision Library 1.0

by bornet - April 24, 2008, 12:15:59 CET [ Project Homepage BibTeX Download ] 6038 views, 1618 downloads, 0 comments, 1 subscription

Rating Whole StarWhole StarWhole StarWhole StarEmpty Star
(based on 3 votes)

About: The Open Computer Vision Library is a collection of algorithms and sample code for various computer vision problems. The library is compatible with IPL and utilizes Intel Integrated Performance [...]

Changes:

Initial Announcement on mloss.org.


Logo Learning the Kernel Matrix 1

by chap - January 14, 2008, 08:50:37 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5989 views, 1300 downloads, 1 subscription

About: Code for automatically selecting the kernel parameters of an SVM. It is based on a gradient descent minimization of either the radius/margin bound, the leave-one-out error, a validation error or the [...]

Changes:

Initial Announcement on mloss.org.


Logo Finding nonlinear and stochastic structures in time series 1

by Dante - October 29, 2008, 11:14:44 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5980 views, 1180 downloads, 2 subscriptions

About: The Delay vector variance (DVV) method uses predictability of the signal in phase space to characterize the time series. Using the surrogate data methodology, so called DVV plots and DVV scatter [...]

Changes:

Initial Announcement on mloss.org.


Logo JMLR CAM Java 3.1

by wangny - October 14, 2013, 22:46:03 CET [ Project Homepage BibTeX Download ] 5977 views, 2744 downloads, 1 subscription

About: The CAM R-Java software provides a noval way to solve blind source separation problem.

Changes:

In this version, we fix the problem of not working under newest R version R-3.0.


About: RLLib is a lightweight C++ template library that implements incremental, standard, and gradient temporal-difference learning algorithms in Reinforcement Learning. It is an optimized library for robotic applications and embedded devices that operates under fast duty cycles (e.g., < 30 ms). RLLib has been tested and evaluated on RoboCup 3D soccer simulation agents, physical NAO V4 humanoid robots, and Tiva C series launchpad microcontrollers to predict, control, learn behaviors, and represent learnable knowledge. The implementation of the RLLib library is inspired by the RLPark API, which is a library of temporal-difference learning algorithms written in Java.

Changes:

Current release version is v2.0.


About: This local and parallel computation toolbox is the Octave and Matlab implementation of several localized Gaussian process regression methods: the domain decomposition method (Park et al., 2011, DDM), partial independent conditional (Snelson and Ghahramani, 2007, PIC), localized probabilistic regression (Urtasun and Darrell, 2008, LPR), and bagging for Gaussian process regression (Chen and Ren, 2009, BGP). Most of the localized regression methods can be applied for general machine learning problems although DDM is only applicable for spatial datasets. In addition, the GPLP provides two parallel computation versions of the domain decomposition method. The easiness of being parallelized is one of the advantages of the localized regression, and the two parallel implementations will provide a good guidance about how to materialize this advantage as software.

Changes:

Initial Announcement on mloss.org.


Logo Ngram Statistics Package 1.09

by tpederse - August 12, 2008, 18:21:52 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5816 views, 1263 downloads, 0 comments, 1 subscription

About: The Ngram Statistics Package is a suite of Perl modules that identifies significant multi-word units (collocations) in written text using many different tests of association. NSP allows a user to [...]

Changes:

Initial Announcement on mloss.org.


Showing Items 181-190 of 550 on page 19 of 55: First Previous 14 15 16 17 18 19 20 21 22 23 24 Next Last