Projects that are tagged with visualization.


Logo JMLR Waffles 2013-04-06

by mgashler - April 7, 2013, 02:04:10 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 16516 views, 5417 downloads, 1 subscription

About: A broad collection of script-friendly command-line tools for machine learning and data mining tasks. (The command-line tools wrap functionality from a C++ class library.)

Changes:

See the change log at http://waffles.sourceforge.net/changelog.html


Logo MLDemos 0.5.1

by basilio - March 2, 2013, 16:06:13 CET [ Project Homepage BibTeX Download ] 13273 views, 3007 downloads, 2 subscriptions

About: MLDemos is a user-friendly visualization interface for various machine learning algorithms for classification, regression, clustering, projection, dynamical systems, reward maximisation and reinforcement learning.

Changes:

New Visualization and Dataset Features Added 3D visualization of samples and classification, regression and maximization results Added Visualization panel with individual plots, correlations, density, etc. Added Editing tools to drag/magnet data, change class, increase or decrease dimensions of the dataset Added categorical dimensions (indexed dimensions with non-numerical values) Added Dataset Editing panel to swap, delete and rename dimensions, classes or categorical values Several bug-fixes for display, import/export of data, classification performance

New Algorithms and methodologies Added Projections to pre-process data (which can then be classified/regressed/clustered), with LDA, PCA, KernelPCA, ICA, CCA Added Grid-Search panel for batch-testing ranges of values for up to two parameters at a time Added One-vs-All multi-class classification for non-multi-class algorithms Trained models can now be kept and tested on new data (training on one dataset, testing on another) Added a dataset generator panel for standard toy datasets (e.g. swissroll, checkerboard,...) Added a number of clustering, regression and classification algorithms (FLAME, DBSCAN, LOWESS, CCA, KMEANS++, GP Classification, Random Forests) Added Save/Load Model option for GMMs and SVMs Added Growing Hierarchical Self Organizing Maps (original code by Michael Dittenbach) Added Automatic Relevance Determination for SVM with RBF kernel (Thanks to Ashwini Shukla!)


Logo Orange 2.6

by janez - February 14, 2013, 18:15:08 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8710 views, 1802 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarWhole StarEmpty Star
(based on 1 vote)

About: Orange is a component-based machine learning and data mining software. It includes a friendly yet powerful and flexible graphical user interface for visual programming. For more advanced use(r)s, [...]

Changes:

Added multi-target and multi-label learning, neural networks, Earth (MARS), PLS, and a faster tree induces for use in random forests; reorganization of module hierarchy; (weakly supported) Qwt has been replaced with a homemade module; networkx is used instead of a (weak) homemade structures for graphs; documentation has been moved to .rst, with a lot of it written anew or heavily redacted; improved system for registration of add-ons.


Logo ELKI 0.5.5

by erich - December 14, 2012, 18:49:58 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4400 views, 790 downloads, 2 subscriptions

About: ELKI is a framework for implementing data-mining algorithms with support for index structures, that includes a wide variety of clustering and outlier detection methods.

Changes:

This is mostly a bug fix release. A lot of small issues have been fixed that improve performance, make error reporting a lot better, ease the use of sparse vectors and external precomputed distances, for example.

This will be the last ELKI release to support Java 6. The next ELKI release will require Java 7.

Algorithms

  • Some new LOF variants (LDF, SimpleLOF, SimpleKernelDensityLOF)
  • Correlation Outlier Probabilities (ICDM 2012)
  • A naive mean-shift clustering
  • Single-link clustering (SLINK algorithm) should be significantly faster due to optimized data structures
  • "Benchmarking" algorithms for measuring the performance of index structures

Index layer

  • Bulk loading R-Trees should be faster - in particular Sort Tile Recursive can work very well.
  • M-Trees have been refactored and optimized for double distances

Database layer

  • Bundle format (work in progress): low-level binary format for fast data exchange
  • DBID and DataStore layer received some additional classes for further performance improvements
  • KNN heap structures were revisited. The code is less clean now, but performs better in benchmarks.

Visualizations

  • General clean up and API simplifications
  • Some additional modules and improvements

Various

  • There is a new parameter class, RandomParameter
  • Some new distributions were added, also to the data set generator.

Tutorials

  • The website has new tutorials, including one on a k-means variation that produces equal sized clusters.

Logo Divvy 1.1.1

by jlewis - November 14, 2012, 20:21:29 CET [ Project Homepage BibTeX Download ] 552 views, 195 downloads, 1 subscription

About: Divvy is a Mac OS X application for performing dimensionality reduction, clustering, and visualization.

Changes:

Initial Announcement on mloss.org.


Logo MLPlot Beta

by pascal - August 22, 2011, 11:07:53 CET [ Project Homepage BibTeX Download ] 1667 views, 288 downloads, 1 subscription

About: MLPlot is a lightweight plotting library written in Java.

Changes:

Initial Announcement on mloss.org.


Logo Finding nonlinear and stochastic structures in time series 1

by Dante - October 29, 2008, 11:14:44 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4967 views, 921 downloads, 2 subscriptions

About: The Delay vector variance (DVV) method uses predictability of the signal in phase space to characterize the time series. Using the surrogate data methodology, so called DVV plots and DVV scatter [...]

Changes:

Initial Announcement on mloss.org.