Name | Modified | Size | Downloads / Week |
---|---|---|---|
Parent folder | |||
vda-src.zip | 2013-07-17 | 35.3 kB | |
VDA.jar | 2013-07-17 | 85.2 kB | |
COPYING | 2013-05-21 | 35.1 kB | |
COPYING.LESSER | 2013-05-21 | 7.7 kB | |
vda-test.zip | 2011-01-31 | 10.8 kB | |
vda-javadoc.zip | 2011-01-31 | 120.8 kB | |
readme.txt | 2011-01-31 | 1.4 kB | |
Totals: 7 Items | 296.3 kB | 0 |
VDA: Validation Discrimination Analysis version 0.1 Authors: Francesco Strino <francesco.strino@yale.edu> Fabio Parisi <fabio.parisi@yale.edu> Yuval Kluger <yuval.kluger@yale.edu> Run as : java -server -jar VDA.jar [options] where the options are: -i input_file input format -o output_file output file. (if stdout is specified no file is created, defaults to input_file.vda) -g uses greedy algorithm -e uses exhaustive algorithm (suggested for small input) -h each row in the input file has a header that can be used for identification -1 indexes in the output (when h is not specified) are 1-based -0 indexes in the output (when h is not specified) are 0-based (default) -s seed sets the seed of the random generator (ensures reproducibility of results) Input file format for each line: [header] 0 1 0 1 0 1 - specify -h if the first word is the header - characters [1ty] = true, characters [0fn] = false, the other characters are ignored Output file format for each line: ID,h_min,preds where: - ID = header (if -h specified), 0-based index of input line (default or -0), 1-based index of input line (-1) - h_min = minimum Hamming distance between algorithms after taking all experiments up to here - preds = comma-separated list of predictions (match input line)