Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
type: Item
instance of: scholarly article
title: Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
zbMATH Open document ID: 1426.62236
author: Qingxin Zhu
author: B. John Oommen
published in: PAA. Pattern Analysis and Applications
publication date: 2010-10-19T00:00:00Z
Mathematics Subject Classification ID: 62L10
zbMATH DE Number: 5802717
zbMATH Keywords: estimation of unobservable events
zbMATH Keywords: unknown target distributions
zbMATH Keywords: optimal search theory
Wikidata QID: Q60327897
MaRDI profile type: Publication
full work available at URL: s10044-007-0095-5
OpenAlex ID: W2051699617
cites work: A Problem of Optimum Distribution of Search Effort
cites work: A novel look-ahead optimization strategy for trie-based approximate string matching
cites work: An almost optimal algorithm for unbounded searching
cites work: Q4188569
cites work: Mutual search
cites work: Periodicity and stability issues of a chaotic pattern recognition neural network
cites work: Q3996777
cites work: The theory of search: optimum distribution of search effort
cites work: A Sequential Search Procedure
cites work: Customer Behavior As a Markov Process
cites work: Search theory: A sequential approach
cites work: Pattern classification.
cites work: Q3998716
cites work: Search Games with Mobile and Immobile Hider
cites work: Optimal Search Strategies
cites work: Approximately optimal one‐dimensional search policies in which search costs vary through time
cites work: Discrete search and the Neyman-Pearson lemma
cites work: Optimal Whereabouts Search
cites work: Optimal strategies for a class of constrained sequential problems
cites work: Scale Preserving Smoothing of Polygons
cites work: Q4058812
cites work: Letter to the Editor—Information Theory and Search Theory as Special Cases of Decision Theory
cites work: Breadth-first search strategies for trie-based syntactic pattern recognition
cites work: Optimal Search for Detecting a Hidden Object
cites work: Q3992731
cites work: Q4160437
cites work: Searching with known error probability
cites work: Q3713481
cites work: Continuous action set learning automata for stochastic optimization
cites work: Mathematical Statistics
cites work: On a Searching Problem
cites work: Incremental approximation of optimal allocations
cites work: Total optimality of incrementally optimal allocations
cites work: Incremental and Total Optimization of Separable Functionals with Constraints
cites work: Q5483525
cites work: The construction of an optimal distribution of search effort
cites work: The discrete search problem and the construction of optimal allocations
cites work: Q3826357
cites work: Simple statistical gradient-following algorithms for connectionist reinforcement learning
DOI: 10.1007/S10044-007-0095-5
DBLP publication ID: journals/paa/ZhuO09
description: scientific article; zbMATH DE number 5802717