Accession Number : AD0647046
Title : LINEAR RANKINGS OF FINITE-DIMENSIONAL PATTERNS.
Descriptive Note : Technical rept.,
Corporate Author : STANFORD UNIV CALIF STANFORD ELECTRONICS LABS
Personal Author(s) : Cover,Thomas M.
Report Date : SEP 1966
Pagination or Media Count : 19
Abstract : The paper determines Q(n,d), the number of ways that n d-dimensional pattern vectors can be ordered by projection onto a freely-chosen weighting vector. This is equivalent to finding the number of ways of ranking n students on the basis of arbitrary linear combinations of their scores on d examinations. Q(n,d) is independent (subject to minor nonsingularity constraints) of the precise configuration of the pattern vectors, and is naturally expressible as a sum of stirling-like numbers. (Author)
Descriptors : (*PATTERN RECOGNITION, COMBINATORIAL ANALYSIS), SET THEORY, GEOMETRY, LEARNING MACHINES, VECTOR ANALYSIS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE