- Minimizing the average number of inspections for detecting rare items in finite populations
- IEEE Conference Proceedings
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
Frequently one has to search within a finite population for a single particular individual or item with a rare characteristic. Whether an item possesses the characteristic can only be determined by inspection. The availability of additional information about the items in the population opens the way to more effective inspection than just random or complete inspection of the population. We will assume that the available information allows for the assignment to all items within the population of a prior probability on whether or not it possesses the rare characteristic. This is consistent with the practice of using profiling to select high risk items for inspection. The objective is to find the specific item with a minimal number of inspections. We will determine the optimal inspection strategies for several models according to the average number of inspections needed to find the specific item. Furthermore, an ordering of these models by their average number of inspections is derived. Finally, the use, some discussion, extensions, and examples of the results and conclusions are presented.
- go to publisher's site
- Proceedings title: European Intelligence and Security Informatics Conference (EISIC), 2011
Place of publication: Athens, Greece
Editors: N. Memon, D. Zeng
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.