All entries.
Showing Items 101-110 of 565 on page 11 of 57: First Previous 6 7 8 9 10 11 12 13 14 15 16 Next Last

Logo DRVQ 1.0.1-beta

by iavr - January 18, 2014, 17:26:34 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 1332 views, 355 downloads, 1 subscription

About: DRVQ is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast.

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 ] 5585 views, 1391 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 EANT Without Structural Optimization 1.0

by yk - September 28, 2009, 12:34:38 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4610 views, 1637 downloads, 1 subscription

About: EANT Without Structural Optimization is used to learn a policy in either complete or partially observable reinforcement learning domains of continuous state and action space.

Changes:

Initial Announcement on mloss.org.


Logo Easysvm 0.3

by gxr - June 25, 2009, 18:33:04 CET [ Project Homepage BibTeX Download ] 8405 views, 1614 downloads, 1 subscription

About: The Easysvm package provides a set of tools based on the Shogun toolbox allowing to train and test SVMs in a simple way.

Changes:

Fixes for shogun 0.7.3.


Logo Eblearn pre-release

by cpoulet - October 10, 2008, 22:20:23 CET [ Project Homepage BibTeX Download ] 4293 views, 1027 downloads, 0 comments, 1 subscription

About: Eblearn is an object-oriented C++ library that implements various

Changes:

Initial Announcement on mloss.org.


Logo Efficient Nonnegative Sparse Coding Algorithm 1.0

by openpr_nlpr - January 4, 2012, 09:44:18 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2325 views, 488 downloads, 1 subscription

About: Nonnegative Sparse Coding, Discriminative Semi-supervised Learning, sparse probability graph

Changes:

Initial Announcement on mloss.org.


Logo Elefant 0.4

by kishorg - October 17, 2009, 08:48:19 CET [ Project Homepage BibTeX Download ] 17851 views, 7599 downloads, 2 subscriptions

Rating Whole StarWhole Star1/2 StarEmpty StarEmpty Star
(based on 2 votes)

About: Elefant is an open source software platform for the Machine Learning community licensed under the Mozilla Public License (MPL) and developed using Python, C, and C++. We aim to make it the platform [...]

Changes:

This release contains the Stream module as a first step in the direction of providing C++ library support. Stream aims to be a software framework for the implementation of large scale online learning algorithms. Large scale, in this context, should be understood as something that does not fit in the memory of a standard desktop computer.

Added Bundle Methods for Regularized Risk Minimization (BMRM) allowing to choose from a list of loss functions and solvers (linear and quadratic).

Added the following loss classes: BinaryClassificationLoss, HingeLoss, SquaredHingeLoss, ExponentialLoss, LogisticLoss, NoveltyLoss, LeastMeanSquareLoss, LeastAbsoluteDeviationLoss, QuantileRegressionLoss, EpsilonInsensitiveLoss, HuberRobustLoss, PoissonRegressionLoss, MultiClassLoss, WinnerTakesAllMultiClassLoss, ScaledSoftMarginMultiClassLoss, SoftmaxMultiClassLoss, MultivariateRegressionLoss

Graphical User Interface provides now extensive documentation for each component explaining state variables and port descriptions.

Changed saving and loading of experiments to XML (thereby avoiding storage of large input data structures).

Unified automatic input checking via new static typing extending Python properties.

Full support for recursive composition of larger components containing arbitrary statically typed state variables.


Logo ELF Ensemble Learning Framework 0.1

by mjahrer - May 10, 2010, 23:54:53 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5179 views, 869 downloads, 1 subscription

About: ELF provides many well implemented supervised learners for classification and regression tasks with an opportunity of ensemble learning.

Changes:

Initial Announcement on mloss.org.


Logo ELKI 0.6.0

by erich - January 10, 2014, 18:32:28 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 11747 views, 2114 downloads, 3 subscriptions

About: ELKI is a framework for implementing data-mining algorithms with support for index structures, that includes a wide variety of clustering and outlier detection methods.

Changes:

Additions and Improvements from ELKI 0.5.5:

Algorithms

Clustering:

  • Hierarchical Clustering - the slower naive variants were added, and the code was refactored
  • Partition extraction from hierarchical clusterings - different linkage strategies (e.g. Ward)
  • Canopy pre-Clustering
  • Naive Mean-Shift Clustering
  • Affinity propagation clustering (both with distances and similarities / kernel functions)
  • K-means variations: Best-of-multiple-runs, bisecting k-means
  • New k-means initialization: farthest points, sample initialization
  • Cheng and Church Biclustering
  • P3C Subspace Clustering
  • One-dimensional clustering algorithm based on kernel density estimation

