LSFR算法在多传感器分布式检测中的优化研究

在多传感器分布式检测系统中,常规融合规则算法要求传感器误差概率已知,且系统中传感器和融合中心同时优化存在一定困难.提出最小二乘融合规则(LSFR)算法,算法不依赖噪声环境稳定性以及传感器的虚警概率与检测概率,融合中心根据各个传感器的硬决策,得到全局的硬决策,并在传感器和融合中心处理达到最优时,获得最佳全局性能.仿真结果表明:对比似然比融合决策算法与Neyman Pearson融合规则(NPFR)算法,LSFR算法全局检测概率显著提高,且在不同数量规模传感器和更多类型的分布式检测系统中具有较好兼容性.     

分布式贝叶斯检测融合优化算法及其计算机仿真

该文研究了利用分布式多传感器获得全局决策的分布式信号检测问题。在这种检测系统中各传感器将其各自关于观测对象的决策传送至融合中心,融合中心根据融合规则给出全局决策。研究重点是基于贝叶斯准则的分布式并联检测融合系统的数据融合理论,给出了使系统全局最优的融合规则和传感器决策规则,提出了对融合规则和传感器决策规则进行优化计算的非线性高斯一赛德尔算法,具体讨论了两相同传感器、两个不同传感器和三个相同传感器在具有独立观测时的数据融合问题。给出了利用本文所提算法对上述几种情况进行计算机仿真的仿真实例。仿真结果表明：融合系统的性能相对传感器有显著改善,采用三个相同传感器的融合系统,其贝叶斯风险下降了26．5％。     

New results on the performance of distributed Bayesian detectionsystems

The purpose of decision fusion in a distributed detection system is to achieve a performance that is better than that of local detectors (or sensors). We consider a distributed Bayesian detection system consisting of n sensors and a fusion center, in which the decision rules of the sensors have been given and the decisions of different sensors are conditionally independent. We assume that the decision rules of the sensors can be optimum or suboptimum, and that the probabilities of detection and false alarm of the sensors can be different. Theoretical analysis on the performance of this fusion system is carried out. Conditions for the fusion system to achieve a global risk that is smaller than local risks are obtained     

On the performance of distributed Neyman-Pearson detection systems

The performance of a distributed Neyman-Pearson detection system is considered. We assume that the decision rules of the sensors are given and that decisions from different sensors are mutually independent conditioned on both hypotheses. The purpose of decision fusion is to improve the performance of the overall system, and we are interested to know under what conditions can a better performance be achieved at fusion center, and under what conditions cannot. We assume that the probabilities of detection and false alarm of the sensors can be different. By comparing the probability of detection at fusion center with that of each of the sensors, with the probability of false alarm at fusion center constrained equal to that of the sensor, we give conditions for a better performance to be achieved at fusion center     

Performance and geometric interpretation for decision fusion withmemory

A binary distributed detection system comprises a bank of local decision makers (LDMs) and a central information processor or data fusion center (DFC). All LDMs survey a common volume for a binary {H₀, H₁} phenomenon. Each LDM forms a binary decision: it either accepts H₁ (target-present) or H₀ (target-absent). The LDM is fully characterized by its performance probabilities. The decisions are transmitted to the DFC through noiseless communication channels. The DFC then optimally combines the local decisions to obtain a global decision which minimizes a Bayesian objective function. The DFC remembers and uses its most recent decision in synthesizing each new decision. When operating in a stationary environment, our architecture converges to a steady-state decision LDM in finite time with probability one, and its detection performance during convergence and in steady state is strictly determined. Once convergence is proven, we apply the results to the detection of signals with random phase and amplitude. We further provide a geometric interpretation for the behaviour of the system     

Learning active fusion of multiple experts' decisions: an attention-based approach

