About: This program is used to extract SIFT points from an image. Changes:Initial Announcement on mloss.org.

About: LDPar is an efficient datadriven dependency parser. You can train your own parsing model on treebank data and parse new data using the induced model. Changes:Initial Announcement on mloss.org.

About: This program is used to extract HOG(histograms of oriented gradients) features from images. The integral histogram is used for fast histogram extraction. Both APIs and binary utility are provided. Changes:Initial Announcement on mloss.org.

About: This program is used to find point matches between two images. The procedure can be divided into two parts: 1) use SIFT matching algorithm to find sparse point matches between two images. 2) use "quasidense propagation" algorithm to get "quasidense" point matches. Changes:Initial Announcement on mloss.org.

About: Hofmann, T. 1999. Probabilistic latent semantic indexing. In Proceedings of the 22nd ACMSIGIR International Conference on Research and Development in Information Retrieval (Berkeley,Calif.), ACM, New York, 50–57. Changes:Initial Announcement on mloss.org.

About: MeanShift (MS) is a powerful nonparametric 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 AggloMS was developed, along with its modeseeking 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: Multicore/distributed large scale machine learning framework. Changes:Update version.

About: The SGD2.0 package contains implementations of the SGD and ASGD algorithms for linear SVMs and linear CRFs. Changes:Version 2.0 features ASGD.

About: FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It contains a collection of algorithms we found to work best for nearest neighbor search. Changes:See project page for changes.

About: GritBot is an data cleaning and outlier/anomaly detection program. Changes:Initial Announcement on mloss.org.

About: Cubist is the regression counterpart to the C5.0 decision tree tool. Changes:Initial Announcement on mloss.org.

About: C5.0 is the successor of the C4.5 decision tree algorithm/tool. In particular, it is faster and more memoryefficient. Changes:Initial Announcement on mloss.org.

About: A Sortware for All Pairs Similarity Search Changes:Initial Announcement on mloss.org.

About: OpenViBE is an opensource platform that enables to design, test and use BrainComputer Interfaces (BCI). Broadly speaking, OpenViBE can be used in many realtime Neuroscience applications [...] Changes:New release 0.8.0.

About: jblas is a fast linear algebra library for Java. jblas is based on BLAS and LAPACK, the defacto industry standard for matrix computations, and uses stateoftheart implementations like ATLAS for all its computational routines, making jBLAS very fast. Changes:Changes from 1.0:

About: redsvd is a library for solving several matrix decomposition (SVD, PCA, eigen value decomposition) redsvd can handle very large matrix efficiently, and optimized for a truncated SVD of sparse matrices. For example, redsvd can compute a truncated SVD with top 20 singular values for a 100K x 100K matrix with 10M nonzero entries in about two second. Changes:Initial Announcement on mloss.org.

About: The library implements Optimized Cutting Plane Algorithm (OCAS) for efficient training of linear SVM classifiers from largescale data. Changes:Implemented COFFIN framework which allows efficient training of invariant image classifiers via virtual examples.

About: HSSVM is a software for solving multiclass problem using Hypersphere Support Vector Machines model, implemented by Java. Changes:
