TodorceviC has shown that there is a ccc extension .4 in which MA,, + 2" = o2 holds and also in which the partition relation Oi \* (w,, a)\* holds for every denumerable ordinal LY. We show that the partition relation for triples 0,+(02 + 1,4)3 holds in the mode1 Jc1, and hence by absoluteness this i
Partition Triples: A Tool for Reduction of Data Sets
β Scribed by Jerzy W. Grzymala-Busse; Soe Than
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 837 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
Data sets discussed in this paper are presented as tables with rows corresponding to examples (entities, objects) and columns to attributes. A partition triple is defined for such a table as a triple of partitions on the set of examples, the set of attributes, and the set of attribute values, respectively, preserving the structure of a table. The idea of a partition triple is an extension of the idea of a partition pair, introduced by J. Hartmanis and J. Stearns in automata theory. Results characterizing partition triples and algorithms for computing partition triples are presented. The theory is illustrated by an example of an application in machine learning from examples.
π SIMILAR VOLUMES
Other peripherals used: Random-access devices such as disks and drums; line printer \* Work supported by the Stichting voor Fundamenteel Onderzoek der Materie (FOM).
For ~22, ta?, let A, ,..., 4 be s-cell partitions of a finite set X. Assume that if x, y E X7 x # y, then x, y belong to different cells of at least one of the part&ons 4. For each k > 1, let c(s, t, k) be the least integer such that if A 1,. . . ., 4 X satisfy the preceding conditions, and the smal