Outlier detection

  • COP - correlation outlier probabilities
  • LDF - a kernel density based LOF variant
  • Simplified LOF - a simpler version of LOF (not using reachability distance)
  • Simple Kernel Density LOF - a simple LOF using kernel density (more consistent than LDF)
  • Simple outlier ensemble algorithm
  • PINN - projection indexed nearest neighbors, via projected indexes.
  • ODIN - kNN graph based outlier detection
  • DWOF - Dynamic-Window Outlier Factor (contributed by Omar Yousry)
  • ABOD refactored, into ABOD, FastABOD and LBABOD

Distances

  • Geodetic distances now support different world models (WGS84 etc.) and are subtantially faster.
  • Levenshtein distances for processing strings, e.g. for analyzing phonemes (contributed code, see "Word segmentation through cross-lingual word-to-phoneme alignment", SLT2013, Stahlberg et al.)
  • Bray-Curtis, Clark, Kulczynski1 and Lorentzian distances with R-tree indexing support
  • Histogram matching distances
  • Probabilistic divergence distances (Jeffrey, Jensen-Shannon, Chi2, Kullback-Leibler)
  • Kulczynski2 similarity
  • Kernel similarity code has been refactored, and additional kernel functions have been added

Database Layer and Data Types

Projection layer * Parser for simple textual data (for use with Levenshtein distance) Various random projection families (including Feature Bagging, Achlioptas, and p-stable) Latitude+Longitude to ECEF Sparse vector improvements and bug fixes New filter: remove NaN values and missing values New filter: add histogram-based jitter New filter: normalize using statistical distributions New filter: robust standardization using Median and MAD New filter: Linear discriminant analysis (LDA)

Index Layer

  • Another speed up in R-trees
  • Refactoring of M- and R-trees: Support for different strategies in M-tree New strategies for M-tree splits Speedups in M-tree
  • New index structure: in-memory k-d-tree
  • New index structure: in-memory Locality Sensitive Hashing (LSH)
  • New index structure: approximate projected indexes, such as PINN
  • Index support for geodetic data - (Details: Geodetic Distance Queries on R-Trees for Indexing Geographic Data, SSTD13)
  • Sampled k nearest neighbors: reference KDD13 "Subsampling for Efficient and Effective Unsupervised Outlier Detection Ensembles"
  • Cached (precomputed) k-nearest neighbors to share across multiple runs
  • Benchmarking "algorithms" for indexes

Mathematics and Statistics

  • Many new distributions have been added, now 28 different distributions are supported
  • Additional estimation methods (using advanced statistics such as L-Moments), now 44 estimators are available
  • Trimming and Winsorizing
  • Automatic best-fit distribution estimation
  • Preprocessor using these distributions for rescaling data sets
  • API changes related to the new distributions support
  • More kernel density functions
  • RANSAC covariance matrix builder (unfortunately rather slow)

Visualization

  • 3D projected coordinates (Details: Interactive Data Mining with 3D-Parallel-Coordinate-Trees, SIGMOD2013)
  • Convex hulls now also include nested hierarchical clusters

Other

  • Parser speedups
  • Sparse vector bug fixes and improvements
  • Various bug fixes
  • PCA, MDS and LDA filters
  • Text output was slightly improved (but still needs to be redesigned from scratch - please contribute!)
  • Refactoring of hierarchy classes
  • New heap classes and infrastructure enhancements
  • Classes can have aliases, e.g. "l2" for euclidean distance.
  • Some error messages were made more informative.
  • Benchmarking classes, also for approximate nearest neighbor search.

Logo Encog Machine Learning Framework 3.2

by jeffheaton - July 5, 2014, 23:47:06 CET [ Project Homepage BibTeX Download ] 3447 views, 828 downloads, 1 subscription

About: Encog is a Machine Learning framework for Java, C#, Javascript and C/C++ that supports SVM's, Genetic Programming, Bayesian Networks, Hidden Markov Models and other algorithms.

Changes:

Changes for Encog 3.2:

Issue #53: Fix Out Of Range Bug In BasicMLSequenceSet. Issue #52: Unhandled exception in Encog.Util.File.ResourceLoader.CreateStream (ResourceLoader.cs) Issue #50: Concurrency bugs in PruneIncremental Issue #48: Unit Tests Failing - TestHessian Issue #46: Couple of small fixes - Temporal DataSet and SCG training Issue #45: Fixed EndMinutesStrategy to correctly evaluate ShouldStop after the specified number of minutes have elapsed. Issue #44: Encog.ML.Data.Basic.BasicMLDataPairCentroid.Add() & .Remove() Issue #43: Unit Tests Failing - Matrix not full rank Issue #42: Nuget - NuSpec Issue #36: Load Examples easier


Showing Items 101-110 of 565 on page 11 of 57: First Previous 6 7 8 9 10 11 12 13 14 15 16 Next Last