Translator Disclaimer
6 April 2000 Theoretical sampling for data mining
Author Affiliations +
Abstract
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsau Young Lin "Theoretical sampling for data mining", Proc. SPIE 4057, Data Mining and Knowledge Discovery: Theory, Tools, and Technology II, (6 April 2000); https://doi.org/10.1117/12.381733
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A topological-based spatial data clustering
Proceedings of SPIE (April 19 2016)
Efficient mining of strongly correlated item pairs
Proceedings of SPIE (April 17 2006)
PNP: mining of profile navigational patterns
Proceedings of SPIE (March 11 2002)
Feature transformations and structure of attributes
Proceedings of SPIE (March 11 2002)

Back to Top