About: Oboe is a software for Chinese syntactic parsing, and it can display syntactic trees in a graphical view with two kinds of representation: phrase tree and dependency tree. So it is very helpful for NLP researchers, especially for researchers focusing on syntax-based methods. Changes:Initial Announcement on mloss.org.
|
About: A desktop planetarium and sky map program which shows the sky from anywhere on Earth at any time. Changes:Removed erroneous topocentric code. Increased maximum zoom for detail on planets.
|
About: ALgebraic COmbinatorial COmpletion of MAtrices. A collection of algorithms to impute or denoise single entries in an incomplete rank one matrix, to determine for which entries this is possible with any algorithm, and to provide algorithm-independent error estimates. Includes demo scripts. Changes:Initial Announcement on mloss.org.
|
About: We introduces PLL, a parallel LDA learning toolbox for big topic modeling. Changes:Fix some compiling errors.
|
About: Low-Rank and Sparse tools for Background Modeling and Subtraction in Videos. 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: A general purpose library to process and predict sequences of elements using echo state networks. Changes:Initial Announcement on mloss.org.
|
About: Text-to-Speech (TTS) is a kind of speech processing technology that converts text into speech. It involves phonetics, linguistics, digital signal processing technology, computer technology, multimedia technology, and other technologies. It is a frontier technology in Chinese information processing field. With TTS technology, any text used to be read by eyes can also be listened by ears. Changes:Initial Announcement on mloss.org.
|
About: MLPlot is a lightweight plotting library written in Java. Changes:Initial Announcement on mloss.org.
|
About: Fast C++ implementation of the variation of information (Meila 2003) and Rand index (Rand 1971) with MATLAB mex files Changes:Initial Announcement on mloss.org.
|
About: In this paper, we propose an improved principal component analysis based on maximum entropy (MaxEnt) preservation, called MaxEnt-PCA, which is derived from a Parzen window estimation of Renyi’s quadratic entropy. Instead of minimizing the reconstruction error either based on L2-norm or L1-norm, the MaxEnt-PCA attempts to preserve as much as possible the uncertainty information of the data measured by entropy. The optimal solution of MaxEnt-PCA consists of the eigenvectors of a Laplacian probability matrix corresponding to the MaxEnt distribution. MaxEnt-PCA (1) is rotation invariant, (2) is free from any distribution assumption, and (3) is robust to outliers. Extensive experiments on real-world datasets demonstrate the effectiveness of the proposed linear method as compared to other related robust PCA methods. 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: Survival forests: Random Forests variant for survival analysis. Original implementation by Leo Breiman. Changes:Initial Announcement on mloss.org.
|
About: The new R package opusminer provides an R interface to the OPUS Miner algorithm (implemented in C++) for finding the key associations in transaction data efficiently, in the form of self-sufficient itemsets, using either leverage or lift. Changes:Initial Announcement on mloss.org.
|
About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity. Changes:Initial Announcement on mloss.org.
|
About: HierLearning is a C++11 implementation of a general-purpose, multi-agent, hierarchical reinforcement learning system for sequential decision problems. Changes:Initial Announcement on mloss.org.
|
About: Local high-order regularization for semi-supervised learning Changes:Initial Announcement on mloss.org.
|
About: Learning Discrete Bayesian Network Classifiers from Data Changes:Fetched by r-cran-robot on 2016-05-01 00:00:04.546512
|