A group testing algorithm with online informational learning

References

• Abrahams , J. 1994 . Parallelized Huffman and Hu–Tucker searching . IEEE Transactions on Information Theory , 40 ( 2 ) : 508 – 510 .
   Web of Science ®Google Scholar
• Ben-Gal , I. 2004 . An upper bound on the weight-balanced testing procedure with multiple testers . IIE Transactions , 36 : 481 – 493 .
   Web of Science ®Google Scholar
• Ben-Gal , I. , Kagan , E. and Shkolnik , N. 2008 . Constructing classification trees via data mining and design of experiments concepts . Proceedings of ENBIS , September 21–25, Athens, Greece.
   Google Scholar
• Ben-Gal , I. , Shkolnik , N. and Kagan , E. 2007 . Greedy learning algorithms and their applications to decision trees . Proceedings of ENBIS 2007 , September 24–26, Dortmund, Germany.
   Google Scholar
• Bertsekas , D. P. 1995 . Dynamic Programming and Optimal Control , Boston , MA : Athena Scientific Publishers .
   Google Scholar
• Brice , P. and Jiang , W. 2009 . A context tree method for multistage fault detection and isolation with applications to commercial video broadcasting systems . IIE Transactions on Quality and Reliability , 41 ( 9 ) : 776 – 789 .
   Web of Science ®Google Scholar
• Bulitko , V. and Lee , G. 2006 . Learning in real-time search: a unifying framework . Journal of Artificial Intelligence Research , 25 : 119 – 157 .
   Web of Science ®Google Scholar
• Bulitko , V. , Sturtevant , N. , Lu , J. and Yau , T. 2007 . Graph abstraction in real-time heuristic search . Journal of Artificial Intelligence Research , 30 : 51 – 100 .
   Web of Science ®Google Scholar
• Cover , T. M. and Thomas , J. A. 1991 . Elements of Information Theory , New York , NY : John Wiley & Sons .
   Google Scholar
• Dorfman , R. 1943 . The detection of defective members of large population . Annals of Mathematical Statistics , 14 : 436 – 440 .
   Google Scholar
• Graff , L. E. and Roeloffs , R. 1974 . A group-testing procedure in the presence of test error . Journal of the American Statistical Association , 69 ( 345 ) : 159 – 163 .
   Web of Science ®Google Scholar
• Gupta , D. and Malina , R. 1999 . Group testing in presence of classification errors . Statistics in Medicine , 18 : 1049 – 1068 .
   PubMed Web of Science ®Google Scholar
• Hartmann , C. R.P. , Varshney , P. K. , Mehrotra , K. G. and Gerberich , C. L. 1982 . Application of information theory to the construction of efficient decision trees . IEEE Transactions on Information Theory , 28 ( 4 ) : 565 – 577 .
   Web of Science ®Google Scholar
• Herer , Y. T. and Raz , T. 2000 . Optimal parallel inspection for finding the first nonconforming unit in a batch—an information theoretic approach . Management Science , 46 ( 6 ) : 845 – 857 .
   Web of Science ®Google Scholar
• Huffman , D. A. 1952 . A method of the construction of minimal-redundancy codes . Proceedings of I.R.E. , 40 : 1098 – 1101 .
   Google Scholar
• IRCL Research Group publications . http://sites.google.com/a/ualberta.ca/ircl/projects (accessed October 16, 2013)
   Google Scholar
• Ishida , T. and Korf , R. E. 1991 . Moving target search . Proceedings of IJCAI 1991 , : 204 – 210 .
   Google Scholar
• Ishida , T. and Korf , R. E. 1995 . Moving target search: a real-time search for changing goals . IEEE Transactions on Pattern Analysis and Machine Intelligence , 17 ( 6 ) : 609 – 619 .
   Web of Science ®Google Scholar
• Jaroszewicz , S. 2003 . Information-theoretical and combinatorial methods in data-mining. Ph.D. Thesis , Boston , MA : University of Massachusetts .
   Google Scholar
