All entries.
Showing Items 441-450 of 620 on page 45 of 62: First Previous 40 41 42 43 44 45 46 47 48 49 50 Next Last

Logo WebEnsemble 1.0

by jungc005 - May 8, 2012, 22:24:44 CET [ BibTeX Download ] 2218 views, 848 downloads, 1 subscription

About: Use the power of crowdsourcing to create ensembles.

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 ] 4238 views, 839 downloads, 1 subscription

About: Software for graph similarity search for massive graph databases

Changes:

Initial Announcement on mloss.org.


Logo r-cran-quantregForest 0.2-3

by r-cran-robot - June 1, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 3607 views, 828 downloads, 0 subscriptions

About: Quantile Regression Forests

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:07.576421


Logo r-cran-penalizedSVM 1.1

by r-cran-robot - August 2, 2010, 00:00:00 CET [ Project Homepage BibTeX Download ] 3890 views, 827 downloads, 0 subscriptions

About: Feature Selection SVM using penalty functions

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:07.509844


About: Fast Multidimensional GP Inference using Projected Additive Approximation

Changes:

Initial Announcement on mloss.org.


About: This letter proposes a new multiple linear regression model using regularized correntropy for robust pattern recognition. First, we motivate the use of correntropy to improve the robustness of the classicalmean square error (MSE) criterion that is sensitive to outliers. Then an l1 regularization scheme is imposed on the correntropy to learn robust and sparse representations. Based on the half-quadratic optimization technique, we propose a novel algorithm to solve the nonlinear optimization problem. Second, we develop a new correntropy-based classifier based on the learned regularization scheme for robust object recognition. Extensive experiments over several applications confirm that the correntropy-based l1 regularization can improve recognition accuracy and receiver operator characteristic curves under noise corruption and occlusion.

Changes:

Initial Announcement on mloss.org.


Logo SketchSort 0.0.6

by ytabei - October 11, 2010, 18:33:21 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4577 views, 815 downloads, 1 subscription

About: A Sortware for All Pairs Similarity Search

Changes:

Initial Announcement on mloss.org.


Logo GPgrid toolkit for fast GP analysis on grid input 0.1

by ejg20 - September 16, 2013, 18:01:16 CET [ BibTeX Download ] 2144 views, 812 downloads, 1 subscription

About: GPgrid toolkit for fast GP analysis on grid input

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 ] 3794 views, 812 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.


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.


Showing Items 441-450 of 620 on page 45 of 62: First Previous 40 41 42 43 44 45 46 47 48 49 50 Next Last