Showing 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: 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: ReFr is a software architecture for specifying, training and using reranking models. 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: 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: Bayesian Logic (BLOG) is a probabilistic modeling language. It is designed for representing relations and uncertainties among real world objects. 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: A Deep Learning API and server Changes:Initial Announcement on mloss.org.
|
About: Block-Coordinate Frank-Wolfe Optimization for Structural SVMs Changes:Initial Announcement on mloss.org.
|
About: Software for graph similarity search for massive graph databases Changes:Initial Announcement on mloss.org.
|
About: This program is a C++ implementation of Naive Bayes Classifier, which is a well-known generative classification algorithm for the application such as text classification. The Naive Bayes algorithm requires the probabilistic distribution to be discrete. The program uses the multinomial event model for representation, the maximum likelihood estimate with a Laplace smoothing technique for learning parameters. A sparse-data structure is defined to represent the feature vector in the program to seek higher computational speed. Changes:Initial Announcement on mloss.org.
|
About: AIDE (Automata Identification Engine) is a free open source tool for automata inference algorithms developed in C# .Net. Changes:Initial Announcement on mloss.org.
|
About: ALgebraic COmbinatorial COmpletion of MAtrices. A collection of algorithms to impute or denoise single entries in an incomplete rank one matrix, to determine for which entries this is possible with any algorithm, and to provide algorithm-independent error estimates. Includes demo scripts. Changes:Initial Announcement on mloss.org.
|
About: The implementation of adaptive probabilistic mappings. Changes:Initial Announcement on mloss.org.
|
About: MA-sLDAr is a C++ implementation of the supervised topic models with response variables provided by multiple annotators with different levels of expertise. 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: Survival forests: Random Forests variant for survival analysis. Original implementation by Leo Breiman. Changes:Initial Announcement on mloss.org.
|
About: Novel R toolbox for collaborative filtering recommender systems. Changes:Initial Announcement on mloss.org.
|
About: The package computes the optimal parameters for the Choquet kernel Changes:Initial Announcement on mloss.org.
|
About: An implementation of MROGH descriptor. For more information, please refer to: “Bin Fan, Fuchao Wu and Zhanyi Hu, Aggregating Gradient Distributions into Intensity Orders: A Novel Local Image Descriptor, CVPR 2011, pp.2377-2384.” The most up-to-date information can be found at : http://vision.ia.ac.cn/Students/bfan/index.htm Changes:Initial Announcement on mloss.org.
|