In this letter, we propose a learning system, active decision fusion learning (ADFL), for active fusion of decisions. Each decision maker, referred to as a local decision maker, provides its suggestion in the form of a probability distribution over all possible decisions. The goal of the system is to learn the active sequential selection of the local decision makers in order to consult with and thus learn the final decision based on the consultations. These two learning tasks are formulated as learning a single sequential decision-making problem in the form of a Markov decision process (MDP), and a continuous reinforcement learning method is employed to solve it. The states of this MDP are decisions of the attended local decision makers, and the actions are either attending to a local decision maker or declaring final decisions. The learning system is punished for each consultation and wrong final decision and rewarded for correct final decisions. This results in minimizing the consultation and decision-making costs through learning a sequential consultation policy where the most informative local decision makers are consulted and the least informative, misleading, and redundant ones are left unattended. An important property of this policy is that it acts locally. This means that the system handles any nonuniformity in the local decision maker's expertise over the state space. This property has been exploited in the design of local experts. ADFL is tested on a set of classification tasks, where it outperforms two well-known classification methods, Adaboost and bagging, as well as three benchmark fusion algorithms: OWA, Borda count, and majority voting. In addition, the effect of local experts design strategy on the performance of ADFL is studied, and some guidelines for the design of local experts are provided. Moreover, evaluating ADFL in some special cases proves that it is able to derive the maximum benefit from the informative local decision makers and to minimize attending to redundant ones.     

An extension of statistical decision theory with information theoretic cost functions to decision fusion: Part I

A review of information theory and statistical decision theory has led to the recognition that decisions in statistical decision theory can be interpreted as being determined by the similarity between the distribution of probabilities obtained from measurements and characteristic distributions of probabilities representing the members of the set of decisions. The obscure interpretation was found during a review of statistical decision theory for the special case where the cost function of statistical decision theory is an information theoretic cost function.Additional research has found that the resulting information theoretic decision rule has a number of interesting characteristics that may have previously been recognized in terms of mathematical interest, but until now have not been recognized for their implications for information fusion. Bayesian probability theory has been criticized for problematic changes in decisions when hypotheses and decisions are reorganized to different levels of abstraction, weak justification for the selection of prior probabilities, and the need for all probability density functions to be defined. The characteristics of the information theoretic decision rule show that the decisions are less sensitive to changes in the reorganization of hypothesis and decision sets to different levels of abstraction in comparison to Bayesian probability theory. Extension of the information theoretic rule to a fusion rule (to be provided in a companion paper) will be shown to provide increased justification for the selection of prior probabilities through the adoption of Laplace’s principle of indifference. The criticism of the need for all probability density functions can be partially mitigated by arguing that the hypothesis abstraction levels can be selected so that all the probability density functions may be obtained. Further refutation of the third criticism will require that the assumption that the probability density functions are not definitively known but may be ambiguous as well and will not be pursued as a line of inquiry within the two companion papers.     

Unified fusion rules for multisensor multihypothesis network decision systems

In this paper, we present a fusion rule for distributed multihypothesis decision systems where communication patterns among sensors are given and the fusion center may also observe data. It is a specific form of the most general fusion rule, independent of statistical characteristics of observations and decision criteria, and thus, is called a unified fusion rule of the decision system. To achieve globally optimum performance, only sensor rules need to be optimized under the proposed fusion rule for the given conditional distributions of observations and decision criterion. Following this idea, we present a systematic and efficient scheme for generating optimum sensor rules and hence, optimum fusion rules, which reduce computation tremendously as compared with the commonly used exhaustive search. Numerical examples are given, which support the above results and provide a guideline on how to assign sensors to nodes in a signal detection networks with a given communication pattern. In addition, performance of parallel and tandem networks is compared.     

A new multiple decisions fusion rule for targets detection in multiple sensors distributed detection systems with data fusion

