Theoretical sampling for data mining
Tsau Young Lin · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2000
Given a finite sequence of vectors (numerical tuples), there is a complexity associated to it, called data complexity. The 'simplest' pattern that is supported by this data set has a complexity, called pattern complexity. Then the 'smallest' sub-sequence, whose pattern complexity and data complexity are both equal to the pattern complexity of the original sequence, is the smallest sample, called theoretical sample. This paper investigates such samples.