About: This database include 164 satellite iamges of different airports from google-earth, the first 110 images are used as training images, include 2337 aircrafts, the remained 54 images are used as test images, include 2206 aircrafts, each aircraft are labeled by two points and one number, indicating the positions of head and tail,and which point is the head. The labeled informations are recorded in two files: train.txt and test.txt, matlab is recommanded to be used for reading these data by import data tool. Changes:Initial Announcement on mloss.org.
|
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: Obandit is an Ocaml module for multi-armed bandits. It supports the EXP, UCB and Epsilon-greedy family of algorithms. 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: 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: Q. Dong, Two-dimensional relaxed representation, Neurocomputing, 121:248-253, 2013, http://dx.doi.org/10.1016/j.neucom.2013.04.044 Changes:Initial Announcement on mloss.org.
|
About: FsAlg is a linear algebra library that supports generic types. 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: Software for Automatic Construction and Inference of DBNs Based on Mathematical Models 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: "Ordinal Choquistic Regression" model using the maximum likelihood Changes:Initial Announcement on mloss.org.
|
About: This is a library for solving nu-SVM by using Wolfe's minimum norm point algorithm. You can solve binary classification problem. 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: 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: 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: 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: 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: This program implements a novel robust sparse representation method, called the two-stage sparse representation (TSR), for robust recognition on a large-scale database. Based on the divide and conquer strategy, TSR divides the procedure of robust recognition into outlier detection stage and recognition stage. The extensive numerical experiments on several public databases demonstrate that the proposed TSR approach generally obtains better classification accuracy than the state-of-the-art Sparse Representation Classification (SRC). At the same time, by using the TSR, a significant reduction of computational cost is reached by over fifty times in comparison with the SRC, which enables the TSR to be deployed more suitably for large-scale dataset. Changes:Initial Announcement on mloss.org.
|
About: Preparing Changes:Initial Announcement on mloss.org.
|
About: glyph is a python 3 library based on deap providing abstraction layers for symbolic regression problems. Changes:Initial Announcement on mloss.org.
|