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

Logo ClusterEval 1.1

by cdevries - May 18, 2015, 22:01:01 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2898 views, 732 downloads, 2 subscriptions

About: Cluster quality Evaluation software. Implements cluster quality metrics based on ground truths such as Purity, Entropy, Negentropy, F1 and NMI. It includes a novel approach to correct for pathological or ineffective clusterings called 'Divergence from a Random Baseline'.

Changes:

Moved project to GitHub.


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 ] 2877 views, 574 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 Graphical Models and Conditional Random Fields Toolbox 2

by jdomke - January 5, 2012, 15:38:20 CET [ Project Homepage BibTeX Download ] 2812 views, 699 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 Naive Bayes EM Algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:35:09 CET [ Project Homepage BibTeX Download ] 2808 views, 650 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 Cubist 2.07

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

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

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 ] 2783 views, 703 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: 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 treelearn 1

by iskander - September 21, 2011, 16:12:27 CET [ Project Homepage BibTeX Download ] 2769 views, 690 downloads, 1 subscription

About: A python implementation of Breiman's Random Forests.

Changes:

Initial Announcement on mloss.org.


Logo QuickDT 0.1

by sanity - September 21, 2011, 13:43:37 CET [ Project Homepage BibTeX Download ] 2745 views, 801 downloads, 1 subscription

About: A decision tree learner that is designed to be reasonably fast, but the primary goal is ease of use

Changes:

Initial Announcement on mloss.org.


Logo JMLR fastclime 1.2.3

by colin1898 - March 10, 2014, 08:54:41 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2729 views, 740 downloads, 1 subscription

About: The package "fastclime" provides a method of recover the precision matrix efficiently by applying parametric simplex method. The computation is based on a linear optimization solver. It also contains a generic LP solver and a parameterized LP solver using parametric simplex method.

Changes:

Initial Announcement on mloss.org.


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