RSS Feed - Blog
About: Hofmann, T. 1999. Probabilistic latent semantic indexing. In Proceedings of the 22nd ACM-SIGIR International Conference on Research and Development in Information Retrieval (Berkeley,Calif.), ACM, New York, 50–57. Changes:Initial Announcement on mloss.org.
|
About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity. Changes:Initial Announcement on mloss.org.
|
About: The toolbox is to calculate normalized information measures from a given m by (m+1) confusion matrix for objective evaluations of an abstaining classifier. It includes total 24 normalized information measures based on three groups of definitions, that is, mutual information, information divergence, and cross entropy. Changes:Initial Announcement on mloss.org.
|
About: Scilab Pattern Recognition Toolbox is a toolbox developed for Scilab software, and is used in pattern recognition, machine learning and the related field. It is developed for the purpose of education and research. Changes:Initial Announcement on mloss.org.
|
About: Learns gradient boosted regression tree ensembles in parallel on shared memory or cluster systems Changes:Initial Announcement on mloss.org.
|
|
About: Pyriel is a Python system for learning classification rules from data. Unlike other rule learning systems, it is designed to learn rule lists that maximize the area under the ROC curve (AUC) instead of accuracy. Pyriel is mostly an experimental research tool, but it's robust and fast enough to be used for lightweight industrial data mining. Changes:1.5 Changed CF (confidence factor) to do LaPlace smoothing of estimates. New flag "--score-for-class C" causes scores to be computed relative to a given (positive) class. For two-class problems. Fixed bug in example sampling code (--sample n) Fixed bug keeping old-style example formats (terminated by dot) from working. More code restructuring.
|
About: jblas is a fast linear algebra library for Java. jblas is based on BLAS and LAPACK, the de-facto industry standard for matrix computations, and uses state-of-the-art implementations like ATLAS for all its computational routines, making jBLAS very fast. Changes:Changes from 1.0:
|
About: Toolbox for circular statistics with Matlab (The Mathworks). Changes:Some bugfixes.
|
About: This toolbox provides functions for maximizing and minimizing submodular set functions, with applications to Bayesian experimental design, inference in Markov Random Fields, clustering and others. Changes:
|
About: PyBrain is a versatile machine learning library for Python. Its goal is to provide flexible, easy-to-use yet still powerful algorithms for machine learning tasks, including a variety of predefined [...] Changes:
|
About: Ohmm is a library for learning hidden Markov models by using Online EM algorithm. This library is specialized for large scale data; e.g. 1 million words. The output includes parameters, and estimation results. Changes:Initial Announcement on mloss.org.
|
About: CRF++ is a simple, customizable, and open source implementation of Conditional Random Fields (CRFs) for segmenting/labeling sequential data. Changes:Initial Announcement on mloss.org.
|
About: Matlab code for performing variational inference in the Indian Buffet Process with a linear-Gaussian likelihood model. Changes:Initial Announcement on mloss.org.
|
About: The goal of this project is to provide code for reading and writing machine learning data sets for as many programming languages as possible. Changes:Forgot to include the Java sources.
|
About: This package contains an implementation of the Infinite Kernel Learning (IKL) algorithm and the SimpleMKL algorithm. This is realized by building on Coin-Ipopt-3.3.5 and Libsvm. Changes:Initial Announcement on mloss.org.
|
|
About: Torch5 provides a matlab-like environment for state-of-the-art machine learning algorithms. It is easy to use and provides a very efficient implementation, thanks to a easy and fast scripting [...] Changes:Initial Announcement on mloss.org.
|
About: MinorThird is a collection of Java classes for storing text, annotating text, and learning to extract entities and categorize text. It was written primarily by William W. Cohen, a professor at [...] Changes:Initial Announcement on mloss.org.
|
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. |