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:0orIBโ theIB1(kโNN) algorithm (default)1orIGTREEโ a decisionโtreeโbased approximation ofIB12orTRIBLโ a hybrid ofIB1andIGTREE3orIB2โ an incremental editing version ofIB14orTRIBL2โ a nonโparameteric version ofTRIBL
-b nโ number of lines used for bootstrapping (IB2only)-B nโ number of bins used for discretization of numeric feature values (DefaultB=20)--Beam=<n>โ limit+v dboutput tonhighestโvote classes--clones=<n>โ number f threads to use for parallel testing-c nโ clipping frequency for prestoringMVDMmatrices+Dโ store distributions on all nodes (necessary for using+v dbwithIGTree, 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 DistanceILโ Inverse LinearED:aโ Exponential Decay with factora(no whitespace!)ED:a:bโ Exponential Decay with factoraandb(no whitespace!)
-e nโ estimate time untilnpatterns tested-f fileโ read from data filefileOR use filenames fromfilefor cross validation test-F formatโ assume the specified input format (Compact,C4.5,ARFF,Columns,Binary,Sparse)-G normalizationโ normalize distributions (+v dboption only) Supported normalizations are:Probabilityor0โ normalize between 0 and 1addFactor:<f>or1:<f>โ addfto all possible targets, then normalize between 0 and 1 (defaultf=1.0).logProbabilityor2โ Add 1 to the target Weight, take the 10Log and then normalize between 0 and 1
+Hor-Hโ write hashed trees (default+H)-i fileโ read theInstanceBasefromfile(skips phase 1 & 2 )-I fileโ dump theInstanceBaseinfile-k nโ searchnnearest neighbors (defaultn = 1)-L nโ set value frequency threshold to back off fromMVDMtoOverlapat leveln-l nโ fixed feature value length (Compactformat only)-m stringโ use feature metrics as specified instring: The format is :GlobalMetric:MetricRange:MetricRangee.g.:mO:N3:I2,5-7Cโ cosine distance. (Global only. numeric features implied)Dโ dot product. (Global only. numeric features implied)DCโ Dice coefficientOโ weighted overlap (default)Eโ Euclidian distanceLโ Levenshtein distanceMโ modified value differenceJโ Jeffrey divergenceSโ JensenโShannon divergenceNโ numeric valuesIโ Ignore named values
--matrixin=fileโ readValueDifferenceMatrices from filefile--matrixout=fileโ storeValueDifferenceMatrices infile-n fileโ create aC4.5-style names filefile-M nโ size ofMaxBestsArray-N nโ number of features (default2500)-o sโ usesas output filename--occurrences=<value>โ The input file contains occurrence counts (at the last position) value can be one of:train,testorboth-O pathโ save output usingpath-p nโ show progress everynlines (defaultp = 100,000)-P pathโ read data usingpath-q nโ setTRIBLthreshold at leveln-R nโ solve ties at random with seedn-sโ use the exemplar weights from the input file-s0โ ignore the exemplar weights from the input file-T nโ use featurenas the class label. (default: the last feature)-t fileโ test usingfile-t leave_one_outโ test with the leaveโoneโout testing regimen (IB1only). you may add--sloppyto speed up leaveโoneโout testing (but see docs)-t cross_validateโ perform crossโvalidation test (IB1only)-t @fileโ test using files and options described infileSupported options:d e F k m o p q R t u v w x % ---Treeorder =value nโ ordering of theTree:DOโ noneGROโ usingGainRatioIGOโ usingInformationGain1/Vโ using1/# of ValuesG/Vโ usingGainRatio/# of ValuessI/Vโ usingInfoGain/# of ValuessX2Oโ usingXโsquareX/Vโ usingXโsquare/# of ValuesSVOโ usingShared VarianceS/Vโ usingShared Variance/# of ValuesGxEโ usingGainRatio * SplitInfoIxEโ usingInformationGain * SplitInfo1/Sโ using1/SplitInfo
-u fileโ read valueโclass probabilities fromfile-U fileโ save valueโclass probabilities infile-Vโ ShowVERSION+v levelor-v levelโ set or unset verbosity level, wherelevelis:sโ work silentlyoโ show all options setbโ show node/branch count and branching factorfโ show calculated feature weights (default)pโ show value difference matriceseโ show exact matchesasโ 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 filedbโ add distribution of best matched to output filemdโ 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:0ornwโ no weighting1orgrโ weigh using gain ratio (default)2origโ weigh using information gain3orx2โ weigh using the chiโsquare statistic4orsvโ weigh using the shared variance statistic5orsdโ weigh using standard deviation. (all features must be numeric)
-w fileโ read weights fromfile-w file:nโ read weightnfromfile-W fileโ calculate and save all weights infile+%or-%โ do or don't save test result (%) to file+xor-xโ do or don't use the exact match shortcut (IB1andIB2only, default is-x)-X fileโ dump theInstanceBaseas XML infile
๐ BUGS ๐
possibly ๐
๐ AUTHORS ๐
Ko van der Sloot Timbl@uvt.nl
Antal van den Bosch Timbl@uvt.nl
๐ฆ SEE ALSO ๐ฆ
and that's the whole page, bestie. it's from the General Commands Manual, dated 2017 November 9, and it's timbl(1). mwah ๐
๐ฆ where this page comes from
- alpine 3.24: timbl-doc 6.10-r2 ยท GPL-3.0-only
- debian bookworm: timbl 6.5-3 ยท GPL-3.0-or-later
- debian trixie: timbl 6.10-3 ยท GPL-3.0-or-later
- nixos 26.05: timbl 6.11
- nixpkgs unstable: timbl 6.11
- ubuntu jammy: timbl 6.5-3 ยท GPL-3.0-or-later
- ubuntu noble: timbl 6.5-3.1build2 ยท GPL-3.0-or-later
- ubuntu questing: timbl 6.10-3build1
- ubuntu resolute: timbl 6.10-3build2 ยท GPL-3.0-or-later
- ubuntu stonking: timbl 6.10-3build2 ยท GPL-3.0-or-later
- ๐ girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms