检索结果-内蒙古大学图书馆

International Multi-Conference on Engineering and Technological Innovation

作者： Nikolova, Evgeniya Jecheva, Veselina Burgas Free Univ Fac Comp Sci & Engn Burgas Bulgaria

ISBN: (纸本)9781934272435

The aim of this paper is to present some evaluations of the effectiveness of IDS based on the junction tree algorithm (JTA). We stop our attention to two statistical methods - sensitivity and specificity which are functions of the true positive rate, the false negative rate and the false positive rate, the true negative rate respectively. Relationship between them is given by the receiver operating characteristic curve, which is one graphically method for estimation. For achieving a balance between the false positive rate and the false negative rate are used the crossover error rate.

关键词： intrusion detection anomaly based intrusion detection junction tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Faster-BNI: Fast Parallel Exact Inference on Bayesian Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2024年第8期35卷 1444-1455页

作者： Jiang, Jiantong Wen, Zeyi Mansoor, Atif Mian, Ajmal Univ Western Australia Crawley WA 6009 Australia Hong Kong Univ Sci & Technol Guangzhou Data Sci & Analyt Thrust Guangzhou 511436 Peoples R China Hong Kong Univ Sci & Technol Hong Kong Peoples R China

Bayesian networks (BNs) have recently attracted more attention, because they are interpretable machine learning models and enable a direct representation of causal relations between variables. However, exact inference on BNs is time-consuming, especially for complex problems, which hinders the widespread adoption of BNs. To improve the efficiency, we propose a fast BN exact inference named Faster-BNI on multi-core CPUs. Faster-BNI enhances the efficiency of a well-known BN exact inference algorithm, namely the junction tree algorithm, through hybrid parallelism that tightly integrates coarse- and fine-grained parallelism. Moreover, we identify that the bottleneck of BN exact inference methods lies in recursively updating the potential tables of the network. To reduce the table update cost, Faster-BNI employs novel optimizations, including the reduction of potential tables and re-organizing the potential table storage, to avoid unnecessary memory consumption and simplify potential table operations. Comprehensive experiments on real-world BNs show that the sequential version of Faster-BNI outperforms existing sequential implementation by 9 to 22 times, and the parallel version of Faster-BNI achieves up to 11 times faster inference than its parallel counterparts.

关键词： Bayesian networks exact inference junction tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Graphical models and point pattern matching

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2006年第10期28卷 1646-1663页

作者： Caetano, Tiberio S. Caelli, Terry Schuurmans, Dale Barone, Dante A. C. Natl ICT Australia Canberra ACT 2601 Australia Australian Natl Univ Res Sch Informat Sci & Engn Canberra ACT 0200 Australia Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Univ Fed Rio Grande do Sul Inst Informat BR-91501970 Porto Alegre RS Brazil

This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.

关键词： point pattern matching graph matching graphical models Markov random fields junction tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Bayesian networks: The minimal triangulations of a graph

引用

THEORETICAL COMPUTER SCIENCE 2019年 795卷 1-8页

作者： Do Le Paul Minh Truong Thi Thuy Duong Calif State Univ Fullerton Dept ISDS Fullerton CA 92831 USA Banking Acad Dept Math 12 Chua Boc St Hanoi Vietnam

Graph triangulation plays an essential role in the study of the Bayesian networks, especially in the celebrated junction tree algorithm. Here we present a simple new proof for CompMLSM by Berry et al. (2009), which generalizes all known algorithms searching for the minimal triangulations of a graph. We also show how CompMLSM may be implemented in our General Minimal Triangulation algorithm. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Bayesian networks junction tree algorithm Minimal triangulation CompMLSM

来源：评论

学校读者我要写书评

暂无评论

Latent class models for diary method data: Parameter estimation by local computations

引用

PSYCHOMETRIKA 2008年第2期73卷 167-182页

作者： Rijmen, Frank Vansteelandt, Kristof De Boeck, Paul Katholieke Univ Leuven VU Med Ctr NL-1007 MB Amsterdam Netherlands

