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

Logo Figue 1.0.1

by lerhumcbon - August 17, 2010, 04:03:35 CET [ Project Homepage BibTeX Download ] 5060 views, 1262 downloads, 1 subscription

About: A collection of clustering algorithms implemented in Javascript.

Changes:

Initial Announcement on mloss.org.


Logo Some essential Matlab extensions 1.0

by mseeger - November 10, 2007, 22:15:31 CET [ Project Homepage BibTeX Download ] 5049 views, 1407 downloads, 0 comments, 0 subscriptions

About: This is a set of MATLAB(R) functions and MEX files which I wrote to make working with this system somewhat bearable. They allow to call BLAS and LAPACK functions, which do very efficient dense [...]

Changes:

Initial Announcement on mloss.org.


Logo gWT graph indexing wavelet tree 1.0.0

by ytabei - May 12, 2011, 23:01:17 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5038 views, 965 downloads, 1 subscription

About: Software for graph similarity search for massive graph databases

Changes:

Initial Announcement on mloss.org.


Logo JMLR BudgetedSVM v1.1

by nemanja - February 12, 2014, 20:53:45 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5024 views, 904 downloads, 1 subscription

About: BudgetedSVM is an open-source C++ toolbox for scalable non-linear classification. The toolbox can be seen as a missing link between LibLinear and LibSVM, combining the efficiency of linear with the accuracy of kernel SVM. We provide an Application Programming Interface for efficient training and testing of non-linear classifiers, supported by data structures designed for handling data which cannot fit in memory. We also provide command-line and Matlab interfaces, providing users with an efficient, easy-to-use tool for large-scale non-linear classification.

Changes:

Changed license from LGPL v3 to Modified BSD.


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 GradMC 2.00

by tur - April 14, 2014, 15:48:48 CET [ BibTeX Download ] 4995 views, 1542 downloads, 1 subscription

About: GradMC is an algorithm for MR motion artifact removal implemented in Matlab

Changes:

Added support for multi-rigid motion correction.


Logo LHOTSE 0.14

by mseeger - November 26, 2007, 21:12:19 CET [ Project Homepage BibTeX ] 4970 views, 27 downloads, 0 comments, 2 subscriptions

About: *LHOTSE* is a C++ class library designed for the implementation of large, efficient scientific applications in Machine Learning and Statistics.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-penalizedSVM 1.1

by r-cran-robot - August 2, 2010, 00:00:00 CET [ Project Homepage BibTeX Download ] 4921 views, 1016 downloads, 0 subscriptions

About: Feature Selection SVM using penalty functions

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:07.509844


Logo Epistatic MAP Imputation 1.1

by colm - November 25, 2010, 21:01:10 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4861 views, 1102 downloads, 1 subscription

About: Epistatic miniarray profiles (E-MAPs) are a high-throughput approach capable of quantifying aggravating or alleviating genetic interactions between gene pairs. The datasets resulting from E-MAP experiments typically take the form of a symmetric pairwise matrix of interaction scores. These datasets have a significant number of missing values - up to 35% - that can reduce the effectiveness of some data analysis techniques and prevent the use of others. This project contains nearest neighbor based tools for the imputation and prediction of these missing values. The code is implemented in Python and uses a nearest neighbor based approach. Two variants are used - a simple weighted nearest neighbors, and a local least squares based regression.

Changes:

Initial Announcement on mloss.org.


Logo Pynopticon 0.1

by Wiecki - February 1, 2009, 18:55:10 CET [ Project Homepage BibTeX Download ] 4858 views, 1409 downloads, 1 subscription

About: Pynopticon is a toolbox that allows you to create and train your own object recognition classifiers. It makes rapid prototyping of object recognition work flows a snap. Simply create a dataset of [...]

Changes:

Initial Announcement on mloss.org.


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