Roadmap » History » Version 23

Marcus Pearce, 2014-03-05 11:21 AM

1 1 Jeremy Gow
h1. Roadmap
2 1 Jeremy Gow
3 23 Marcus Pearce
h2. Installation
4 20 Jeremy Gow
5 1 Jeremy Gow
* Remove absolute pathname in connect-to-database. (mtp-admin/music-data.lisp)
6 20 Jeremy Gow
* Create cache directories if they don't exist.
7 20 Jeremy Gow
8 23 Marcus Pearce
h2. Data import
9 1 Jeremy Gow
10 23 Marcus Pearce
* It is possible to import empty datasets, which cause an error when described.
11 20 Jeremy Gow
12 23 Marcus Pearce
h2. Viewpoints
13 20 Jeremy Gow
14 23 Marcus Pearce
* Zero barlengths sometimes cause divide by zero errors
15 23 Marcus Pearce
* A straightforward language for specifying viewpoints, including viewpoint schemas (e.g. interval, interval size), making system more data agnostic
16 23 Marcus Pearce
* Polyphonic viewpoints
17 16 Jeremy Gow
18 23 Marcus Pearce
h2. Viewpoint selection
19 23 Marcus Pearce
20 23 Marcus Pearce
* Memory errors sometimes occur with large viewpoints sets (e.g., Cpitch with no basis specified)
21 23 Marcus Pearce
* When decimal places are restricted for comparison, earlier systems are preferred within a round, so use full precision to choose between ties
22 1 Jeremy Gow
* Print trace information about VP sets being tested + mean IC values; record this to log file.
23 16 Jeremy Gow
* Optionally specify: min-links
24 1 Jeremy Gow
* More flexible way for user to specify constraints on viewpoint search:
25 1 Jeremy Gow
** Define labelled viewpoint classes
26 1 Jeremy Gow
** Pairs/triples of labels/wildcards specify acceptable combinations
27 1 Jeremy Gow
** User provides whitelist or blacklist spec
28 23 Marcus Pearce
* Provide recommended viewpoints for more than just cpitch and bioi
29 17 Jeremy Gow
30 23 Marcus Pearce
h2. Testing
31 21 Jeremy Gow
32 23 Marcus Pearce
* Include unit testing code.
33 21 Jeremy Gow
34 23 Marcus Pearce
h1. Longer-term goals
35 1 Jeremy Gow
36 23 Marcus Pearce
* 'Pace' viewpoint: measure of information rate (bits/sec), analogous to flow in speech production.
37 23 Marcus Pearce
* A web service.
38 23 Marcus Pearce
* Compute predictive information (PI), expected PI and PI rate (as analogs to IC, entropy and entropy rate respectively).
39 23 Marcus Pearce
* Predict over more than one dataset.
40 23 Marcus Pearce
* Hierarchical structure: chunk common patterns into symbols.
41 5 Jeremy Gow
42 5 Jeremy Gow
Allow user to specify structure of model.
43 5 Jeremy Gow
* Determine order in which distributions are combined.
44 5 Jeremy Gow
* Specify weights for particular combinations, e.g. weighted viewpoints, or weighted memory stores.
45 1 Jeremy Gow
* Multiple memory stores.
46 23 Marcus Pearce
* Specify alternative context strategies (e.g., future context)
47 15 Jeremy Gow
* Provide some prepackaged models, e.g. the current model structure.
48 15 Jeremy Gow
49 23 Marcus Pearce
Efficiency:
50 23 Marcus Pearce
** Check/extend caching of models etc.
51 23 Marcus Pearce
** Use sampling to estimate mean IC during VP selection.
52 23 Marcus Pearce
** Optimise viewpoint selection based on match with existing IC values.