A group testing method for finding patterns in data
暂无分享,去创建一个
[1] Arkadii G. D'yachkov,et al. New constructions of superimposed codes , 2000, IEEE Trans. Inf. Theory.
[2] D. Balding,et al. Efficient pooling designs for library screening. , 1994, Genomics.
[3] David C. Torney,et al. Sets pooling designs , 1999 .
[4] Lie Zhu,et al. Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.
[5] David C. Torney,et al. Two-stage group testing for complexes in the presence of errors , 1999, Discrete Mathematical Problems with Medical Applications.
[6] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[7] Sergey Yekhanin,et al. Trivial two-stage group testing for complexes using almost disjunct matrices , 2004, Discret. Appl. Math..
[8] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[9] Dimitrios Gunopulos,et al. Discovering All Most Specific Sentences by Randomized Algorithms , 1997, ICDT.
[10] P Flodman,et al. Preliminary Implementation of New Data Mining Techniques for the Analysis of Simulation Data from Genetic Analysis Workshop 12: Problem 2 , 2001, Genetic epidemiology.
[11] Arkadii G. D'yachkov,et al. Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others , 2002, J. Comb. Theory A.
[12] Douglas R. Stinson,et al. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures , 2000 .