-
- Description:
peewit intends to facilitate programming, running and result examination of machine learning experiments. It abstains from setting ML data types, engines, or interfaces, what are to be provided by the user herself or by other libraries, for instance the python-weka-wrapper, https://mloss.org/software/view/548/.
The user is to decompose the experimental code into named nodes that correpsond to aspects or dimension of an experiment. This breakdown gives the machine a grip on the compounds, such that it can support the user in
- keeping track of the dimensions in code, stored (intermediate) results and plots
- simple parallelization
- storing and reintergration of intermediate results.
It also provides some generall houskeeping services like
- regime on the file-names and paths, or automatic storing
- recovering former experiment versions.
Be aware that the prototype is under development and many features are experimental. Even the underlying experimental model may be modified from time to time.
The core modules depend on python-3 and numpy only but for full functionality you further have to provide unison, ssh with agent, git, matplotlib, and graphviz as well as libsvm for the example project. Feel free to contact us for questions.
- Changes to previous version:
v-cube with side-cubes
Other available revisons
-
Version Changelog Date 0.10 v-cube with side-cubes
May 7, 2014, 16:04:18 0.9 switched to python-3
February 11, 2013, 21:21:05 0.8 core rewrite
July 9, 2012, 23:32:20 0.7 semi-uniform v-cubes
November 4, 2011, 19:54:09 0.6 archiving services
September 18, 2010, 16:22:01 0.5 parallelization services
August 18, 2010, 14:00:21 0.4 platform-independent path handling
July 21, 2010, 15:05:31 0.3 incremental e-tree definitions
May 12, 2010, 21:44:21 0.2 self-referential descent inputs
May 4, 2010, 13:30:36 0.1 services for arg-aggregations
April 26, 2010, 11:17:50 0.0 Initial Announcement on mloss.org.
April 23, 2010, 23:14:51
Comments
No one has posted any comments yet. Perhaps you'd like to be the first?
Leave a comment
You must be logged in to post comments.