All entries.
Showing Items 531-540 of 658 on page 54 of 66: First Previous 49 50 51 52 53 54 55 56 57 58 59 Next Last

Logo CURFIL 1.1

by hanschul - August 18, 2014, 13:54:31 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3472 views, 781 downloads, 1 subscription

About: CURFIL uses NVIDIA CUDA to accelerate random forest training and prediction for RGB and RGB-D images. It focuses on image labelling tasks, such as image segmentation or classification applications. CURFIL allows to search for optimal hyper-parameter configurations (e.g. using the hyperopt) package) by massively decreasing training time.

Changes:

Initial Announcement on mloss.org.


About: Learns dynamic network changes across conditions and visualize the results in Cytoscape.

Changes:

Initial Announcement on mloss.org.


Logo libmind alpha 1

by neuromancer - September 4, 2012, 04:30:57 CET [ Project Homepage BibTeX Download ] 3424 views, 1023 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 java machine learning platform 1.0

by openpr_nlpr - April 2, 2015, 09:02:14 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3415 views, 624 downloads, 2 subscriptions

About: Jmlp is a java platform for both of the machine learning experiments and application. I have tested it on the window platform. But it should be applicable in the linux platform due to the cross-platform of Java language. It contains the classical classification algorithm (Discrete AdaBoost.MH, Real AdaBoost.MH, SVM, KNN, MCE,MLP,NB) and feature reduction(KPCA,PCA,Whiten) etc.

Changes:

Initial Announcement on mloss.org.


Logo linearizedGP 1.0

by dsteinberg - November 28, 2014, 07:02:54 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3389 views, 700 downloads, 1 subscription

About: Gaussian processes with general nonlinear likelihoods using the unscented transform or Taylor series linearisation.

Changes:

Initial Announcement on mloss.org.


Logo Simple Generalized Learning Vector Quantization 1.0

by fmschleif - June 4, 2015, 10:49:49 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3388 views, 824 downloads, 2 subscriptions

About: Simple and hopefully clean and easy to follow implementation of the Generalized Learning Vector Quantizer (GLVQ) with variants for metric adaptation (RGLVQ, GMLVQ, LiRaM).

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 ] 3377 views, 922 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 JaTeCS 1.0.0

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

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

Changes:

Initial Announcement on mloss.org.


Logo LMW Tree 1.0

by cdevries - May 30, 2015, 11:42:23 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3319 views, 679 downloads, 2 subscriptions

About: Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, clustering, random projections, random indexing, hashing, bit signatures

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 531-540 of 658 on page 54 of 66: First Previous 49 50 51 52 53 54 55 56 57 58 59 Next Last