Partition triples: A tool for reduction of data sets
View/ Open
Issue Date
1996-12Author
Grzymala-Busse, Jerzy W.
Than, Soe
Publisher
ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS
Format
71642 bytes
Type
Article
Metadata
Show full item recordAbstract
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. Steams 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. (C) 1996 Academic Press, Inc.
Collections
Citation
GrzymalaBusse, JW; Than, S. Partition triples: A tool for reduction of data sets. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. Dec 1996. 53(3):575-582
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.