All entries.
Showing Items 411-420 of 595 on page 42 of 60: First Previous 37 38 39 40 41 42 43 44 45 46 47 Next Last

Logo OpenNN 2.2

by Sergiointelnics - August 10, 2015, 16:56:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3064 views, 536 downloads, 3 subscriptions

About: OpenNN is an open source class library written in C++ programming language which implements neural networks, a main area of deep learning research. The library has been designed to learn from both data sets and mathematical models.

Changes:

New algorithms, correction of bugs.


Logo OpenGM 2 2.0.2 beta

by opengm - June 1, 2012, 14:33:53 CET [ Project Homepage BibTeX Download ] 3061 views, 738 downloads, 1 subscription

About: A C++ Library for Discrete Graphical Models

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 ] 3057 views, 622 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 ROCCH 2.2

by tfawcett - January 9, 2010, 07:47:47 CET [ BibTeX BibTeX for corresponding Paper Download ] 3037 views, 863 downloads, 0 comments, 1 subscription

About: Given many points in ROC (Receiver Operator Characteristics) space, computes the convex hull.

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 Naive Bayes EM Algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:35:09 CET [ Project Homepage BibTeX Download ] 2970 views, 685 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 Naive Bayes Classifier 1.0.0

by openpr_nlpr - December 2, 2011, 05:25:44 CET [ Project Homepage BibTeX Download ] 2970 views, 752 downloads, 1 subscription

About: This program is a 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. The program uses the multinomial event model for representation, the maximum likelihood estimate with a Laplace smoothing technique for learning parameters. A sparse-data structure is defined to represent the feature vector in the program to seek higher computational speed.

Changes:

Initial Announcement on mloss.org.


About: TBEEF, a doubly ensemble framework for recommendation and prediction problems.

Changes:

Updated the included documentation.


Logo Graphical Models and Conditional Random Fields Toolbox 2

by jdomke - January 5, 2012, 15:38:20 CET [ Project Homepage BibTeX Download ] 2960 views, 729 downloads, 1 subscription

About: This is a Matlab/C++ "toolbox" of code for learning and inference with graphical models. It is focused on parameter learning using marginalization in the high-treewidth setting.

Changes:

Initial Announcement on mloss.org.


Logo Cubist 2.07

by zenog - September 2, 2011, 14:52:17 CET [ Project Homepage BibTeX Download ] 2940 views, 807 downloads, 1 subscription

About: Cubist is the regression counterpart to the C5.0 decision tree tool.

Changes:

Initial Announcement on mloss.org.


Showing Items 411-420 of 595 on page 42 of 60: First Previous 37 38 39 40 41 42 43 44 45 46 47 Next Last