timbl(1)

okay bestie, this is timbl(1), straight outta the General Commands Manual. it's the Tilburg Memory Based Learner and she is that girl. ๐Ÿ’…

โœจ NAME โœจ

timbl โ€” Tilburg Memory Based Learner

๐ŸŒธ SYNOPSIS ๐ŸŒธ

run it like this:

timbl [options]

timbl -f data-file -t testโ€file

๐Ÿ’– DESCRIPTION ๐Ÿ’–

TiMBL is an open source software package implementing several memoryโ€based learning algorithms. Among them: IB1โ€IG, which is an implementation of kโ€nearest neighbor classification with feature weighting suitable for symbolic feature spaces, and IGTree, a decisionโ€tree approximation of IB1โ€IG. All implemented algorithms have this in common: they store some representation of the training set explicitly in memory. During testing, new cases get classified by extrapolation from the most similar stored cases. periodt.


๐ŸŽ€ OPTIONS ๐ŸŽ€

okay so here's the whole menu. every flag, every value, no skips. ๐Ÿซถ

  • -a <n> or -a <string> โ€” determines the classification algorithm. Possible values:
    • 0 or IB โ€” the IB1 (kโ€NN) algorithm (default)
    • 1 or IGTREE โ€” a decisionโ€treeโ€based approximation of IB1
    • 2 or TRIBL โ€” a hybrid of IB1 and IGTREE
    • 3 or IB2 โ€” an incremental editing version of IB1
    • 4 or TRIBL2 โ€” a nonโ€parameteric version of TRIBL
  • -b n โ€” number of lines used for bootstrapping (IB2 only)
  • -B n โ€” number of bins used for discretization of numeric feature values (Default B=20)
  • --Beam=<n> โ€” limit +v db output to n highestโ€vote classes
  • --clones=<n> โ€” number f threads to use for parallel testing
  • -c n โ€” clipping frequency for prestoring MVDM matrices
  • +D โ€” store distributions on all nodes (necessary for using +v db with IGTree, but wastes memory otherwise)
  • --Diversify โ€” rescale weight (see docs)
  • -d val โ€” weigh neighbors as a function of their distance:
    • Z โ€” equal weights to all (default)
    • ID โ€” Inverse Distance
    • IL โ€” Inverse Linear
    • ED:a โ€” Exponential Decay with factor a (no whitespace!)
    • ED:a:b โ€” Exponential Decay with factor a and b (no whitespace!)
  • -e n โ€” estimate time until n patterns tested
  • -f file โ€” read from data file file OR use filenames from file for cross validation test
  • -F format โ€” assume the specified input format (Compact, C4.5, ARFF, Columns, Binary, Sparse )
  • -G normalization โ€” normalize distributions (+v db option only) Supported normalizations are:
    • Probability or 0 โ€” normalize between 0 and 1
    • addFactor:<f> or 1:<f> โ€” add f to all possible targets, then normalize between 0 and 1 (default f=1.0).
    • logProbability or 2 โ€” Add 1 to the target Weight, take the 10Log and then normalize between 0 and 1
  • +H or -H โ€” write hashed trees (default +H)
  • -i file โ€” read the InstanceBase from file (skips phase 1 & 2 )
  • -I file โ€” dump the InstanceBase in file
  • -k n โ€” search n nearest neighbors (default n = 1)
  • -L n โ€” set value frequency threshold to back off from MVDM to Overlap at level n
  • -l n โ€” fixed feature value length (Compact format only)
  • -m string โ€” use feature metrics as specified in string: The format is : GlobalMetric:MetricRange:MetricRange e.g.: mO:N3:I2,5-7
    • C โ€” cosine distance. (Global only. numeric features implied)
    • D โ€” dot product. (Global only. numeric features implied)
    • DC โ€” Dice coefficient
    • O โ€” weighted overlap (default)
    • E โ€” Euclidian distance
    • L โ€” Levenshtein distance
    • M โ€” modified value difference
    • J โ€” Jeffrey divergence
    • S โ€” Jensenโ€Shannon divergence
    • N โ€” numeric values
    • I โ€” Ignore named values
  • --matrixin=file โ€” read ValueDifference Matrices from file file
  • --matrixout=file โ€” store ValueDifference Matrices in file
  • -n file โ€” create a C4.5-style names file file
  • -M n โ€” size of MaxBests Array
  • -N n โ€” number of features (default 2500)
  • -o s โ€” use s as output filename
  • --occurrences=<value> โ€” The input file contains occurrence counts (at the last position) value can be one of: train , test or both
  • -O path โ€” save output using path
  • -p n โ€” show progress every n lines (default p = 100,000)
  • -P path โ€” read data using path
  • -q n โ€” set TRIBL threshold at level n
  • -R n โ€” solve ties at random with seed n
  • -s โ€” use the exemplar weights from the input file
  • -s0 โ€” ignore the exemplar weights from the input file
  • -T n โ€” use feature n as the class label. (default: the last feature)
  • -t file โ€” test using file
  • -t leave_one_out โ€” test with the leaveโ€oneโ€out testing regimen (IB1 only). you may add --sloppy to speed up leaveโ€oneโ€out testing (but see docs)
  • -t cross_validate โ€” perform crossโ€validation test (IB1 only)
  • -t @file โ€” test using files and options described in file Supported options: d e F k m o p q R t u v w x % -
  • --Treeorder =value n โ€” ordering of the Tree:
    • DO โ€” none
    • GRO โ€” using GainRatio
    • IGO โ€” using InformationGain
    • 1/V โ€” using 1/# of Values
    • G/V โ€” using GainRatio/# of Valuess
    • I/V โ€” using InfoGain/# of Valuess
    • X2O โ€” using Xโ€square
    • X/V โ€” using Xโ€square/# of Values
    • SVO โ€” using Shared Variance
    • S/V โ€” using Shared Variance/# of Values
    • GxE โ€” using GainRatio * SplitInfo
    • IxE โ€” using InformationGain * SplitInfo
    • 1/S โ€” using 1/SplitInfo
  • -u file โ€” read valueโ€class probabilities from file
  • -U file โ€” save valueโ€class probabilities in file
  • -V โ€” Show VERSION
  • +v level or -v level โ€” set or unset verbosity level, where level is:
    • s โ€” work silently
    • o โ€” show all options set
    • b โ€” show node/branch count and branching factor
    • f โ€” show calculated feature weights (default)
    • p โ€” show value difference matrices
    • e โ€” show exact matches
    • as โ€” show advanced statistics (memory consuming)
    • cm โ€” show confusion matrix (implies +vas)
    • cs โ€” show perโ€class statistics (implies +vas)
    • cf โ€” add confidence to output file (needs -G)
    • di โ€” add distance to output file
    • db โ€” add distribution of best matched to output file
    • md โ€” add matching depth to output file.
    • k โ€” add a summary for all k neigbors to output file (sets -x)
    • n โ€” add nearest neigbors to output file (sets -x)

