All entries.
Showing Items 311-320 of 537 on page 32 of 54: First Previous 27 28 29 30 31 32 33 34 35 36 37 Next Last

Logo Efficient Nonnegative Sparse Coding Algorithm 1.0

by openpr_nlpr - January 4, 2012, 09:44:18 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2011 views, 427 downloads, 1 subscription

About: Nonnegative Sparse Coding, Discriminative Semi-supervised Learning, sparse probability graph

Changes:

Initial Announcement on mloss.org.


Logo Kernel Machine Library 0.2

by pawelm - December 27, 2011, 17:14:01 CET [ Project Homepage BibTeX BibTeX for corresponding Paper ] 3303 views, 127 downloads, 1 subscription

About: The Kernel-Machine Library is a free (released under the LGPL) C++ library to promote the use of and progress of kernel machines.

Changes:

Updated mloss entry (minor fixes).


Logo r-cran-tgp 2.4-3

by r-cran-robot - December 18, 2011, 00:00:00 CET [ Project Homepage BibTeX Download ] 11164 views, 2299 downloads, 1 subscription

About: Bayesian treed Gaussian process models

Changes:

Fetched by r-cran-robot on 2012-02-01 00:00:11.834310


Logo Rudder 0.1

by dmcnelis - December 16, 2011, 22:00:45 CET [ Project Homepage BibTeX Download ] 3414 views, 1102 downloads, 1 subscription

About: An annotated java framework for machine learning, aimed at making it really easy to access analytically functions.

Changes:

Now supports OLS and GLS regression and NaiveBayes classification


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.


Logo Metropolis Hastings algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:43:20 CET [ Project Homepage BibTeX Download ] 1354 views, 346 downloads, 1 subscription

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 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.


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 1393 views, 369 downloads, 1 subscription

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.


Logo Naive Bayes EM Algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:35:09 CET [ Project Homepage BibTeX Download ] 2209 views, 491 downloads, 1 subscription

About: OpenPR-NBEM is an C++ implementation of Naive Bayes Classifier, which is a well-known generative classification algorithm for the application such as text classification. The Naive Bayes algorithm requires the probabilistic distribution to be discrete. OpenPR-NBEM uses the multinomial event model for representation. The maximum likelihood estimate is used for supervised learning, and the expectation-maximization estimate is used for semi-supervised and un-supervised learning.

Changes:

Initial Announcement on mloss.org.


Logo Local Binary Pattern 1.0.0

by openpr_nlpr - December 2, 2011, 05:33:44 CET [ Project Homepage BibTeX Download ] 1466 views, 472 downloads, 1 subscription

About: This is a class to calculate histogram of LBP (local binary patterns) from an input image, histograms of LBP-TOP (local binary patterns on three orthogonal planes) from an image sequence, histogram of the rotation invariant VLBP (volume local binary patterns) or uniform rotation invariant VLBP from an image sequence.

Changes:

Initial Announcement on mloss.org.


Showing Items 311-320 of 537 on page 32 of 54: First Previous 27 28 29 30 31 32 33 34 35 36 37 Next Last