All entries.
Showing Items 451-460 of 635 on page 46 of 64: First Previous 41 42 43 44 45 46 47 48 49 50 51 Next Last

Logo Naive Bayes EM Algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:35:09 CET [ Project Homepage BibTeX Download ] 4554 views, 959 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 ] 3286 views, 958 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.


Logo Uncorrelated Multilinear Principal Component Analysis 1.0

by hplu - June 18, 2012, 17:23:52 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4520 views, 957 downloads, 1 subscription

About: A Matlab implementation of Uncorrelated Multilinear PCA (UMPCA) for dimensionality reduction of tensor data via tensor-to-vector projection

Changes:

Initial Announcement on mloss.org.


Logo minFunc 2012

by markSchmidt - December 18, 2013, 01:07:07 CET [ Project Homepage BibTeX Download ] 5198 views, 952 downloads, 1 subscription

About: minFunc is a Matlab function for unconstrained optimization of differentiable real-valued multivariate functions using line-search methods. It uses an interface very similar to the Matlab Optimization Toolbox function fminunc, and can be called as a replacement for this function. On many problems, minFunc requires fewer function evaluations to converge than fminunc (or minimize.m). Further it can optimize problems with a much larger number of variables (fminunc is restricted to several thousand variables), and uses a line search that is robust to several common function pathologies.

Changes:

Initial Announcement on mloss.org.


Logo Semi Stochastic Gradient Descent 1.0

by konkey - July 9, 2014, 04:28:47 CET [ BibTeX BibTeX for corresponding Paper Download ] 3666 views, 945 downloads, 1 subscription

About: Efficient implementation of Semi-Stochastic Gradient Descent algorithm (S2GD) for training logistic regression (L2-regularized).

Changes:

Initial Announcement on mloss.org.


Logo Partition Comparison 1.0

by andres - April 21, 2012, 03:26:47 CET [ Project Homepage BibTeX Download ] 3278 views, 941 downloads, 1 subscription

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.


Logo gWT graph indexing wavelet tree 1.0.0

by ytabei - May 12, 2011, 23:01:17 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4814 views, 931 downloads, 1 subscription

About: Software for graph similarity search for massive graph databases

Changes:

Initial Announcement on mloss.org.


Logo fastICA 0.1

by maitra - February 28, 2013, 06:30:20 CET [ Project Homepage BibTeX Download ] 3994 views, 926 downloads, 1 subscription

About: The open-source C-package fastICA implements the fastICA algorithm of Aapo Hyvarinen et al. (URL: http://www.cs.helsinki.fi/u/ahyvarin/) to perform Independent Component Analysis (ICA) and Projection Pursuit. fastICA is released under the GNU Public License (GPL).

Changes:

Initial Announcement on mloss.org.


About: We study the problem of robust feature extraction based on L21 regularized correntropy in both theoretical and algorithmic manner. In theoretical part, we point out that an L21-norm minimization can be justified from the viewpoint of half-quadratic (HQ) optimization, which facilitates convergence study and algorithmic development. In particular, a general formulation is accordingly proposed to unify L1-norm and L21-norm minimization within a common framework. In algorithmic part, we propose an L21 regularized correntropy algorithm to extract informative features meanwhile to remove outliers from training data. A new alternate minimization algorithm is also developed to optimize the non-convex correntropy objective. In terms of face recognition, we apply the proposed method to obtain an appearance-based model, called Sparse-Fisherfaces. Extensive experiments show that our method can select robust and sparse features, and outperforms several state-of-the-art subspace methods on largescale and open face recognition datasets.

Changes:

Initial Announcement on mloss.org.


Logo SparklingGraph 0.0.6

by riomus - June 17, 2016, 14:49:46 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4500 views, 918 downloads, 3 subscriptions

About: Large scale, distributed graph processing made easy.

Changes:

Bug fixes, Graph generators


Showing Items 451-460 of 635 on page 46 of 64: First Previous 41 42 43 44 45 46 47 48 49 50 51 Next Last