{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:50:48Z","timestamp":1648641048658},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T00:00:00Z","timestamp":1196294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10044-007-0095-5","type":"journal-article","created":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T02:13:01Z","timestamp":1196215981000},"page":"37-53","source":"Crossref","is-referenced-by-count":5,"title":["Estimation of distributions involving unobservable events: the case of optimal search with unknown Target Distributions"],"prefix":"10.1007","volume":"12","author":[{"given":"Qingxin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. John","family":"Oommen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,29]]},"reference":[{"key":"95_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/1109026","volume":"9","author":"VI Arkin","year":"1964","unstructured":"Arkin VI (1964) A problem of optimum distribution of search effort. Theory Probab Appl 9:159\u2013160","journal-title":"Theory Probab Appl"},{"issue":"2\u20133","key":"95_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10044-006-0036-8","volume":"9","author":"G Badr","year":"2006","unstructured":"Badr G, Oommen BJ (2006) A novel look-ahead optimization strategy for trie-based approximate string matching. Pattern Anal Appl J 9(2\u20133):177\u2013187","journal-title":"Pattern Anal Appl J"},{"key":"95_CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"JL Bentley","year":"1976","unstructured":"Bentley JL, Yao AC-C (1976) An almost optimal algorithm for unbounded searching. Inf Process Lett 5:82\u201387","journal-title":"Inf Process Lett"},{"key":"95_CR4","doi-asserted-by":"crossref","first-page":"198101","DOI":"10.1103\/PhysRevLett.94.198101","volume":"94","author":"O Benichou","year":"2005","unstructured":"Benichou O, Coppey M, Moreau M, Suet PH, Voituriez R (2005) Optimal search strategies for hidden targets. Phys Rev Lett 94:198101","journal-title":"Phys Rev Lett"},{"key":"95_CR5","volume-title":"Mathematical statistics: basic ideas and selected topics, vol I","author":"P Bickel","year":"2000","unstructured":"Bickel P, Doksum K (2000) Mathematical statistics: basic ideas and selected topics, vol I, 2nd edn. Prentice-Hall, Englewood Cliffs","edition":"2nd"},{"key":"95_CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/320211.320232","volume":"46","author":"H Buhrman","year":"1999","unstructured":"Buhrman H, Franklin M, Garay JA, Hoepman J-H, Tromp J, Vitnyi P (1999) Mutual search. J ACM 46:517\u2013536","journal-title":"J ACM"},{"issue":"3","key":"95_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10044-007-0060-3","volume":"10","author":"D Calitoiu","year":"2007","unstructured":"Calitoiu D, Oommen BJ, Nussbaum D (2007) Periodicity and stability issues of a chaotic pattern recognition neural network. Pattern Anal Appl J 10(3):175\u2013188","journal-title":"Pattern Anal Appl J"},{"key":"95_CR8","unstructured":"Casella G, Berger R (2001) Statistical inference, 2nd edn. Brooks\/Cole Pub Co."},{"key":"95_CR9","unstructured":"Chandramouli R (2004) Web search steganalysis: Some challenges and approaches. In: Proceedings of the IEEE ISCAS: special session on information hiding"},{"key":"95_CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/mnsc.5.1.44","volume":"5","author":"A Charness","year":"1958","unstructured":"Charness A, Cooper WW (1958) The theory of search: optimum distribution of search effort. Manage Sci 5:44\u201350","journal-title":"Manage Sci"},{"key":"95_CR11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1214\/aoms\/1177698965","volume":"38","author":"MC Chew","year":"1967","unstructured":"Chew MC (1967) A sequential search procedure. Ann Math Stat 38:494\u2013502","journal-title":"Ann Math Stat"},{"key":"95_CR12","doi-asserted-by":"crossref","unstructured":"Dasgupta B, Hespanha JP, Sontag E (2004) Computational complexities of honey-pot searching with local sensory information. In: Proceedings of ACC 2004, the American Control Conference, pp 2134\u20132138","DOI":"10.23919\/ACC.2004.1383776"},{"key":"95_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.9.1.1","volume":"9","author":"J De Guenin","year":"1961","unstructured":"De Guenin J (1961) Optimum distribution of effort: an extension of the Koopman basic theory. Oper Res 9:1\u20137","journal-title":"Oper Res"},{"key":"95_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/nav.3800100129","volume":"10","author":"JM Dobbie","year":"1963","unstructured":"Dobbie JM (1963) Search theory: a sequential approach. Nav Res Logist Q 10:323\u2013334","journal-title":"Nav Res Logist Q"},{"key":"95_CR15","volume-title":"Pattern classification","author":"R Duda","year":"2000","unstructured":"Duda R, Hart P, Stork D (2000) Pattern classification, 2nd edn. Wiley, New York","edition":"2nd"},{"key":"95_CR16","volume-title":"Introduction to statistical pattern recognition","author":"K Fukunaga","year":"1990","unstructured":"Fukunaga K (1990) Introduction to statistical pattern recognition. Academic, London"},{"key":"95_CR17","unstructured":"Gage DW (1995) Many-Robot MCM search systems. In: Proceedings of the symposium of autonomous vehicles in mine countermeasures, Monterey CA, pp 4\u20137"},{"key":"95_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0317009","volume":"17","author":"S Gal","year":"1979","unstructured":"Gal S (1979) Search games with mobile and immobile hider. SIAM J Control Optim 17:99\u2013122","journal-title":"SIAM J Control Optim"},{"key":"95_CR19","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0107034","volume":"7","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN (1959) Optimal search strategies. SIAM J Appl Math 7:413\u2013424","journal-title":"SIAM J Appl Math"},{"key":"95_CR20","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1287\/opre.7.4.468","volume":"7","author":"B Gluss","year":"1959","unstructured":"Gluss B (1959) An optimum policy for detecting a fault in a complex system. Oper Res 7:468\u2013477","journal-title":"Oper Res"},{"key":"95_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/nav.3800080309","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss B (1961) Approximately optimal one-dimensional search policies in which search costs vary through time. Nav Res Logist Q 8:277\u2013283","journal-title":"Nav Res Logist Q"},{"key":"95_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4170.001.0001","volume-title":"Learning Kernel classifiers: theory and algorithms","author":"R Herbrich","year":"2001","unstructured":"Herbrich R (2001) Learning Kernel classifiers: theory and algorithms. MIT, Cambridge"},{"key":"95_CR23","volume-title":"Statistical inference","author":"B Jones","year":"2002","unstructured":"Jones B, Garthwaite P, Jolliffe I (2002) Statistical inference, 2nd edn. Oxford University Press, Oxford","edition":"2nd"},{"key":"95_CR24","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-247X(68)90167-4","volume":"22","author":"JB Kadane","year":"1968","unstructured":"Kadane JB (1968) Discrete search and the Neyman\u2013Pearson Lemma. J Math Anal Appl 22:156\u2013171","journal-title":"J Math Anal Appl"},{"key":"95_CR25","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/opre.19.4.894","volume":"19","author":"JB Kadane","year":"1971","unstructured":"Kadane JB (1971) Optimal whereabouts search. Oper Res 19:894\u2013904","journal-title":"Oper Res"},{"key":"95_CR26","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1214\/aos\/1176343791","volume":"5","author":"JB Kadane","year":"1977","unstructured":"Kadane JB, Simon HA (1977) Optimal strategies for a class of constrained sequential problems. Ann Stat 5:237\u2013255","journal-title":"Ann Stat"},{"issue":"6","key":"95_CR27","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TPAMI.1983.4767460","volume":"5","author":"RL Kashyap","year":"1983","unstructured":"Kashyap RL, Oommen BJ (1983) Scale preserving smoothing of polygons. IEEE Trans Pattern Anal Mach Intell 5(6):667\u2013671","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"95_CR28","first-page":"53","volume":"8","author":"T Kisi","year":"1966","unstructured":"Kisi T (1966) On an optimal searching schedule. J Oper Res Soc Japan 8:53\u201365","journal-title":"J Oper Res Soc Japan"},{"key":"95_CR29","unstructured":"Koopman BO (1946) Search and screening. OEG Report, no. 56, Center for Naval Analysis, Rosslyn, Va., USA"},{"key":"95_CR30","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.4.3.324","volume":"4","author":"BO Koopman","year":"1956","unstructured":"Koopman BO (1956) The theory of search. Part I: Kinetic bases. Oper Res 4:324\u2013346","journal-title":"Oper Res"},{"key":"95_CR31","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/opre.4.5.503","volume":"4","author":"BO Koopman","year":"1956","unstructured":"Koopman BO (1956) The theory of search. Part II: Target detection. Oper Res 4:503\u2013531","journal-title":"Oper Res"},{"key":"95_CR32","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/opre.5.5.613","volume":"5","author":"BO Koopman","year":"1957","unstructured":"Koopman BO (1957) The theory of search. Part III: The optimum distribution of searching effort. Oper Res 5:613\u2013626","journal-title":"Oper Res"},{"key":"95_CR33","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.9.6.907","volume":"9","author":"DF Mela","year":"1961","unstructured":"Mela DF (1961) Information theory and search theory as special cases of decision theory. Oper Res 9:907\u2013909","journal-title":"Oper Res"},{"key":"95_CR34","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/3477.604122","volume":"27","author":"BJ Oommen","year":"1997","unstructured":"Oommen BJ (1997) Stochastic searching on the line and its applications to parameter learning in non-linear optimization. IEEE Trans Syst Man Cybernet 27:733\u2013739","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"95_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10044-006-0032-z","volume":"10","author":"BJ Oommen","year":"2007","unstructured":"Oommen BJ, Badr G (2007) Breadth-first search strategies for trie-based syntactic pattern recognition. Pattern Anal Appl J 10:1\u201313","journal-title":"Pattern Anal Appl J"},{"key":"95_CR36","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1109\/3477.735407","volume":"SMC-28B","author":"BJ Oommen","year":"1998","unstructured":"Oommen BJ, Raghunath G (1998) Automata learning and intelligent tertiary searching for stochastic point location. IEEE Trans Syst Man Cybernet SMC-28B:947\u2013954","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"95_CR37","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0120033","volume":"20","author":"K Onaga","year":"1971","unstructured":"Onaga K (1971) Optimal search for detecting a hidden object. SIAM J Appl Math 20:298\u2013318","journal-title":"SIAM J Appl Math"},{"key":"95_CR38","volume-title":"Adaptive pattern recognition and neural networks","author":"Y-H Pao","year":"1989","unstructured":"Pao Y-H (1989) Adaptive pattern recognition and neural networks. Addison-Wesley, Reading"},{"key":"95_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88304-0","volume-title":"Structural pattern recognition","author":"T Pavlidis","year":"1977","unstructured":"Pavlidis T (1977) Structural pattern recognition. Springer, New York"},{"key":"95_CR40","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(89)90077-7","volume":"63","author":"A Pelc","year":"1989","unstructured":"Pelc A (1989) Searching with known error probability. Theor Comput Sci 63:185\u2013202","journal-title":"Theor Comput Sci"},{"key":"95_CR41","volume-title":"Numerical recipes: the art of scientific computing","author":"WH Press","year":"1986","unstructured":"Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1986) Numerical recipes: the art of scientific computing. Cambridge University Press, Cambridge"},{"key":"95_CR42","first-page":"613","volume-title":"Optimization: theory and applications","author":"SS Rao","year":"1984","unstructured":"Rao SS (1984) Optimization: theory and applications, 2nd edn. Wiley, New Delhi, pp 613\u2013626","edition":"2nd"},{"issue":"7","key":"95_CR43","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/49.622909","volume":"15","author":"R Rezaiifar","year":"1997","unstructured":"Rezaiifar R, Makowski AM (1997) From optimal search theory to sequential paging in cellular networks. IEEE J Sel Areas Commun 15(7):1253\u20131264","journal-title":"IEEE J Sel Areas Commun"},{"key":"95_CR44","volume-title":"Introduction to probability models","author":"S Ross","year":"2002","unstructured":"Ross S (2002) Introduction to probability models, 2nd edn. Academic, New York","edition":"2nd"},{"issue":"5","key":"95_CR45","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/0016-0032(94)90039-6","volume":"331B5","author":"G Santharam","year":"1994","unstructured":"Santharam G, Sastry PS, Thathachar MAL (1994) Continuous action set learning automata for stochastic optimization. J Franklin Inst 331B5:607\u2013628","journal-title":"J Franklin Inst"},{"key":"95_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/b97553","volume-title":"Mathematical statistics","author":"J Shao","year":"2003","unstructured":"Shao J (2003) Mathematical statistics, 2nd edn. Springer, Heidelberg","edition":"2nd"},{"key":"95_CR47","volume-title":"Basic statistical analysis","author":"J Sprinthall","year":"2002","unstructured":"Sprinthall J (2002) Basic statistical analysis, 2nd edn. Allyn and Bacon, Boston","edition":"2nd"},{"key":"95_CR48","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/1108019","volume":"8","author":"OV Staroverov","year":"1963","unstructured":"Staroverov OV (1963) On a searching problem. Theory Probab Appl 8:184\u2013187","journal-title":"Theory Probab Appl"},{"key":"95_CR49","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/nav.3800190109","volume":"19","author":"LD Stone","year":"1972","unstructured":"Stone LD (1972) Incremental approximation of optimal allocations. Nav Res Logist Q 19:111\u2013122","journal-title":"Nav Res Logist Q"},{"key":"95_CR50","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/nav.3800200306","volume":"19","author":"LD Stone","year":"1973","unstructured":"Stone LD (1973) Total optimality of incrementally optimal allocations. Nav Res Logist Q 19:419\u2013430","journal-title":"Nav Res Logist Q"},{"key":"95_CR51","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1137\/0314051","volume":"14","author":"LD Stone","year":"1976","unstructured":"Stone LD (1976) Incremental and total optimization of separable functionals with constraints. SIAM J Control Optim 14:791\u2013802","journal-title":"SIAM J Control Optim"},{"key":"95_CR52","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.16.1.209","volume":"16","author":"KP Tognetti","year":"1968","unstructured":"Tognetti KP (1968) An optimal strategy for a whereabouts search. Oper Res 16:209\u2013211","journal-title":"Oper Res"},{"key":"95_CR53","volume-title":"Neural computing: theory and practice.","author":"PD Wasserman","year":"1989","unstructured":"Wasserman PD (1989) Neural computing: theory and practice. van Nostrand Reinhold, New York"},{"key":"95_CR54","doi-asserted-by":"crossref","DOI":"10.1002\/0470854774","volume-title":"Statistical pattern recognition","author":"A Webb","year":"2002","unstructured":"Webb A (2002) Statistical pattern recognition, 2nd edn. Wiley, New York","edition":"2nd"},{"issue":"4","key":"95_CR55","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nav.3800280403","volume":"28","author":"I Wegener","year":"1981","unstructured":"Wegener I (1981) The construction of an optimal distribution of search effort. Nav Res Logist Q 28(4):533\u2013543","journal-title":"Nav Res Logist Q"},{"issue":"2","key":"95_CR56","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nav.3800290203","volume":"29","author":"I Wegener","year":"1982","unstructured":"Wegener I (1982) The discrete search problem and the construction of optimal allocations. Nav Res Logist Q 29(2):533\u2013543","journal-title":"Nav Res Logist Q"},{"key":"95_CR57","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/1520-6750(198902)36:1<43::AID-NAV3220360104>3.0.CO;2-W","volume":"36","author":"JR Weisinger","year":"1989","unstructured":"Weisinger JR, Benkoski SJ (1989) Optimal layered search. Nav Res Logist 36:43\u201360","journal-title":"Nav Res Logist"},{"key":"95_CR58","first-page":"229","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectioninst reinforcement learning. Mach Learn 8:229\u2013256","journal-title":"Mach Learn"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-007-0095-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-007-0095-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-007-0095-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T04:02:27Z","timestamp":1559102547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-007-0095-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,29]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s10044-007-0095-5","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,29]]}}}