데이터셋 상세
미국
Solving a prisoner's dilemma in distributed anomaly detection
Anomaly detection has recently become an important problem in many industrial and financial applications. In several instances, the data to be analyzed for possible anomalies is located at multiple sites and cannot be merged due to practical constraints such as bandwidth limitations and proprietary concerns. At the same time, the size of data sets affects prediction quality in almost all data mining applications. In such circumstances, distributed data mining algorithms may be used to extract information from multiple data sites in order to make better predictions. In the absence of theoretical guarantees, however, the degree to which data decentralization affects the performance of these algorithms is not known, which reduces the data providing participants' incentive to cooperate.This creates a metaphorical 'prisoners' dilemma' in the context of data mining. In this work, we propose a novel general framework for distributed anomaly detection with theoretical performance guarantees. Our algorithmic approach combines existing anomaly detection procedures with a novel method for computing global statistics using local sufficient statistics. We show that the performance of such a distributed approach is indistinguishable from that of a centralized instantiation of the same anomaly detection algorithm, a condition that we call zero information loss. We further report experimental results on synthetic as well as real-world data to demonstrate the viability of our approach. The remaining content of this presentation is presented in Fig. 1.
데이터 정보
연관 데이터
Anomaly Detection in Sequences
공공데이터포털
We present a set of novel algorithms which we call sequenceMiner, that detect and characterize anomalies in large sets of high-dimensional symbol sequences that arise from recordings of switch sensors in the cockpits of commercial airliners. While the algorithms we present are general and domain-independent, we focus on a specific problem that is critical to determining system-wide health of a fleet of aircraft. The approach taken uses unsupervised clustering of sequences using the normalized length of he longest common subsequence (nLCS) as a similarity measure, followed by a detailed analysis of outliers to detect anomalies. In this method, an outlier sequence is defined as a sequence that is far away from a cluster. We present new algorithms for outlier analysis that provide comprehensible indicators as to why a particular sequence is deemed to be an outlier. The algorithm provides a coherent description to an analyst of the anomalies in the sequence when compared to more normal sequences. The final section of the paper demonstrates the effectiveness of sequenceMiner for anomaly detection on a real set of discrete sequence data from a fleet of commercial airliners. We show that sequenceMiner discovers actionable and operationally significant safety events. We also compare our innovations with standard HiddenMarkov Models, and show that our methods are superior
Designing Resource-Bounded Reasoners using Bayesian Networks
공공데이터포털
In this work we are concerned with the conceptual design of large-scale diagnostic and health management systems that use Bayesian networks. While they are potentially powerful, improperly designed Bayesian networks can result in too high memory requirements or too long inference times, to they point where they may not be acceptable for real-time diagnosis and health management in resource-bounded systems such as NASA's aerospace vehicles. We investigate the clique tree clustering approach to Bayesian network inference, where increasing the size and connectivity of a Bayesian network typically also increases clique tree size. This paper combines techniques for analytically characterizing clique tree growth with bounds on clique tree size imposed by resource constraints, thereby aiding the design and optimization of large-scale Bayesian networks in resource-bounded systems. We provide both theoretical and experimental results, and illustrate our approach using a NASA case study. **Reference:** O. J. Mengshoel, “Designing Resource-Bounded Reasoners using Bayesian Networks: System Health Monitoring and Diagnosis”, In Proc. of the 18th International Workshop on Principles of Diagnosis (DX-07), Nashville, TN, May 2007. **BibTex Reference:** @inproceedings{mengshoel07designing, author = "Mengshoel, O. J.", title = "Designing Resource-Bounded Reasoners using {Bayesian} Networks: System Health Monitoring and Diagnosis", booktitle = {Proceedings of the 18th International Workshop on Principles of Diagnosis (DX-07)}, year = {2007}, pages = {330--337}, address = {Nashville, TN}, }
Qualitative Event-based Diagnosis with Possible Conflicts Applied to Spacecraft Power Distribution Systems
공공데이터포털
Model-based diagnosis enables efficient and safe operation of engineered systems. In this paper, we describe two algorithms based on a qualitative event-based fault isolation framework augmented with model-based fault identification that are applied to spacecraft power distribution systems. Although based on a common framework, the fundamental difference between the two algorithms is that one uses a global model for residual generation, fault isolation, and fault identification; whereas the other uses a set of minimal submodels computed using Possible Conflicts. We describe the implementation of the two algorithms and compare their diagnosis results on a representative spacecraft power distribution system.
목록