Title :
An executable taxonomy of on-line modeling algorithms
Author_Institution :
Washington Univ., USA
Abstract :
This paper gives an overview of our decomposition of a group of existing and novel on-line modeling algorithms into component parts, which can be implemented as a cross product of predominantly independent sets. The result is all of the following: a test bed for executing controlled experiments with algorithm components, a frame work that unifies existing techniques and defines novel techniques, and a taxonomy for describing on-line modeling algorithms precisely and completely in a way that enables meaningful comparison
Keywords :
data compression; encoding; probability; algorithm components; coding model; controlled experiments; cross product; data compression; independent sets; online modeling algorithms; probability; test bed; Algorithm design and analysis; Context modeling; Data structures; Frequency estimation; Performance evaluation; Software design; State estimation; Taxonomy; Testing; Tree data structures;
Conference_Titel :
Data Compression Conference, 1997. DCC '97. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-7761-9
DOI :
10.1109/DCC.1997.581959