About: This code is developed based on Uriel Roque's active set algorithm for the linear least squares problem with nonnegative variables in: Portugal, L.; Judice, J.; and Vicente, L. 1994. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208):625-643.Ran He, Wei-Shi Zheng and Baogang Hu, "Maximum Correntropy Criterion for Robust Face Recognition," IEEE TPAMI, in press, 2011. 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: FsAlg is a linear algebra library that supports generic types. Changes:Initial Announcement on mloss.org.
|
About: This is a implementation of the classic P3P(Perspective 3-Points) algorithm problem solution in the Ransac paper "M. A. Fischler, R. C. Bolles. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, Vol 24, pp 381-395, 1981.". The algorithm gives the four probable solutions of the P3P problem in about 0.1ms, and can be used as input of the consequent RANSAC step. The codes needs the numerics library VNL which is a part of the widely used computer vision library VXL. One can download & install it from http://vxl.sourceforge.net/. Changes:Initial Announcement on mloss.org.
|
About: Tool aimed at helping remedy the reproducibility problem, specifically in the statistical and data wrangling aspects. Changes:Initial Announcement on mloss.org.
|
About: DIANNE is a modular software framework for designing, training and evaluating artificial neural networks on heterogeneous, distributed infrastructure . It is built on top of OSGi and AIOLOS and can transparently deploy and redeploy (parts of) a neural network on multiple machines, as well as scale up training on a compute cluster. Changes:Initial Announcement on mloss.org.
|
About: A Theano framework for building and training neural networks Changes:Initial Announcement on mloss.org.
|
About: SALSA (Software lab for Advanced machine Learning with Stochastic Algorithms) is an implementation of the well-known stochastic algorithms for Machine Learning developed in the high-level technical computing language Julia. The SALSA software package is designed to address challenges in sparse linear modelling, linear and non-linear Support Vector Machines applied to large data samples with user-centric and user-friendly emphasis. Changes:Initial Announcement on mloss.org.
|
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: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23). Changes:Initial Announcement on mloss.org.
|
About: The auto-encoder based data clustering toolkit provides a quick start of clustering based on deep auto-encoder nets. This toolkit can cluster data in feature space with a deep nonlinear nets. Changes:Initial Announcement on mloss.org.
|
About: Jmlp is a java platform for both of the machine learning experiments and application. I have tested it on the window platform. But it should be applicable in the linux platform due to the cross-platform of Java language. It contains the classical classification algorithm (Discrete AdaBoost.MH, Real AdaBoost.MH, SVM, KNN, MCE,MLP,NB) and feature reduction(KPCA,PCA,Whiten) etc. 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 "quasi-dense propagation" algorithm to get "quasi-dense" point matches. 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: 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: a tool for marking samples in images for database building, also including algorithm of LBP,HOG,and classifiers of SVM (six kernels), adaboost,BP and convolutional networks, extreme learning machine. Changes:Initial Announcement on mloss.org.
|
About: Test submission. Is MLOSS working? Changes:Initial Announcement on mloss.org.
|
About: A Python based library for running experiments with Deep Learning and Ensembles on GPUs. Changes:Initial Announcement on mloss.org.
|
About: An open-source Python toolbox to analyze mobile phone metadata. Changes:Initial Announcement on mloss.org.
|