About: Supervised Latent Semantic Indexing(SLSI) is an supervised feature transformation method. The algorithms in this package are based on the iterative algorithm of Latent Semantic Indexing. Changes:Initial Announcement on mloss.org.

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: 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: Learns gradient boosted regression tree ensembles in parallel on shared memory or cluster systems Changes:Initial Announcement on mloss.org.

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: Fast RuntimeFlexible Multidimensional Arrays and Views for C++ Changes:Initial Announcement on mloss.org.

About: Software for graph similarity search for massive graph databases Changes:Initial Announcement on mloss.org.

About: A work in progress Changes:Initial Announcement on mloss.org.

About: OpenGM is a free C++ template library, a command line tool and a set of MATLAB functions for optimization in higher order graphical models. Graphical models of any order and structure can be built either in C++ or in MATLAB, using simple and intuitive commands. These models can be stored in HDF5 files and subjected to stateoftheart optimization algorithms via the OpenGM command line optimizer. All library functions can also be called directly from C++ code. OpenGM realizes the Inference Algorithm Interface (IAI), a concept that makes it easy for programmers to use their own algorithms and factor classes with OpenGM. 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: Moses is a statistical machine translation system that allows you to automatically train translation models for any language pair. All you need is a collection of translated texts (parallel corpus). An efficient search algorithm finds quickly the highest probability translation among the exponential number of choices. Changes:Initial Announcement on mloss.org.

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: A stochastic variant of the mirror descent algorithm employing Langford and Zhang's truncated gradient idea to minimize L1 regularized loss minimization problems for classification and regression. Changes:Fixed major bug in implementation. The components of the iterate where the current example vector is zero were not being updated correctly. Thanks to Jonathan Chang for pointing out the error to us.
