Enhancing cognitive radio systems with robust reasoning

Cognitive radio systems dynamically reconfigure the algorithms and parameters they use, in order to adapt to the changing environment conditions. However, reaching proper reconfiguration decisions presupposes a way of knowing, with high enough assurance, the capabilities of the alternate configurations, especially in terms of achievable transmission capacity and coverage. The present paper addresses this problem, firstly, by specifying a complete process for extracting estimations of the capabilities of candidate configurations, in terms of transmission capacity and coverage, and, secondly, by enhancing these estimations with the employment of a machine learning technique. The technique is based on the use of Bayesian Networks, in conjunction with an effective learning and adaptation strategy, and aims at extracting and exploiting knowledge and experience, in order to reach robust (i.e. stable and reliable) estimations of the configurations' capabilities. Comprehensive results of the proposed method are presented, in order to validate its functionality. Copyright © 2007 John Wiley & Sons, Ltd.     

Decision support in early development phases—A case study from machine engineering

In the case study presented in this paper we consider early development phases of a mechanical product. We want to evaluate different concepts and decide which one(s) to pursue. A problem in early phases is that usually no test runs are available. In our case study, based on a standard, there are ways to compute the lifetime distributions of the components of the different concepts. Some parameters needed for these computations are not known precisely. Unfortunately, the lifetime distributions of the components are highly sensitive to these parameters. Our approach is to equip these parameters with distributions. These distributions would be called prior distributions in Bayesian terminology, but no update is possible since no test runs are available. Our approach implies that the distribution of the system lifetime for each concept is random, i.e. we get random elements in the space of lifetime distributions. Using Monte-Carlo simulations, we demonstrate several ways to compare the random lifetime distributions of the concepts. Some of these comparisons use stochastic orderings. We also introduce a new stochastic ordering which is particularly suitable for reliability purposes. Our case study, consisting of three scenarios, allows us to demonstrate some conclusions that can be reached.     

Can being scared cause tummy aches? Naive theories, ambiguous evidence, and preschoolers' causal inferences.

Causal learning requires integrating constraints provided by domain-specific theories with domain-general statistical learning. In order to investigate the interaction between these factors, the authors presented preschoolers with stories pitting their existing theories against statistical evidence. Each child heard 2 stories in which 2 candidate causes co-occurred with an effect. Evidence was presented in the form: AB→E; CA→E; AD→E; and so forth. In 1 story, all variables came from the same domain; in the other, the recurring candidate cause, A, came from a different domain (A was a psychological cause of a biological effect). After receiving this statistical evidence, children were asked to identify the cause of the effect on a new trial. Consistent with the predictions of a Bayesian model, all children were more likely to identify A as the cause within domains than across domains. Whereas 3.5-year-olds learned only from the within-domain evidence, 4- and 5-year-olds learned from the cross-domain evidence and were able to transfer their new expectations about psychosomatic causality to a novel task. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Subspace distance analysis with application to adaptive Bayesian algorithm for face recognition

We propose subspace distance measures to analyze the similarity between intrapersonal face subspaces, which characterize the variations between face images of the same individual. We call the conventional intrapersonal subspace average intrapersonal subspace (AIS) because the image differences often come from a large number of persons. An intrapersonal subspace is referred to as specific intrapersonal subspace (SIS) if the image differences are from just one person. We demonstrate that SIS varies significantly from person to person, and most SISs are not similar to AIS. Based on these observations, we introduce the maximum a posteriori (MAP) adaptation to the problem of SIS estimation, and apply it to the Bayesian face recognition algorithm. Experimental results show that the adaptive Bayesian algorithm outperforms the non-adaptive Bayesian algorithm as well as Eigenface and Fisherface methods if a small number of adaptation images are available.     

Bayesian inference in disputed authorship: A case study of cognitive errors and a new system for decision support

