A group testing method for finding patterns in data

Authors:
Anthony J. Macula;Leonard J. Popyack
Affiliations:
Department of Mathematics State University of New York, College at Geneseo, Geneseo, NY 14454, USA;Air Force Research Laboratory, Rome Research Site, Rome, NY 13441, USA
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 6
Cited 0

Fast discovery of association rules

Advances in knowledge discovery and data mining
Some new bounds for cover-free families

Journal of Combinatorial Theory Series A
Discovering All Most Specific Sentences by Randomized Algorithms

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Efficiently Mining Maximal Frequent Itemsets

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
New constructions of superimposed codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

The screening of data sets is essential to modern technology. The use of classical group testing to isolate objects that are individually positive has become the standard experimental procedure in many applied settings. Work is just beginning in applying group testing techniques to the identification of subsets of objects that are collectively positive. This paper addresses the development of probabilistic group testing methods that lead to the identification of positive combinations of objects with specific applications to data mining.