Abstract
In many situations, the pair (X, Y) is purely binary, taking values in {0, 1}d×{0, 1}. Examples include boolean settings (each component of X represents “on” or “off”), representations of continuous variables through quantization (continuous variables are always represented by bit strings in computers), and ordinal data (a component of X is 1 if and only if a certain item is present). The components of X are denoted by X (1),..., X (d). In this chapter, we review pattern recognition briefly in this setup.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Devroye, L., Györfi, L., Lugosi, G. (1996). Hypercubes and Discrete Spaces. In: A Probabilistic Theory of Pattern Recognition. Stochastic Modelling and Applied Probability, vol 31. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0711-5_27
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0711-5_27
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6877-2
Online ISBN: 978-1-4612-0711-5
eBook Packages: Springer Book Archive