All entries.
Showing Items 491-500 of 609 on page 50 of 61: First Previous 45 46 47 48 49 50 51 52 53 54 55 Next Last

Logo Evaluation toolkit 1.0

by openpr_nlpr - August 13, 2013, 08:58:25 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2382 views, 532 downloads, 1 subscription

About: This evaluation toolkit provides a unified framework for evaluating bag-of-words based encoding methods over several standard image classification datasets.

Changes:

Initial Announcement on mloss.org.


Logo AROFAC 1.0

by kiraly - August 5, 2013, 10:56:21 CET [ BibTeX BibTeX for corresponding Paper Download ] 2379 views, 666 downloads, 1 subscription

About: Approximate Rank One FACtorization of tensors. An algorithm for factorization of three-way-tensors and determination of their rank, includes example applications.

Changes:

Initial Announcement on mloss.org.


Logo RFD 1.0

by openpr_nlpr - April 28, 2014, 10:34:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2338 views, 500 downloads, 1 subscription

About: This is an unoptimized implementation of the RFD binary descriptor, which is published in the following paper. B. Fan, et al. Receptive Fields Selection for Binary Feature Description. IEEE Transaction on Image Processing, 2014. doi: http://dx.doi.org/10.1109/TIP.2014.2317981

Changes:

Initial Announcement on mloss.org.


Logo DRVQ 1.0.1-beta

by iavr - January 18, 2014, 17:26:34 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2334 views, 547 downloads, 1 subscription

About: DRVQ is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast.

Changes:

Initial Announcement on mloss.org.


Logo Agglomerative MeanShift Clustering 1.0.0

by openpr_nlpr - December 2, 2011, 04:38:13 CET [ Project Homepage BibTeX Download ] 2333 views, 701 downloads, 1 subscription

About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity.

Changes:

Initial Announcement on mloss.org.


Logo Chordalysis 1.0

by fpetitjean - March 24, 2014, 01:22:06 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2300 views, 535 downloads, 1 subscription

About: Log-linear analysis for high-dimensional data

Changes:

Initial Announcement on mloss.org.


Logo A Parallel LDA Learning Toolbox 1.0

by yanjianfeng - January 24, 2014, 11:48:07 CET [ BibTeX Download ] 2289 views, 874 downloads, 1 subscription

About: We introduces PLL, a parallel LDA learning toolbox for big topic modeling.

Changes:

Fix some compiling errors.


Logo libmind alpha 1

by neuromancer - September 4, 2012, 04:30:57 CET [ Project Homepage BibTeX Download ] 2261 views, 668 downloads, 1 subscription

About: A general purpose library to process and predict sequences of elements using echo state networks.

Changes:

Initial Announcement on mloss.org.


Logo IPCA v0.1

by kiraly - July 7, 2014, 10:25:03 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 2228 views, 493 downloads, 1 subscription

About: This package implements Ideal PCA in MATLAB. Ideal PCA is a (cross-)kernel based feature extraction algorithm which is (a) a faster alternative to kernel PCA and (b) a method to learn data manifold certifying features.

Changes:

Initial Announcement on mloss.org.


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.


Showing Items 491-500 of 609 on page 50 of 61: First Previous 45 46 47 48 49 50 51 52 53 54 55 Next Last