A group testing method for finding patterns in data

Discrete Applied Mathematics

Volumn 144, Issue 1-2, 2004, Pages 149-157

  Macula, Anthony J ^a   Popyack, Leonard J ^b  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

Complexes; Data mining; Group testing; Maximal frequent sets; Monotone properties

Indexed keywords

ALGORITHMS; DATA ACQUISITION; PATTERN RECOGNITION; PROBABILITY; SET THEORY; THEOREM PROVING;

COMPLEXES; GROUP TESTING; MAXIMAL FREQUENT SETS; MONOTONE PROPERTIES;

DATA MINING;

EID: 4544328982     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.07.009     Document Type: Article

References (15)

1. H. Agrawal et al., Fast discovery of association rules, in: U. Fayyad et al. (Ed.), Advances in Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, 1996, pp. 307-328.
2. D.I. Balding, et al., A comparative survey of non-adaptive pooling designs, Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1995, pp. 133-155.
3. W.J. Bruno et al., Design of efficient pooling experiments, Genomics 26 (1995) 21-30.
4. D-Z. Du, F. Hwang, Combinatorial Group Testing and Its Applications, Second Ed., World Scientific, Singapore, 2000.
5. A. Dyachkov, A. Macula, V. Rykov, New construction of superimposed, IEEE Trans. Inform. Theory 46 (1) (2000) 284-291.
6. A. Dyachkov et al., On families of subsets where the intersection of 1 subsets are not covered by the union of s others, J. Combin. Theory. Ser. A 99 (2) (2002) 195-218.
7. M. Farach et al., Group testing problems with sequences experimental molecular biology, in: B. Carpentieri et al. (Ed.), Proceedings of Compression and Complexity of Sequences, IEEE Press, New York, 1997, pp. 357-367.
8. P. Flodman et al., Preliminary implementation of new data mining techniques for the analysis of simulation data from Genetic Analysis Workshop 12, Genet. Epidemiol. 21 (Suppl. 1) (2001) S390-395.
9. K. Gouda, M. Zaki, Efficiently mining maximal frequent itemsets, ICDM 2001, Proceedings IEEE International Conference on data mining (2001) pp. 163-170.
10. D. Gunopulos, H. Mannila, S. Saluja, Discovering all most specific sentences by randomized algorithms, in: F. Afrati, P. Kolaitis (Eds.), Proceedings of the International Conference on Database Theory (ICDT '97), Delphi, Greece, Lecture Notes in Computer Science, Vol. 1186, Springer, Berlin, 1997, pp. 215-229.
11. A. Macula, V. Rykov, S. Yekhanin, Trivial two-stage group testing for complexes using almost disjunct matrices, Discrete Appl. Math. 137 (1) (2004) 97-107.
12. A. Macula, P. Vilenkin, D. Torney, Two stage group testing for complexes in the presence of errors, in: DIMACS Proceeding of Medical Applications of Discrete Mathematics, DIMACS Series in Discrete Math and Theoretical Computer Science, Vol. 55, American Mathematical Society, Providence, RI, 2000, pp. 145-157.
13. D. Stinson, T. van Trung, R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statist. Plann. Inference 86 (2000) 595-617.
14. D. Stinson, R. Wei, Some new bounds for cover free families, J. Combin. Theory Ser. A 90 (2000) 224-234.
15. D. Torney, Sets pooling designs, Ann. of Combin. 3 (1999) 95-101.