All entries.
Showing Items 541-550 of 653 on page 55 of 66: First Previous 50 51 52 53 54 55 56 57 58 59 60 Next Last

Logo JaTeCS 1.0.0

by aesuli - April 5, 2016, 17:23:12 CET [ Project Homepage BibTeX Download ] 3222 views, 706 downloads, 2 subscriptions

About: Jatecs is an open source Java library focused on automatic text categorization.

Changes:

Initial Announcement on mloss.org.


Logo Calculate Normalized Information Measures 1.0.0

by openpr_nlpr - December 2, 2011, 04:35:32 CET [ Project Homepage BibTeX Download ] 3215 views, 788 downloads, 1 subscription

About: The toolbox is to calculate normalized information measures from a given m by (m+1) confusion matrix for objective evaluations of an abstaining classifier. It includes total 24 normalized information measures based on three groups of definitions, that is, mutual information, information divergence, and cross entropy.

Changes:

Initial Announcement on mloss.org.


Logo AIDE 0.2

by khalili - January 3, 2014, 18:01:06 CET [ Project Homepage BibTeX Download ] 3170 views, 883 downloads, 1 subscription

About: AIDE (Automata Identification Engine) is a free open source tool for automata inference algorithms developed in C# .Net.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-bnclassify 0.3.2

by r-cran-robot - May 1, 2016, 00:00:04 CET [ Project Homepage BibTeX Download ] 3165 views, 778 downloads, 2 subscriptions

About: Learning Discrete Bayesian Network Classifiers from Data

Changes:

Fetched by r-cran-robot on 2016-05-01 00:00:04.546512


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 3098 views, 764 downloads, 1 subscription

About: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23).

Changes:

Initial Announcement on mloss.org.


Logo BACOM2 1.0

by fydennis - October 24, 2014, 15:25:38 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3084 views, 720 downloads, 2 subscriptions

About: revised version of BACOM

Changes:

Initial Announcement on mloss.org.


About: This code is developed based on Uriel Roque's active set algorithm for the linear least squares problem with nonnegative variables in: Portugal, L.; Judice, J.; and Vicente, L. 1994. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208):625-643.Ran He, Wei-Shi Zheng and Baogang Hu, "Maximum Correntropy Criterion for Robust Face Recognition," IEEE TPAMI, in press, 2011.

Changes:

Initial Announcement on mloss.org.


Logo Metropolis Hastings algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:43:20 CET [ Project Homepage BibTeX Download ] 3044 views, 736 downloads, 1 subscription

About: Metropolis-Hastings alogrithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult. Thi sequence can be used to approximate the distribution.

Changes:

Initial Announcement on mloss.org.


About: Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explore their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the L1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings.

Changes:

Initial Announcement on mloss.org.


Logo Reranker Framework 1.0

by zenog - October 29, 2012, 10:05:30 CET [ Project Homepage BibTeX Download ] 3039 views, 893 downloads, 1 subscription

About: ReFr is a software architecture for specifying, training and using reranking models.

Changes:

Initial Announcement on mloss.org.


Showing Items 541-550 of 653 on page 55 of 66: First Previous 50 51 52 53 54 55 56 57 58 59 60 Next Last