Data subset selection by Boolean calculation

DOI10.1016/0025-5564(84)90057-9MaRDI QIDQ1057787zbMATH OpenOpenAlexFDO

Authors R. C. Brill, G. F. Estabrook

Publication date 1984

Published in Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/24646

zbMATH Keywords

algorithmsBoolean arithmeticdata subset selectionparallel processingretrievalTAXIR

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Artificial intelligence (68T99) General biology and biomathematics (92B05) Other natural sciences (mathematical treatment) (92F05) Communication, information (94A99)

Review text

In The theory of TAXIR accessioner. ibid. 5, 327-340 (1969), the authors described an unconventional method, based on concepts from systematic biology, for storing and retrieving data, whose salient features are: (1) data are stored in such a manner that the space required for their storage is close to the information-theoretic minimum; and (2) the selection of data subsets for retrieval is effected by performing Boolean arithmetic directly on the stored data. Here we describe new algorithms to increase the power of data subset selection in the context of this method and describe their potential for parallel processing.

Recommendations

• A parallel algorithm for subset selection
• A method for selecting a subset of alternatives for future decision making
• INFORMATION STORAGE SYSTEM
• Formal system of definition of data sets as a high-level tool of data extraction
• Generation of Boolean classification rules

This page was built for publication: Data subset selection by Boolean calculation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057787)