All entries.
Showing Items 401-410 of 535 on page 41 of 54: First Previous 36 37 38 39 40 41 42 43 44 45 46 Next Last

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 Local Binary Pattern 1.0.0

by openpr_nlpr - December 2, 2011, 05:33:44 CET [ Project Homepage BibTeX Download ] 1355 views, 430 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 Agglomerative MeanShift Clustering 1.0.0

by openpr_nlpr - December 2, 2011, 04:38:13 CET [ Project Homepage BibTeX Download ] 1372 views, 429 downloads, 1 subscription

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.


Logo PLEASD 0.1

by heroesneverdie - September 10, 2012, 03:53:26 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 1821 views, 425 downloads, 1 subscription

About: PLEASD: A Matlab Toolbox for Structured Learning

Changes:

Initial Announcement on mloss.org.


Logo Hivemall 0.1

by myui - October 25, 2013, 08:43:12 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2658 views, 423 downloads, 1 subscription

About: Hivemall is a scalable machine learning library running on Hive/Hadoop, licensed under the LGPL 2.1.

Changes:
  • Enhancement

    • Added AROW regression
    • Added AROW with a hinge loss (arowh_regress())
  • Bugfix

    • Fixed a bug of null feature handling in classification/regression

Logo MLPlot Beta

by pascal - August 22, 2011, 11:07:53 CET [ Project Homepage BibTeX Download ] 2104 views, 421 downloads, 1 subscription

About: MLPlot is a lightweight plotting library written in Java.

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 ] 2086 views, 417 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 Random Forests 5.1

by zenog - September 21, 2011, 14:14:17 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2360 views, 416 downloads, 1 subscription

About: The original Random Forests implementation by Breiman and Cutler.

Changes:

Initial Announcement on mloss.org.


Logo KNIME 2.7.4

by toldo - April 29, 2013, 09:14:39 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2109 views, 412 downloads, 1 subscription

About: A comprehensive data mining environment, with a variety of machine learning components.

Changes:

Modifications following feedback from Knime main Author.


About: Toeblitz is a MATLAB/Octave package for operations on positive definite Toeplitz matrices. It can solve Toeplitz systems Tx = b in O(n*log(n)) time and O(n) memory, compute matrix inverses T^(-1) (with free log determinant) in O(n^2) time and memory, compute log determinants (without inverses) in O(n^2) time and O(n) memory, and compute traces of products A*T for any matrix A, in minimal O(n^2) time and memory.

Changes:

Adding tar directly instead of via link


Showing Items 401-410 of 535 on page 41 of 54: First Previous 36 37 38 39 40 41 42 43 44 45 46 Next Last