The increasing use of diary methods calls for the development of appropriate statistical methods. For the resulting panel data, latent Markov models can be used to model both individual differences and temporal dynamics. The computational burden associated with these models can be overcome by exploiting the conditional independence relations implied by the model. This is done by associating a probabilistic model with a directed acyclic graph, and applying transformations to the graph. The structure of the transformed graph provides a factorization of the joint probability function of the manifest and latent variables, which is the basis of a modified and more efficient E-step of the EM algorithm. The usefulness of the approach is illustrated by estimating a latent Markov model involving a large number of measurement occasions and, subsequently, a hierarchical extension of the latent Markov model that allows for transitions at different levels. Furthermore, logistic regression techniques are used to incorporate restrictions on the conditional probabilities and to account for the effect of covariates. Throughout, models are illustrated with an experience sampling methodology study on the course of emotions among anorectic patients.

关键词： graphical models latent Markov model hierarchical latent Markov model junction tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Reliability analysis on ammonium nitrate/fuel oil explosive vehicle pharmaceutical system based on dynamic fault tree and Bayesian network

引用

ANNALS OF OPERATIONS RESEARCH 2022年第1期311卷 167-182页

作者： Jiang, Guang-Jun Chen, Hong-Xia Gao, Le Sun, Hong-Hua Li, Qing-Yang Inner Mongolia Univ Technol Sch Mech Engn Hohhot 010051 Inner Mongolia Peoples R China

Ammonium nitrate/fuel oil (ANFO) explosive vehicle is the most common equipment in the mining machinery. The pharmaceutical system is the most important system of the whole mechanical system, its performance and reliability determine the reliability of the whole system. However, there is little literature on reliability analysis of ANFO explosive vehicle. In this paper, ANFO explosive vehicle pharmaceutical system is regarded as the research object. The pharmaceutical system presents complex dynamic characteristics. The electronic control subsystem, for example, contains function dependency gate, and the sensitizer system includes warm spare parts. In this paper, the related theories and methods of dynamic fault tree and Bayesian network were applied to the reliability research of the pharmaceutical system. By analyzing the principle of the system, dynamic fault tree model was established. By mapping relation, it was transformed into Bayesian network. The marginal probability distribution and the conditional probability distribution of each node are determined, and the prior probabilities and the posterior probabilities of the pharmaceutical system are obtained. Compared with the results of Markov's analysis, there are some deviations between them. According to the sequencing result of the influence degree of parts on the reliability, the fuel flow-meter, oil filter element, sensitizer flow-meter, line interface, and oil pipe are the weak links of the pharmaceutical system. They can be regarded as important objects of system improvement, fault maintenance and health management. The sensitizer system is the most reliable subsystem of the pharmaceutical system. Because of the existence of spare part logic in this subsystem, it has the least influence on the pharmaceutical system. In addition, it is necessary to reduce the impact of the operating environment in the reliability analysis of similar systems. The result can improve maintenance efficiency and provide theore

关键词： Dynamic fault tree Bayesian network junction tree algorithm Markov

来源：评论

学校读者我要写书评

暂无评论

Efficient designs for Bayesian networks with sub-tree bounds

引用

STATISTICS AND COMPUTING 2017年第2期27卷 301-318页

作者： Lilleborge, Marie Eidsvik, Jo Norwegian Comp Ctr POB 114 Blindern N-0314 Oslo Norway NTNU Dept Math Sci N-7491 Trondheim Norway

We present upper and lower bounds for information measures, and use these to find the optimal design of experiments for Bayesian networks. The bounds are inspired by properties of the junction tree algorithm, which is commonly used for calculating conditional probabilities in graphical models like Bayesian networks. We demonstrate methods for iteratively improving the upper and lower bounds until they are sufficiently tight. We illustrate properties of the algorithm by tutorial examples in the case where we want to ensure optimality and for the case where the goal is an approximate solution with a guarantee. We further use the bounds to accelerate established algorithms for constructing useful designs. An example with petroleum fields in the North Sea is studied, where the design problem is related to exploration drilling campaigns. All of our examples consider binary random variables, but the theory can also be applied to other discrete or continuous distributions.

关键词： Information measure Bayesian networks Upper and lower bounds Almond tree junction tree algorithm Petroleum exploration Subset selection Design of experiment

来源：评论

学校读者我要写书评

暂无评论

Automated Placement for Parallelized FPGA FFTs

Automated Placement for Parallelized FPGA FFTs

引用