Currently, multiple sensors distributed detection systems with data fusion are used extensively in both civilian and military applications. The optimality of most detection fusion rules implemented in these systems relies on the knowledge of probability distributions for all distributed sensors. The overall detection performance of the central processor is often worse than expected due to instabilities of the sensors probability density functions. This paper proposes a new multiple decisions fusion rule for targets detection in distributed multiple sensor systems with data fusion. Unlike the published studies, in which the overall decision is based on single binary decision from each individual sensor and requires the knowledge of the sensors probability distributions, the proposed fusion method derives the overall decision based on multiple decisions from each individual sensor assuming that the probability distributions are not known. Therefore, the proposed fusion rule is insensitive to instabilities of the sensors probability distributions. The proposed multiple decisions fusion rule is derived and its overall performance is evaluated. Comparisons with the performance of single sensor, optimum hard detection, optimum centralized detection, and a multiple thresholds decision fusion, are also provided. The results show that the proposed multiple decisions fusion rule has higher performance than the optimum hard detection and the multiple thresholds detection systems. Thus it reduces the loss in performance between the optimum centralized detection and the optimum hard detection systems. Extension of the proposed method to the case of target detection when some probability density functions are known and applications to binary communication systems are also addressed.     

Unexpected properties and optimum-distributed sensor detectors fordependent observation cases

Optimum-distributed signal detection system design is studied for cases with statistically dependent observations from sensor to sensor. The common parallel architecture is assumed. Here, each sensor sends a decision to a fusion center that determines a final binary decision using a nonrandomized fusion rule. General L sensor cases are considered. A discretized iterative algorithm is suggested that can provide approximate solutions to the necessary conditions for optimum distributed sensor decision rules under a fixed fusion rule. The algorithm is shown to converge in a finite number of iterations, and the solutions obtained are shown to approach the solutions to the original problem, without discretization, as the variable step size shrinks to zero. In the formulation, both binary and multiple-bit sensor decisions cases are considered. Illustrative numerical examples are presented for two-, three-, and four-sensor cases, in which a common random Gaussian signal is to be detected in Gaussian noise     

A logic-based approach to rule induction in expert systems

Rule induction is an important part of learning in expert systems. Rules can help managers make more effective decisions and gain insight into the relationships between decision variables. We present a logic-based approach to rule induction in expert systems which is simple, robust and consistent. We also derive bounds on levels of certainty for combining rules. We apply our approach to the development of rules for the entry decisions of new products. We then discuss how the logic-based approach of rule induction can be used to create a decision support system and the methodology to create such a system.     

Machine learning advice in managerial decision-making: The overlooked role of decision makers’ advice utilization

Machine learning (ML) analyses offer great potential to craft profound advice for augmenting managerial decision-making. Yet, even the most promising ML advice cannot improve decision-making if it is not utilized by decision makers. We therefore investigate how ML analyses influence decision makers’ utilization of advice and resulting decision-making performance. By analyzing data from 239 ML-supported decisions in real-world organizational scenarios, we demonstrate that decision makers’ utilization of ML advice depends on the information quality and transparency of ML advice as well as decision makers’ trust in data scientists’ competence. Furthermore, we find that decision makers’ utilization of ML advice can lead to improved decision-making performance, which is, however, moderated by the decision makers’ management level. The study’s results can help organizations leverage ML advice to improve decision-making and promote the mutual consideration of technical and social aspects behind ML advice in research and practice as a basic requirement.     

基于经典-模糊变精度概念格的决策规则获取及其推理算法

在模糊形式背景上引入了4种经典一模糊变精度概念,形成4种变精度概念格,在此基础上得到4种决策规则集.利用包含度构建不同决策规则集中的推理算法,进而得到所有对象组合的决策规则.证明了由决策规则得到的决策集分别是必然性与可能性决策集,且推理算法具有协调性和相容性.     

Optimal sensor rules and unified fusion rules for multisensor multi-hypothesis network decision systems with channel errors

In this paper, for general jointly distributed sensor observations, we present optimal sensor rules with channel errors for a given fusion rule. Then, the unified fusion rules problem for multisensor multi-hypothesis network decision systems with channel errors is studied as an extension of our previous results for ideal channels, i.e., people only need to optimize sensor rules under the proposed unified fusion rules to achieve global optimal decision performance. More significantly, the unified fusion rules do not depend on distributions of sensor observations, decision criterion, and the characteristics of fading channels. Finally, several numerical examples support the above analytic results and show some interesting phenomena which can not be seen in ideal channel case.     

