RSS Feed - BlogShowing Items 541-560 of 676 on page 28 of 34: First Previous 23 24 25 26 27 28 29 30 31 32 33 Next Last
About: The bufferkdtree package is a Python library that aims at accelerating nearest neighbor computations using both k-d trees and modern many-core devices such as graphics processing units (GPUs). Changes:Initial Announcement on mloss.org.
|
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.
|
About: Novel R toolbox for collaborative filtering recommender systems. Changes:Initial Announcement on mloss.org.
|
About: ReFr is a software architecture for specifying, training and using reranking models. Changes:Initial Announcement on mloss.org.
|
About: Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, clustering, random projections, random indexing, hashing, bit signatures Changes:Initial Announcement on mloss.org.
|
About: DDN learns and visualize differential dependency networks from condition-specific data. Changes:Initial Announcement on mloss.org.
|
About: Classification and Regression Training LSF Style: Augment some caret functions for parallel processing Changes:Initial Announcement on mloss.org.
|
About: A Deep Learning API and server Changes:Initial Announcement on mloss.org.
|
About: CURFIL uses NVIDIA CUDA to accelerate random forest training and prediction for RGB and RGB-D images. It focuses on image labelling tasks, such as image segmentation or classification applications. CURFIL allows to search for optimal hyper-parameter configurations (e.g. using the hyperopt) package) by massively decreasing training time. Changes:Initial Announcement on mloss.org.
|
|
About: The implementation of adaptive probabilistic mappings. Changes:Initial Announcement on mloss.org.
|
About: Motivated by a need to classify high-dimensional, heterogeneous data from the bioinformatics domain, we developed ML-Flex, a machine-learning toolbox that enables users to perform two-class and multi-class classification analyses in a systematic yet flexible manner. ML-Flex was written in Java but is capable of interfacing with third-party packages written in other programming languages. It can handle multiple input-data formats and supports a variety of customizations. MLFlex provides implementations of various validation strategies, which can be executed in parallel across multiple computing cores, processors, and nodes. Additionally, ML-Flex supports aggregating evidence across multiple algorithms and data sets via ensemble learning. (See http://jmlr.csail.mit.edu/papers/volume13/piccolo12a/piccolo12a.pdf.) Changes:Initial Announcement on mloss.org.
|
About: A Sortware for All Pairs Similarity Search Changes:Initial Announcement on mloss.org.
|
About: KEEL (Knowledge Extraction based on Evolutionary Learning) is an open source (GPLv3) Java software tool that can be used for a large number of different knowledge data discovery tasks. KEEL provides a simple GUI based on data flow to design experiments with different datasets and computational intelligence algorithms (paying special attention to evolutionary algorithms) in order to assess the behavior of the algorithms. It contains a wide variety of classical knowledge extraction algorithms, preprocessing techniques (training set selection, feature selection, discretization, imputation methods for missing values, among others), computational intelligence based learning algorithms, hybrid models, statistical methodologies for contrasting experiments and so forth. It allows to perform a complete analysis of new computational intelligence proposals in comparison to existing ones. Moreover, KEEL has been designed with a two-fold goal: research and educational. KEEL is also coupled with KEEL-dataset: a webpage that aims at providing to the machine learning researchers a set of benchmarks to analyze the behavior of the learning methods. Concretely, it is possible to find benchmarks already formatted in KEEL format for classification (such as standard, multi instance or imbalanced data), semi-supervised classification, regression, time series and unsupervised learning. Also, a set of low quality data benchmarks is maintained in the repository. Changes:Initial Announcement on mloss.org.
|
About: MALSS is a python module to facilitate machine learning tasks. Changes:Initial Announcement on mloss.org.
|
About: streamDM is a new open source data mining and machine learning library, designed on top of Spark Streaming, an extension of the core Spark API that enables scalable, high-throughput, fault-tolerant stream processing of data streams. Changes:Initial Announcement on mloss.org.
|
About: This is a class to calculate histogram of LBP (local binary patterns) from an input image, histograms of LBP-TOP (local binary patterns on three orthogonal planes) from an image sequence, histogram of the rotation invariant VLBP (volume local binary patterns) or uniform rotation invariant VLBP from an image sequence. Changes:Initial Announcement on mloss.org.
|
About: A Machine Learning framework for Objective-C and Swift (OS X / iOS) Changes:Initial Announcement on mloss.org.
|
About: Block-Coordinate Frank-Wolfe Optimization for Structural SVMs Changes:Initial Announcement on mloss.org.
|
About: Gaussian processes with general nonlinear likelihoods using the unscented transform or Taylor series linearisation. Changes:Initial Announcement on mloss.org.
|
About: SAMOA is a platform for mining big data streams. It is a distributed streaming machine learning (ML) framework that contains a programing abstraction for distributed streaming ML algorithms. Changes:Initial Announcement on mloss.org.
|