IEEE 19th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Gowda, Suraj Parsons, Aaron Jarnot, Robert Werthimer, Dan Univ Calif Berkeley EECS Berkeley CA 94720 USA Univ Calif Berkeley Astron Berkeley CA 94720 USA CALTECH Jet Prop Lab Pasadena CA 91125 USA Univ Calif Berkeley Space Sci Lab Berkeley CA 94720 USA

ISBN: (纸本)9780769543017

We present an automated placement algorithm for a high-bandwidth, streaming fast Fourier transform (FFT) generated using an open-source core generator. For radio spectral line analysis, we generate a 2048-point FFT for a standard commercial FPGA high-bandwidth spectrometer, which can process 16 digital samples per cycle simultaneously (streaming). Our placement algorithm enables this system to operate at 375 MHz and process a 6 GHz sampling rate, nearly 85% of the theoretical maximum FPGA clock rate. This algorithm is a special case of the junction tree algorithm from machine learning, and allows our design to support a 25% faster clock than the standard Xilinx toolflow implementation while using 50% less CPU time to compile. This gain is equivalent to gains induced by floorplanning with no hand placement.

关键词： algorithm design and analysis Digital signal processing Discrete Fourier transforms FFT FPGA FPGA high-bandwidth spectrometer Field programmable gate arrays junctions Optimization Partitioning algorithms automated placement automated placement fast Fourier transform fast Fourier transforms field programmable gate arrays junction tree algorithm machine learning open-source core generator parallel algorithms parallelized FPGA FFT radio spectral line analysis spectrometer

来源：评论

学校读者我要写书评

暂无评论

An HMM Acoustic Model Incorporating Various Additional Knowledge Sources

An HMM Acoustic Model Incorporating Various Additional Knowl...

引用

Interspeech Conference 2007

作者： Sakti, Sakriani Markov, Konstantin Nakamura, Satoshi National Institute of Information and Communications Technology Japan ATR Spoken Language Communication Research Laboratories Japan

ISBN: (纸本)9781605603162

We introduce a method of incorporating additional knowledge sources into an HAM-based statistical acoustic model. The probabilistic relationship between information sources is first learned through a Bayesian network to easily integrate any additional knowledge sources that might come from any domain and then the global joint probability density function (PDF) of the model is formulated. Where the model becomes too complex and direct BN inference is intractable, we utilize a junction tree algorithm to decompose the global joint PDF into a linked set of local conditional PDFs. This way, a simplified form of the model can be constructed and reliably estimated using a limited amount of training data. Here, we apply this framework to incorporate accents, gender, and wide-phonetic knowledge information at the HAM phonetic model level. The performance of the proposed method was evaluated on an LVCSR task using two different types of accented English speech data. Experimental results revealed that our method improves word accuracy with respect to standard HAM.

关键词： acoustic model knowledge incorporation Bayesian network junction tree algorithm wide-phonetic knowledge

来源：评论

学校读者我要写书评

暂无评论

Differentially Private High-Dimensional Data Publication via Sampling-Based Inference 15

Differentially Private High-Dimensional Data Publication via...

引用

21st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)

作者： Chen, Rui Xiao, Qian Zhang, Yu Xu, Jianliang Samsung Res Amer Mountain View CA 94043 USA Natl Univ Singapore Singapore Singapore Hong Kong Baptist Univ Hong Kong Peoples R China

ISBN: (纸本)9781450336642

Releasing high-dimensional data enables a wide spectrum of data mining tasks. Yet, individual privacy has been a major obstacle to data sharing. In this paper, we consider the problem of releasing high-dimensional data with differential privacy guarantees. We propose a novel solution to preserve the joint distribution of a high-dimensional dataset. We first develop a robust sampling-based framework to systematically explore the dependencies among all attributes and subsequently build a dependency graph. This framework is coupled with a generic threshold mechanism to significantly improve accuracy. We then identify a set of marginal tables from the dependency graph to approximate the joint distribution based on the solid inference foundation of the junction tree algorithm while minimizing the resultant error. We prove that selecting the optimal marginals with the goal of minimizing error is NP-hard and, thus, design an approximation algorithm using an integer programming relaxation and the constrained concave-convex procedure. Extensive experiments on real datasets demonstrate that our solution substantially outperforms the state-of-the-art competitors.

关键词： Differential privacy high-dimensional data joint distribution dependency graph junction tree algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：