We present a novel hierarchical graphical model based context-aware hybrid brain-machine interface (hBMI) using probabilistic fusion of electroencephalographic (EEG) and electromyographic (EMG) activities. Based on ex...
详细信息
ISBN:
(纸本)9781538636466
We present a novel hierarchical graphical model based context-aware hybrid brain-machine interface (hBMI) using probabilistic fusion of electroencephalographic (EEG) and electromyographic (EMG) activities. Based on experimental data collected during stationary executions and subsequent imageries of five different hand gestures with both limbs, we demonstrate feasibility of the proposed hBMI system through within session and online across sessions classification analyses. Furthermore, we investigate the context-aware extent of the model by a simulated probabilistic approach and highlight potential implications of our work in the field of neurophysiologically-driven robotic hand prosthetics.
PGM PyLib is a toolkit that contains a wide range of probabilisticgraphicalmodels algorithms implemented in Python, and serves as a companion of the book probabilisticgraphicalmodels: Principles and Applications. ...
详细信息
There exists a dichotomy between classical probabilisticgraphicalmodels, such as Bayesian networks (BNs), and modern tractable models, such as sum-product networks (SPNs). The former generally have intractable infer...
详细信息
There exists a dichotomy between classical probabilisticgraphicalmodels, such as Bayesian networks (BNs), and modern tractable models, such as sum-product networks (SPNs). The former generally have intractable inference, but provide a high level of interpretability, while the latter admit a wide range of tractable inference routines, but are typically harder to interpret. Due to this dichotomy, tools to convert between BNs and SPNs are desirable. While one direction - compiling BNs into SPNs - is well discussed in Darwiche's seminal work on arithmetic circuit compilation, the converse direction - decompiling SPNs into BNs - has received surprisingly little attention. In this paper, we fill this gap by proposing SPN2BN, an algorithm that decompiles an SPN into a BN. SPN2BN has several salient features when compared to the only other two works decompiling SPNs. Most significantly, the BNs returned by SPN2BN are minimal independence-maps that are more parsimonious with respect to the introduction of latent variables. Secondly, the output BN produced by SPN2BN can be precisely characterized with respect to a compiled BN. More specifically, a certain set of directed edges will be added to the input BN, giving what we will call the moral-closure. Lastly, it is established that our compilation-decompilation process is idempotent. This has practical significance as it limits the size of the decompiled SPN.
Using probabilisticgraphicalmodels to deal with uncertainties by modeling relationships among detecting objects is a common method for event detecting systems. However, not all relations are captured accurately by f...
详细信息
ISBN:
(纸本)9780769549156;9781479902279
Using probabilisticgraphicalmodels to deal with uncertainties by modeling relationships among detecting objects is a common method for event detecting systems. However, not all relations are captured accurately by former graphicalmodels. This paper presents a hybrid correlational model for typical abnormal event detecting systems that have correlated objects. It captures the OR relation of multiple influences from different sources of the abnormal event. An algorithm based on message passing is developed for efficient reasoning in the model. Analysis and experiments are provided to compare it with former graphical modeling by results on the detecting objects that lack of local evidence, and by their sensitivity to the occurrence of abnormal event.
With the fast growth of document images, document annotation has become a research area of great interest. Annotation allows to describe the semantic content of documents and facilitates their use and research. Howeve...
详细信息
ISBN:
(纸本)9781479918058
With the fast growth of document images, document annotation has become a research area of great interest. Annotation allows to describe the semantic content of documents and facilitates their use and research. However, for a huge number of documents, the manual annotation of each document becomes a tedious task. A solution is to annotate a small part of the documents and to extend it automatically to the whole dataset. In this paper, we propose a model for annotation extension and document classification using a probabilisticgraphical model. In this latter, we combine visual and textual characteristics and we show that the integration of the user feedback improves the annotation step.
Chinese named entity recognition (NER) has recently been viewed as a classification or sequence labeling problem, and many approaches have been proposed. However, they tend to address this problem without considering ...
详细信息
The problems of recognizing mentions of entities in texts and linking them to unique knowledge base identifiers have received considerable attention in recent years. In this paper we present a probabilistic system bas...
详细信息
ISBN:
(数字)9783319598888
ISBN:
(纸本)9783319598888;9783319598871
The problems of recognizing mentions of entities in texts and linking them to unique knowledge base identifiers have received considerable attention in recent years. In this paper we present a probabilistic system based on undirected graphicalmodels that jointly addresses both the entity recognition and the linking task. Our framework considers the span of mentions of entities as well as the corresponding knowledge base identifier as random variables and models the joint assignment using a factorized distribution. We show that our approach can be easily applied to different technical domains by merely exchanging the underlying ontology. On the task of recognizing and linking disease names, we show that our approach outperforms the state-of-the-art systems DNorm and TaggerOne, as well as two strong lexicon-based baselines. On the task of recognizing and linking chemical names, our system achieves comparable performance to the state-of-the-art.
Protein secondary structure prediction is an important step to understanding protein tertiary structure. Recent studies indicate that the correlation between neighboring secondary structures are beneficial to improve ...
详细信息
ISBN:
(纸本)9780769536415
Protein secondary structure prediction is an important step to understanding protein tertiary structure. Recent studies indicate that the correlation between neighboring secondary structures are beneficial to improve prediction performance. In this paper, we propose a new large margin approach for protein secondary structure prediction, which consider the problem as a sequence labeling problem like probabilisticgraphicalmodels. It doesn't only make full use of the correlation between neighboring secondary structures like graphical chain models, but also shares the key advantages of other SVM-based methods, i.e. learming non-linear discriminant via kernel functions. The experimental results on datasets: CB513 and RS126 show that our algorithm outperforms other state-of-the-art methods.
probabilistic model-building genetic algorithms (PMBGAs), also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs), guide the search for the optimum by building and...
详细信息
ISBN:
(纸本)9781450311786
probabilistic model-building genetic algorithms (PMBGAs), also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs), guide the search for the optimum by building and sampling explicit probabilisticmodels of promising candidate solutions. Building and sampling probabilisticmodels of promising solutions enables the use of machine learning techniques for automated discovery of problem regularities and exploitation of these regularities for effective exploration of the search space. However, EDAs are not only optimization techniques; besides the optimum or its approximation, EDAs provide practitioners with a series of probabilisticmodels that reveal a lot of information about the problem being solved. This information can in turn be used to design problem-specific neighborhood operators for local search, to bias future runs of EDAs on a similar problem, or to create an efficient computational model of the problem. The tutorial probabilistic Model-Building GAs provides an introduction to PMBGAs with an overview of major research directions in this area.
Classification networks usually only save the specified factor associated with labels. We propose a probabilisticgraphical model (PGM) to learn the features ignored by arbitrary classification networks using staged m...
详细信息
ISBN:
(纸本)9780738133669
Classification networks usually only save the specified factor associated with labels. We propose a probabilisticgraphical model (PGM) to learn the features ignored by arbitrary classification networks using staged modeling. To implement the staged PGM, we introduce Staged Modeling Variational Autoencoder (SMVAE), in which the first stage can apply arbitrary classification models to encode the specified factor, then optimizing the Evidence Lower Bound (ELBO) given optimal specified factor to compress the features ignored at the first stage into the unspecified factor. Besides, SMVAE can learn the disentangled unspecified factors unsupervised by further decomposing the ELBO given the optimal specified factor. At last, we introduce Adain based on Infusion Training in SMVAE to learn more details to reconstruct data. Detailed experiments are given to evaluate the disentanglement and performance of SMVAE.
暂无评论