RSS Feed - Blog
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: 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: This program is used to extract SIFT points from an image. Changes:Initial Announcement on mloss.org.
|
About: Regularization paTH for LASSO problem (thalasso) thalasso solves problems of the following form: minimize 1/2||X*beta-y||^2 + lambda*sum|beta_i|, where X and y are problem data and beta and lambda are variables. Changes:Initial Announcement on mloss.org.
|
About: Inference algorithms for models based on Luce's choice axiom. Changes:Initial Announcement on mloss.org.
|
About: Metropolis-Hastings alogrithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult. Thi sequence can be used to approximate the distribution. 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: Bayesian Model Averaging for linear models with a wide choice of (customizable) priors. Built-in priorss include coefficient priors (fixed, flexible and hyper-g priors), 5 kinds of model priors, moreover model sampling by enumeration or various MCMC approaches. Changes:Initial Announcement on mloss.org.
|
|
About: Test submission. Is MLOSS working? 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: DataDeps is a package for simplifying the management of data in your julia application. In particular it is designed to make getting static data from some server into the local machine, and making programs know where that data is trivial. 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: It's a C++ program for symmetric matrix diagonalization, inversion and principal component anlaysis(PCA). The matrix diagonalization function can also be applied to the computation of singular value decomposition (SVD), Fisher linear discriminant analysis (FLDA) and kernel PCA (KPCA) if forming the symmetric matrix appropriately. 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: 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: testing mloss.org Changes:Initial Announcement on mloss.org.
|
About: Presage is an intelligent predictive text entry platform. Changes:Initial Announcement on mloss.org.
|
About: This MATLAB package provides the MLAPG algorithm proposed in our ICCV 2015 paper. It is efficient for PSD constrained metric learning, and also effective for person re-identification. For more details, please visit http://www.cbsr.ia.ac.cn/users/scliao/projects/mlapg/. Changes:Initial Announcement on mloss.org.
|