About: Multicore/distributed large scale machine learning framework.

Update version.

About: GritBot is an data cleaning and outlier/anomaly detection program.

Initial Announcement on mloss.org.

About: Software for graph similarity search for massive graph databases

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.

Initial Announcement on mloss.org.

About: hapFabia is an R package for identification of very short segments of identity by descent (IBD) characterized by rare variants in large sequencing data. It detects 100 times smaller segments than previous methods.

o citation update

o plot function improved

About: A Tool for Measuring String Similarity

Initial Announcement on mloss.org.

About: Non-parametric topic models (HDP-LDA, DCMLDA, and other variants of LDA) implemented in C using efficient Gibbs sampling, with hyperparameter sampling and other flexible controls.

Added example on using burstiness.

About: This library provides Python functions for agglomerative clustering. Its features include

Initial Announcement on mloss.org.

About: HDDM is a python toolbox for hierarchical Bayesian parameter estimation of the Drift Diffusion Model (via PyMC). Drift Diffusion Models are used widely in psychology and cognitive neuroscience to study decision making.

• New and improved HDDM model with the following changes:
  • Priors: by default model will use informative priors (see http://ski.clps.brown.edu/hddm_docs/methods.html#hierarchical-drift-diffusion-models-used-in-hddm) If you want uninformative priors, set informative=False.
  • Sampling: This model uses slice sampling which leads to faster convergence while being slower to generate an individual sample. In our experiments, burnin of 20 is often good enough.
  • Inter-trial variablity parameters are only estimated at the group level, not for individual subjects.
  • The old model has been renamed to HDDMTransformed.
  • HDDMRegression and HDDMStimCoding are also using this model.
• HDDMRegression takes patsy model specification strings. See http://ski.clps.brown.edu/hddm_docs/howto.html#estimate-a-regression-model and http://ski.clps.brown.edu/hddm_docs/tutorial_regression_stimcoding.html#chap-tutorial-hddm-regression
• Improved online documentation at http://ski.clps.brown.edu/hddm_docs
• A new HDDM demo at http://ski.clps.brown.edu/hddm_docs/demo.html
• Ratcliff's quantile optimization method for single subjects and groups using the .optimize() method
• Maximum likelihood optimization.
• Many bugfixes and better test coverage.
• hddm_fit.py command line utility is depracated.

About: This software is an implementation of Hidden Markov Support Vector Machines (HMSVMs).

Initial Announcement on mloss.org.