All entries.
Showing Items 401-410 of 631 on page 41 of 64: First Previous 36 37 38 39 40 41 42 43 44 45 46 Next Last

Logo Thresholding program 1.0

by openpr_nlpr - March 1, 2012, 03:18:52 CET [ Project Homepage BibTeX Download ] 4889 views, 697 downloads, 1 subscription

About: This is demo program on global thresholding for image of bright small objects, such as aircrafts in airports. the program include four method, otsu,2D-Tsallis,PSSIM, Smoothnees Method.

Changes:

Initial Announcement on mloss.org.


Logo Market Basket Synthetic Data Generator v1.0.0.0

by apitman - February 9, 2011, 11:26:55 CET [ Project Homepage BibTeX Download ] 4882 views, 1228 downloads, 1 subscription

About: An open-source C# market-basket synthetic data generator, capable of creating transactions, sequences and taxonomies, based on the IBM Quest version. Written to address the maintainability and portability problems of the original, feedback, fixes and extensions are encouraged!

Changes:

Initial Announcement on mloss.org.


Logo Marray 2.2

by andres - July 6, 2011, 01:27:44 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4878 views, 1150 downloads, 1 subscription

About: Fast Runtime-Flexible Multi-dimensional Arrays and Views for C++

Changes:

Initial Announcement on mloss.org.


Logo r-cran-predbayescor 1.1-4

by r-cran-robot - December 1, 2012, 00:00:07 CET [ Project Homepage BibTeX Download ] 4873 views, 1273 downloads, 1 subscription

About: Classification rule based on Bayesian naive Bayes models with feature selection bias corrected

Changes:

Fetched by r-cran-robot on 2012-12-01 00:00:07.510624


Logo Random Forests 5.1

by zenog - September 21, 2011, 14:14:17 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4824 views, 886 downloads, 1 subscription

About: The original Random Forests implementation by Breiman and Cutler.

Changes:

Initial Announcement on mloss.org.


Logo Figue 1.0.1

by lerhumcbon - August 17, 2010, 04:03:35 CET [ Project Homepage BibTeX Download ] 4809 views, 1197 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 ] 4796 views, 1343 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 ] 4736 views, 915 downloads, 1 subscription

About: Software for graph similarity search for massive graph databases

Changes:

Initial Announcement on mloss.org.


Logo PyStruct 0.2

by t3kcit - July 9, 2014, 09:29:23 CET [ Project Homepage BibTeX Download ] 4697 views, 1170 downloads, 1 subscription

About: PyStruct is a framework for learning structured prediction in Python. It has a modular interface, similar to the well-known SVMstruct. Apart from learning algorithms it also contains model formulations for popular CRFs and interfaces to many inference algorithm implementation.

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.


Showing Items 401-410 of 631 on page 41 of 64: First Previous 36 37 38 39 40 41 42 43 44 45 46 Next Last