RSS Feed - Blog
About: A novel method to create parallel coordinates plots on large data sets without causing a "black screen" problem. 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: Soltion developed by team Turtle Tamers in the ChaLearn Gesture Challenge (http://www.kaggle.com/c/GestureChallenge2) Changes:Initial Announcement on mloss.org.
|
About: A simple and clear OpenCV based extended Kalman filter(EKF) abstract class implementation,absolutely following standard EKF equations. Special thanks to the open source project of KFilter1.3. It is easy to inherit it to implement a variable state and measurement EKF for computer vision and INS usages. Changes:Initial Announcement on mloss.org.
|
About: Regression forests, Random Forests for regression. Original implementation by Leo Breiman. Changes:Initial Announcement on mloss.org.
|
About: The bufferkdtree package is a Python library that aims at accelerating nearest neighbor computations using both k-d trees and modern many-core devices such as graphics processing units (GPUs). Changes:Initial Announcement on mloss.org.
|
About: RLScore - regularized least-squares machine learning algorithms package Changes:Initial Announcement on mloss.org.
|
About: Recur is a collection of Gstreamer plugins and language modelling tools based on recurrent neural networks. 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: MALSS is a python module to facilitate machine learning tasks. Changes:Initial Announcement on mloss.org.
|
About: R package implementing statistical test and post hoc tests to compare multiple algorithms in multiple problems. Changes:Initial Announcement on mloss.org.
|
About: The Java package jLDADMM is released to provide alternative choices for topic modeling on normal or short texts. It provides implementations of the Latent Dirichlet Allocation topic model and the one-topic-per-document Dirichlet Multinomial Mixture model (i.e. mixture of unigrams), using collapsed Gibbs sampling. In addition, jLDADMM supplies a document clustering evaluation to compare topic models. Changes:Initial Announcement on mloss.org.
|
About: It is a Scala library for building Bayesian Networks with discrete/continuous variables and running deterministic Bayesian inference 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: Java package for calculating Entropy for Machine Learning Applications. It has implemented several methods of handling missing values. So it can be used as a lab for examining missing values. Changes:Discretizing numerical values is added to calculate mode of values and fractional replacement of missing ones. class diagram is on the web http://profs.basu.ac.ir/bathaeian/free_space/jemla.rar
|
About: MIPS is a software library for state-of-the-art graph mining algorithms. The library is platform independent, written in C++(03), and aims at implementing generic and efficient graph mining algorithms. Changes:description update
|
About: The toolbox from the paper Near-optimal Experimental Design for Model Selection in Systems Biology (Busetto et al. 2013, submitted) implemented in MATLAB. Changes:Initial Announcement on mloss.org.
|
About: Novel R toolbox for collaborative filtering recommender systems. Changes:Initial Announcement on mloss.org.
|
About: A library for calculating and accessing generalized Stirling numbers of the second kind, which are used for inference in Poisson-Dirichlet processes. Changes:Initial Announcement on mloss.org.
|
About: Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explore their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the L1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings. Changes:Initial Announcement on mloss.org.
|