• Kagan , E. and Ben-Gal , I. 2006 . An informational search for a moving target . Proceedings of the IEEE 24th EEEI Convention , : 153–155
   Google Scholar
• Kagan , E. and Ben-Gal , I. 2007 . A MDP test for dynamic targets via informational measure . Proceedings of the IIERM 2007 Research Meeting , : 39 – 53 .
   Google Scholar
• Kagan , E. and Ben-Gal , I. 2010 . Search after a static target by multiple searchers by the use of informational distance measures . Proceedings of IE&M 2010 , : 12
   Google Scholar
• Koenig , S. and Likhachev , M. 2006 . Real-time adaptive A* . Proceedings of AAMAS 2006 , : 281 – 288 .
   Google Scholar
• Koenig , S. and Simmons , G. 1995 . Real-time search in non-deterministic domains . Proceedings of IJCAI 1995 , : 1660 – 1667 .
   Google Scholar
• Korf , R. E. 1990 . Real-time heuristic search . Artificial Intelligence , 42 ( 2–3 ) : 189 – 211 .
   Web of Science ®Google Scholar
• Krishnamachari , R. , Gau , R.-H. , Wicker , S. B. and Haas , Z. J. 2004 . Optimal sequential paging in cellular networks . Wireless Networks , 10 : 121 – 131 .
   Web of Science ®Google Scholar
• Lloris-Ruiz , A. , Gomez-Lopera , J. F. and Roman-Roldan , R. 1993 . Entropic minimization of multiple-valued logic functions . Proceedings of ISMVL 1993 , : 24 – 28. .
   Google Scholar
• López De Mántaras , R. 1991 . A distance-based attribute selection measure for decision tree induction. . Machine Learning , 6 : 81 – 92 .
   Web of Science ®Google Scholar
• Ornstein , D. S. 1974 . Ergodic Theory, Randomness, and Dynamical Systems , New Haven , CT : Yale University Press .
   Google Scholar
• Peltonen , J. 2004 . Data exploration with learning metrics. Ph.D. Thesis , Finland : Helsinki University of Technology .
   Google Scholar
• Quinlan , J. R . 1993 . C4.5: Programs for Machine Learning , San-Francisco , CA : Morgan Kaufmann .
   Google Scholar
• Rokhlin , V. A. 1967 . Lectures on the entropy theory of measure-preserving transformations . Russian Mathematical Surveys , 22 : 1 – 52 .
   Google Scholar
• Ross , S. M. 1983 . Introduction to Stochastic Dynamic Programming , New York , NY : Academic Press .
   Google Scholar
• Shimbo , M. and Ishida , T. 2003 . Controlling the learning process of real-time heuristic search . Artificial Intelligence , 146 : 1 – 41 .
   Web of Science ®Google Scholar
• Sinai , Y. G. 1977 . Introduction to Ergodic Theory , Princeton , NJ : Princeton University Press .
   Google Scholar
• Sun , X. , Yeoh , W. and Koenig , S. 2009 . Efficient incremental search for moving target search . Proceedings of IJCAI 2009 , : 615 – 620 .
   Google Scholar
• Vitter , J. S. 1999 . Online data structures in external memory . Lecture Notes in Computer Science , 1663 : 352 – 366 .
   Google Scholar
• White , D. J. 1993 . Markov Decision Processes , Chichester , , UK : John Wiley & Sons .
   Google Scholar
• Yadin , M. and Zacks , S. 1988 . Visibility probability on line segments in three-dimensional spaces subject to random Poisson fields of obscuring spheres . Naval Research Logistics , 35 : 555 – 569 .
   Web of Science ®Google Scholar
• Yadin , M. and Zacks , S. 1990 . Multiobserver multitarget visibility probabilities for Poisson shadowing processes in the plane . Naval Research Logistics , 37 : 603 – 615 .
   Web of Science ®Google Scholar
• Zimmerman , S . 1959 . An optimal search procedure . American Mathematics Monthly , 66 : 690 – 693 .
   Google Scholar