All entries.
Showing Items 561-580 of 674 on page 29 of 34: First Previous 24 25 26 27 28 29 30 31 32 33 34 Next

Logo DIANNE 0.5.0

by sbohez - October 25, 2016, 19:51:07 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4110 views, 832 downloads, 0 subscriptions

About: DIANNE is a modular software framework for designing, training and evaluating artificial neural networks on heterogeneous, distributed infrastructure . It is built on top of OSGi and AIOLOS and can transparently deploy and redeploy (parts of) a neural network on multiple machines, as well as scale up training on a compute cluster.

Changes:

Initial Announcement on mloss.org.


Logo Loom 0.2.10

by fritzo - March 19, 2015, 19:22:03 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4102 views, 991 downloads, 0 subscriptions

About: A streaming inference and query engine for the Cross-Categorization model of tabular data.

Changes:

Initial Announcement on mloss.org.


Logo Histogram of Oriented Gradient 1.0

by openpr_nlpr - February 10, 2015, 08:27:55 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4084 views, 804 downloads, 0 subscriptions

About: This is an exact implementation of Histogram of Oriented Gradient as mentioned in the paper by Dalal.

Changes:

Initial Announcement on mloss.org.


Logo SonS and MDSonS, Software for hierarchical clustering visualization V1

by marmarj3 - June 18, 2013, 12:18:05 CET [ Project Homepage BibTeX Download ] 4075 views, 1182 downloads, 0 subscriptions

About: This toolbox implements a novel visualization technique called Sectors on Sectors (SonS), and a extended version called Multidimensional Sectors on Sectors (MDSonS), for improving the interpretation of several data mining algorithms. The MDSonS method makes use of Multidimensional Scaling (MDS) to solve the main drawback of the previous method, namely, the lack of representing distances between pairs of clusters. These methods have been applied for visualizing the results of hierarchical clustering, Growing Hierarchical Self-Organizing Maps (GHSOM), classification trees and several manifolds. These methods make possible to extract all the existing relationships among centroids’ attributes at any hierarchy level.

Changes:

Initial Announcement on mloss.org.


Logo NearOED 1.0

by gabobert - July 11, 2013, 16:54:12 CET [ Project Homepage BibTeX Download ] 3967 views, 1136 downloads, 0 subscriptions

About: The toolbox from the paper Near-optimal Experimental Design for Model Selection in Systems Biology (Busetto et al. 2013, submitted) implemented in MATLAB.

Changes:

Initial Announcement on mloss.org.


Logo Half quadratic based Iterative Minimization for Robust Sparse Representation 1.0

by openpr_nlpr - June 3, 2013, 09:57:11 CET [ Project Homepage BibTeX Download ] 3961 views, 1053 downloads, 0 subscriptions

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 MIPS, The migrant implementation system 1.0

by thomasfannes - April 28, 2015, 15:07:05 CET [ Project Homepage BibTeX Download ] 3959 views, 1037 downloads, 0 subscriptions

About: MIPS is a software library for state-of-the-art graph mining algorithms. The library is platform independent, written in C++(03), and aims at implementing generic and efficient graph mining algorithms.

Changes:

description update


Logo Deep Semantic Ranking Based Hashing 1.0

by openpr_nlpr - November 18, 2015, 07:25:16 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3954 views, 706 downloads, 0 subscriptions

About: This algorithm is described in Deep Semantic Ranking Based Hashing for Multi-Label Image Retrieval. See https://github.com/zhaofang0627/cuda-convnet-for-hashing

Changes:

Initial Announcement on mloss.org.


Logo QSMM 1.16

by olegvol - July 29, 2014, 19:37:31 CET [ Project Homepage BibTeX Download ] 3949 views, 1011 downloads, 0 subscriptions

About: The implementation of adaptive probabilistic mappings.

Changes:

Initial Announcement on mloss.org.


Logo ChaLearn Gesture Challenge Turtle Tamers 1.0

by konkey - March 17, 2013, 18:39:22 CET [ BibTeX BibTeX for corresponding Paper Download ] 3907 views, 1291 downloads, 0 subscriptions

About: Soltion developed by team Turtle Tamers in the ChaLearn Gesture Challenge (http://www.kaggle.com/c/GestureChallenge2)

Changes:

Initial Announcement on mloss.org.


Logo How to Estimate the Regularization Parameter for Spectral Regression Discriminan 1.0

by openpr_nlpr - May 25, 2015, 03:26:46 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3905 views, 788 downloads, 0 subscriptions

About: Jie Gui et al., "How to estimate the regularization parameter for spectral regression discriminant analysis and its kernel version?", IEEE Transactions on Circuits and Systems for Video Technology, vol. 24, no. 2, pp. 211-223, 2014

Changes:

Initial Announcement on mloss.org.


Logo Reranker Framework 1.0

by zenog - October 29, 2012, 10:05:30 CET [ Project Homepage BibTeX Download ] 3867 views, 1125 downloads, 0 subscriptions

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

Changes:

Initial Announcement on mloss.org.


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 3862 views, 995 downloads, 0 subscriptions

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 The Choquet Kernel 1.00

by AliFall - February 11, 2014, 16:21:15 CET [ BibTeX BibTeX for corresponding Paper Download ] 3857 views, 1219 downloads, 0 subscriptions

About: The package computes the optimal parameters for the Choquet kernel

Changes:

Initial Announcement on mloss.org.


Logo pymanopt 0.1

by j_towns - April 7, 2016, 14:44:27 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3834 views, 782 downloads, 0 subscriptions

About: Python toolbox for manifold optimization with support for automatic differentiation

Changes:

Initial Announcement on mloss.org.


Logo Lynx MATLAB Toolbox v0.8-beta

by ispamm - November 19, 2014, 00:56:07 CET [ Project Homepage BibTeX Download ] 3831 views, 969 downloads, 0 subscriptions

About: A MATLAB toolbox for defining complex machine learning comparisons

Changes:

Initial Announcement on mloss.org.


Logo Maximum Correntropy Criterion for Robust Face Recognition 1.0.0

by openpr_nlpr - December 2, 2011, 05:41:58 CET [ Project Homepage BibTeX Download ] 3820 views, 1032 downloads, 0 subscriptions

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 SMPyBandits 0.9.2

by Naereen - March 20, 2018, 20:12:13 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3803 views, 716 downloads, 0 subscriptions

About: SMPyBandits: an Open-Source Research Framework for Single and Multi-Players Multi-Arms Bandits (MAB) Algorithms in Python

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 ] 3800 views, 922 downloads, 0 subscriptions

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.


Logo A framework for benchmarking of feature selection algorithms and cost functions v1.3

by msreis - August 4, 2017, 00:19:28 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3787 views, 686 downloads, 0 subscriptions

About: An open-source framework for benchmarking of feature selection algorithms and cost functions.

Changes:

Initial Announcement on mloss.org.


Showing Items 561-580 of 674 on page 29 of 34: First Previous 24 25 26 27 28 29 30 31 32 33 34 Next