You may combine levels using + e.g. +v p+db or -v o+di

  • -w n โ€” weighting:
    • 0 or nw โ€” no weighting
    • 1 or gr โ€” weigh using gain ratio (default)
    • 2 or ig โ€” weigh using information gain
    • 3 or x2 โ€” weigh using the chiโ€square statistic
    • 4 or sv โ€” weigh using the shared variance statistic
    • 5 or sd โ€” weigh using standard deviation. (all features must be numeric)
  • -w file โ€” read weights from file
  • -w file:n โ€” read weight n from file
  • -W file โ€” calculate and save all weights in file
  • +% or -% โ€” do or don't save test result (%) to file
  • +x or -x โ€” do or don't use the exact match shortcut (IB1 and IB2 only, default is -x)
  • -X file โ€” dump the InstanceBase as XML in file

๐Ÿ’€ BUGS ๐Ÿ’€

possibly ๐Ÿ’€

๐Ÿ‘‘ AUTHORS ๐Ÿ‘‘

Ko van der Sloot Timbl@uvt.nl

Antal van den Bosch Timbl@uvt.nl

๐Ÿฆ‹ SEE ALSO ๐Ÿฆ‹

timblserver(1)


and that's the whole page, bestie. it's from the General Commands Manual, dated 2017 November 9, and it's timbl(1). mwah ๐Ÿ’‹