无线传感器网络中基于代理的D-S数据融合

提出了一种无线传感器网络中基于移动代理带证据权的D S融合算法。引入证据权对证据进行修正以降低冲突数据对融合结果的影响。采用三级D S组合规则进行融合决策：节点级融合计算单个节点时间域融合检测概率;簇内级融合计算簇内节点间空间域融合检测概率获取局部决策结果;簇间级融合计算簇间的融合检测概率获取最终的全局决策结果。仿真结果表明,本算法能以较小的能耗代价获取准确的融合结果并有效降低冲突数据对融合结果的影响。     

Sequential covering rule induction algorithm for variable consistency rough set approaches

We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used for both ordered and non-ordered data. In the case of ordered data, the rough set model employs dominance relation, and in the case of non-ordered data, it employs indiscernibility relation. VC-DomLEM generates a minimal set of decision rules. These rules are characterized by a satisfactory value of the chosen consistency measure. We analyze properties of induced decision rules, and discuss conditions of correct rule induction. Moreover, we show how to improve rule induction efficiency due to application of consistency measures with desirable monotonicity properties.     

Combining Rough Sets and Bayes' Rule

In rough set theory with every decision rule two conditional probabilities, called certainty and coverage factors, are associated. These two factors are closely related with the lower and the upper approximation of a set, basic notions of rough set theory. It is shown that these two factors satisfy the Bayes' rule.
The Bayes' rule in our case simply shows some relationship in the data, without referring to prior and posterior probabilities intrinsically associated with Bayesian inference. This relationship can be used to "invert" decision rules, i.e., to find reasons (explanation) for decisions thus providing inductive as well as deductive inference in our scheme.     

基于模糊评判的决策级信息融合算法的研究

文章针对水电故障诊断系统中普遍采用的传感器阀值判断方法引起的信息损失问题,将决策级信息融合技术应用于故障诊断系统中。在模糊综合评判技术和软判决融合结构下,提出了一种新的决策级信息融合算法。该算法以合成运算和全局决策融合来自多传感器的局部判决以获取所处理对象的综合决策分析,并通过在丰满水电仿真系统的故障诊断系统中的实际应用表明该算法优于传统的故障检测方法。     

Distributed decision fusion under nonideal communication channels with adaptive topology

Multi-sensor decision fusion has attracted some attention in information fusion field, meanwhile, the distributed target detection has been a well-studied topic in the multi-sensor detection theory. This paper investigates the increase in detection reliability that an adaptive network (with adaptive topologies and nonideal channels and decision fusion rules) can provide, compared with a fixed topology network. We consider a network, consisting of K-local uncertainty sensors and a Fusion Center (FC) tasked with detecting the presence or absence of a target in the Region of Interest (ROI). Sensors transmit binary modulated local decisions over nonideal channels modeled as Gaussian noise or fading channels. Assuming that the signal intensity emitted by a target follows the isotropic attenuation power model, we consider three classes of network topology architectures: (1) serial topology; (2) tree topology, and (3) parallel topology. Under the Neyman–Pearson (NP) criterion, we derive the optimal threshold fusion rule with adaptive topology to minimize the error probability. Extensive simulations are conducted to validate the correctness and effectiveness of the proposed algorithms.     

Mining the Social Fabric of Archaic Urban Centers with Cultural Algorithms

Applying a suite of tools from artificial intelligence and data mining to existing archaeological data from Monte Alban, a prehistoric urban center, offers the potential for building agent-based models of emergent ancient urban centers. The authors use decision trees to characterize location decisions made by early inhabitants at Monte Alban, a prehistoric urban center, and inject these rules into a socially motivated learning system based on cultural algorithms. They can then infer an emerging social fabric whose networks provide support for certain theories about urban site formation. Specifically, we examine the period of occupation associated with the emergence of this early site. Our goal is to generate a set of decision rules using data-mining techniques and then use the cultural algorithm toolkit (CAT) to express the underlying social interaction between the initial inhabitants.