Applications and Perspectives
Eugene Kagan, Irad Ben‐Gal · 2013
This chapter presents two examples of heuristic procedures, which illustrate the actions and applications of informational search methods. The first procedure addresses a known problem in the data mining of object classification and presents an algorithm for creating a classification tree. The algorithm is based on the ILRTA* algorithm. The chapter illustrates the methods of group-testing search and implements the search over graphs. The second heuristic procedure deals with a problem of search and screening and presents a real-time algorithm of search for static and moving targets by single and multiple searchers. The algorithm follows the framework of the MDP models of search and the IMTS algorithm. It implements informational criteria for estimating the future states of the system. The chapter describes several applications of search methods that follow from the presented discourse, such as cellular paging and quality control. Controlled Vocabulary Terms Bayesian network; cluster randomised controlled trial