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

Logo Intelligent Parameter Utilization Tool 0.4

by feldob - April 28, 2013, 18:05:45 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3816 views, 980 downloads, 1 subscription

About: A descriptive and programming language independent format and API for the simplified configuration, documentation, and design of computer experiments.

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 ] 4619 views, 976 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 Multilinear Principal Component Analysis 1.2 1.2

by openpr_nlpr - April 16, 2012, 09:04:08 CET [ Project Homepage BibTeX Download ] 3561 views, 976 downloads, 1 subscription

About: This archive contains a Matlab implementation of the Multilinear Principal Component Analysis (MPCA) algorithm and MPCA+LDA, as described in the paper Haiping Lu, K.N. Plataniotis, and A.N. Venetsanopoulos, "MPCA: Multilinear Principal Component Analysis of Tensor Objects", IEEE Transactions on Neural Networks, Vol. 19, No. 1, Page: 18-39, January 2008.

Changes:

Initial Announcement on mloss.org.


Logo minFunc 2012

by markSchmidt - December 18, 2013, 01:07:07 CET [ Project Homepage BibTeX Download ] 5345 views, 975 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 Local Binary Pattern 1.0.0

by openpr_nlpr - December 2, 2011, 05:33:44 CET [ Project Homepage BibTeX Download ] 3384 views, 975 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 Semi Stochastic Gradient Descent 1.0

by konkey - July 9, 2014, 04:28:47 CET [ BibTeX BibTeX for corresponding Paper Download ] 3818 views, 971 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 ] 3361 views, 960 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.


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 fastICA 0.1

by maitra - February 28, 2013, 06:30:20 CET [ Project Homepage BibTeX Download ] 4099 views, 944 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.


Logo Multiagent Decision Process Toolbox 0.4

by faoliehoek - June 2, 2016, 17:38:59 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4065 views, 940 downloads, 3 subscriptions

About: The Multiagent decision process (MADP) Toolbox is a free C++ software toolbox for scientific research in decision-theoretic planning and learning in multiagent systems.

Changes:

-Includes freshly written spirit parser for .pomdp files. -Includes new code for pruning POMDP vectors; obviates dependence on Cassandra's code and old LP solve version. -Includes new factor graph solution code -Generalized firefighting CGBG domain added -Simulation class for Factored Dec-POMDPs and TOI Dec-MDPs -Approximate BG clustering methods and kGMAA with clustering.


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