Bayesian inference provides a formal framework for assessing the odds of hypotheses in light of evidence. This makes Bayesian inference applicable to a wide range of diagnostic challenges in the field of chance discovery, including the problem of disputed authorship that arises in electronic commerce, counter-terrorism and other forensic applications. For example, when two documents are so similar that one is likely to be a hoax written from the other, the question is: Which document is most likely the source and which document is most likely the hoax? Here I review a Bayesian study of disputed authorship performed by a biblical scholar, and I show that the scholar makes critical errors with respect to several issues, namely: Causal Basis, Likelihood Judgment and Conditional Dependency. The scholar’s errors are important because they have a large effect on his conclusions and because similar errors often occur when people, both experts and novices, are faced with the challenges of Bayesian inference. As a practical solution, I introduce a graphical system designed to help prevent the observed errors. I discuss how this decision support system applies more generally to any problem of Bayesian inference, and how it differs from the graphical models of Bayesian Networks.     

Search for the upper bound of Bayesian estimates of the parameter in an exponential failure model with two known quantiles of an a priori distribution function

A fast exact algorithm of searching for the upper bound of Bayesian estimates for the parameter of the exponential distribution under the condition that an a priori distribution belongs to the class of all distribution functions with two equal quantiles. This problem arises in analyzing the sensitivity of Bayesian estimates to the choice of an a priori distribution in an exponential failure model. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 90–102, January–February 2007.     

基于动态贝叶斯网络的汉语方言辨识

方言的差异性在语音层面上反映在时间序列结构的不同。传统的语音建模方法只能建立稳定的时间序列结构,而方言语音是典型的动态时变时间序列结构。为了更好地提取方言时间序列结构,文中采用动态贝叶斯网路（DBN）进行建模分析,并对DBN的构建方法进行了研究,这种结构与常用于语音识别中的隐马尔可夫模型的不同之处在于它揭示多个时间片内的节点之间的影响。文中探索了不同结构和参数对识别效果的影响。文中的研究表明动态贝叶斯网络对汉语方言的识别比传统方法要好,识别率达到了98．9％。     

Transit smart card data mining for passenger origin information extraction

The automated fare collection(AFC) system,also known as the transit smart card(SC) system,has gained more and more popularity among transit agencies worldwide.Compared with the conventional manual fare collection system,an AFC system has its inherent advantages in low labor cost and high efficiency for fare collection and transaction data archival.Although it is possible to collect highly valuable data from transit SC transactions,substantial efforts and methodologies are needed for extracting such data because most AFC systems are not initially designed for data collection.This is true especially for the Beijing AFC system,where a passenger’s boarding stop(origin) on a flat-rate bus is not recorded on the check-in scan.To extract passengers’ origin data from recorded SC transaction information,a Markov chain based Bayesian decision tree algorithm is developed in this study.Using the time invariance property of the Markov chain,the algorithm is further optimized and simplified to have a linear computational complexity.This algorithm is verified with transit vehicles equipped with global positioning system(GPS) data loggers.Our verification results demonstrated that the proposed algorithm is effective in extracting transit passengers’ origin information from SC transactions with a relatively high accuracy.Such transit origin data are highly valuable for transit system planning and route optimization.     

Probabilistic heuristic estimates

Though they constitute the major knowledge source in problem-solving systems, no unified theory of heuristics has emerged. Pearl [15] defines heuristics as criteria, methods, or principles for deciding which among several alternative courses of action promises to be the most effective in order to achieve some goal. The absence of a more precise definition has impeded our efforts to understand, utilize, and discover heuristics. Another consequence is that problem-solving techniques which rely on heuristic knowledge cannot be relied upon to act rationally — in the sense of the normative theory of rationality.To provide a sound basis for BPS, the Bayesian Problem-Solver, we have developed a simple formal theory of heuristics, which is general enough to subsume traditional heuristic functions as well as other forms of problem-solving knowledge, and to straddle disparate problem domains. Probabilistic heuristic estimates represent a probabilistic association of sensations with prior experience — specifically, a mapping from observations directly to subjective probabilities which enables the use of theoretically principled mechanisms for coherent inference and decision making during problem-solving. This paper discusses some of the implications of this theory, and describes its successful application in BPS.This research was made possible by support from Heuristicrats, the National Aeronautics and Space Administration, and the Rand Corporation.