Probability Of Error Equivocation And The Chernoff Bound
loginOther institution loginHelpJournalsBooksRegisterSign inHelpcloseSign in using your ScienceDirect credentialsUsernamePasswordRemember meForgotten username or password?Sign in via your institutionOpenAthens loginOther institution login Download full text in PDF Article Article + other articles in this issue Loading... Export You have selected 1 citation for export. Help Direct export Save to Mendeley Save to RefWorks Export file Format RIS (for EndNote, ReferenceManager, ProCite) BibTeX Text Content Citation Only Citation and Abstract Export Advanced search Close This document does not have an outline. JavaScript is disabled on your browser. Please enable JavaScript to use all the features on this page. Information and Control Volume 22, Issue 2, March 1973, Pages 107-122 Exponential bounds for error and equivocation based on markov chain observations Author links open the overlay panel. Numbers correspond to the affiliation list which can be exposed by using the show more link. Opens overlay James F. Korsh * California Institute of Technology, Pasadena, California, USA Received 5 March 1970, Available online 29 November 2004 Show more doi:10.1016/S0019-9958(73)90210-6 Get rights and content Under an Elsevier user license Open Archive Let X1, X2,… be a sequence of random variables whose finite dimensional distributions depend on a random variable θ. Suppose a decision is to be made for θ based on a sequence of n observations of the \Xn\}} process. In particular, suppose the process is a finite state Markov chain for each value of θ while θ may assume only a finite number of values, each with positive probability.Upper and lower bounds are derived on the error probability of both Bayes and maximum likelihood decision schemes and on the equivocation about θ after n observations. These bounds go to zero exponentially with n when the process has distinct ultimate behavior. The asymptotic rate at which they go to zero cannot be improved upon. D
Request full-text Probability of Error, Equivocation, and the Chernoff BoundArticle in IEEE Transactions on Information Theory IT-16(4):368 - 372 · August 1970 with 28 ReadsDOI: 10.1109/TIT.1970.1054466 · Source: IEEE Xplore1st Martin E. Hellman2nd Josef RavivAbstractRelationships between the probability of error, the equivocation, and the Chernoff bound are examined for the two-hypothesis decision problem. The effect of rejections on these bounds is derived. Finally, the results are extended to the case http://www.sciencedirect.com/science/article/pii/S0019995873902106 of any finite number of hypotheses.Do you want to read the rest of this article?Request full-text CitationsCitations237ReferencesReferences14Secure Mix-Zones for Privacy Protection of Road Network Location Based Services Users"The construction of a static Mix-Zone can be modified by the specific geometry of the actual road junction [28]. One of the possible https://www.researchgate.net/publication/3081680_Probability_of_Error_Equivocation_and_the_Chernoff_Bound modifications has been shown in Figure 1. "[Show abstract] [Hide abstract] ABSTRACT: Privacy has been found to be the major impediment and hence the area to be worked out for the provision of Location Based Services in the wide sense. With the emergence of smart, easily portable, communicating devices, information acquisition is achieving new domains. The work presented here is an extension of the ongoing work towards achieving privacy for the present day emerging communication techniques. This work emphasizes one of the most effective real-time privacy enhancement techniques called Mix-Zones. In this paper, we have presented a model of a secure road network with Mix-Zones getting activated on the basis of spatial as well as temporal factors. The temporal factors are ascertained by the amount of traffic and its flow. The paper also discusses the importance of the number of Mix-Zones a user traverses and their
från GoogleLogga inDolda fältBöckerbooks.google.se - The fusion of di?erent information sourcesis a persistent and intriguing issue. It hasbeenaddressedforcenturiesinvariousdisciplines,includingpoliticalscience, probability and https://books.google.se/books?id=Kn2i5EaPwuoC&pg=PA121&lpg=PA121&dq=probability+of+error+equivocation+and+the+chernoff+bound&source=bl&ots=9WE4P0y8QR&sig=l5oScKUu_D4omb0zDdW4S4bGS-M&hl=en&sa=X&ved=0ahUKEwiRjfDmyujPAhXI8 statistics, system reliability assessment, computer science, and distributed detection in communications. Early seminal work on...https://books.google.se/books/about/Multiple_Classifier_Systems.html?hl=sv&id=Kn2i5EaPwuoC&utm_source=gb-gplus-shareMultiple Classifier SystemsMitt bibliotekHjälpAvancerad boksökningSkaffa tryckt exemplarInga e-böcker finns tillgängligaSpringer ShopAmazon.co.ukAdlibrisAkademibokandelnBokus.seHitta boken i ett bibliotekAlla försäljare»Handla böcker på Google PlayBläddra i världens största e-bokhandel och börja läsa böcker probability of på webben, surfplattan, mobilen eller läsplattan redan idag.Besök Google Play nu »Multiple Classifier Systems: 5th International Workshop, MCS 2004, Cagliari, Italy, June 9-11, 2004, Proceedings, Volym 5Fabio Roli, Josef Kittler, Terry WindeattSpringer Science & Business Media, 1 juni 2004 - 386 sidor 0 probability of error Recensionerhttps://books.google.se/books/about/Multiple_Classifier_Systems.html?hl=sv&id=Kn2i5EaPwuoCThe fusion of di?erent information sourcesis a persistent and intriguing issue. It hasbeenaddressedforcenturiesinvariousdisciplines,includingpoliticalscience, probability and statistics, system reliability assessment, computer science, and distributed detection in communications. Early seminal work on fusion was c- ried out by pioneers such as Laplace and von Neumann. More recently, research activities in information fusion have focused on pattern recognition. During the 1990s,classi?erfusionschemes,especiallyattheso-calleddecision-level,emerged under a plethora of di?erent names in various scienti?c communities, including machine learning, neural networks, pattern recognition, and statistics. The d- ferent nomenclatures introduced by these communities re?ected their di?erent perspectives and cultural backgrounds as well as the absence of common forums and the poor dissemination of the most important results. In 1999, the ?rst workshop on multiple classi?er systems was organized with the main goal of creating