scholarly journals Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure

2011 ◽  
Vol 12 (1) ◽  
pp. 154 ◽  
Author(s):  
Zafer Aydin ◽  
Ajit Singh ◽  
Jeff Bilmes ◽  
William S Noble
Author(s):  
Na Lyu ◽  
Jiaxin Zhou ◽  
Xuan Feng ◽  
Kefan Chen ◽  
Wu Chen

High dynamic topology and limited bandwidth of the airborne network make it difficult to provide reliable information interaction services for diverse combat mission of aviation swarm operations. Therefore, it is necessary to identify the elephant flows in the network in real time to optimize the process of traffic control and improve the performance of airborne network. Aiming at this problem, a timeliness-enhanced traffic identification method based on machine learning Bayesian network model is proposed. Firstly, the data flow training subset is obtained by preprocessing the original traffic dataset, and the sub-classifier is constructed based on Bayesian network model. Then, the multi-window dynamic Bayesian network classifier model is designed to enable the early identification of elephant flow. The simulation results show that compared with the existing elephant flow identification method, the proposed method can effectively improve the timeliness of identification under the condition of ensuring the accuracy of identification.


2020 ◽  
Vol 8 (4) ◽  
Author(s):  
Kyle D Peterson

Abstract Exposing an athlete to intense physical exertion when their organism is not ready for the mobilization of such resources can lead to musculoskeletal injury. In turn, sport practitioners regularly monitor athlete readiness in hopes of mitigating these tragic events. Rapid developments in athlete monitoring technologies has thus resulted in sport practitioners aspiring to siphon meaningful insight from high-throughput datasets. However, revealing the temporal sequence of biological adaptation while yielding accurate probabilistic predictions of an event, demands computationally efficient and accurate algorithms. The purpose of the present study is to create a model in the form of the intuitively appealing dynamic Bayesian network (DBN). Existing DBN approaches can be split into two varieties: either computationally burdensome and thus unscalable, or place structural constraints to increase scalability. This article introduces a novel algorithm ‘rapid incremental search for time-varying associations’ $(Rista)$, to be time-efficient without imposing structural constraints. Furthermore, it offers such flexibility and computational efficiency without compromising prediction performance. The present algorithm displays comparable results to contemporary algorithms in classification accuracy while maintaining superior speed.


2004 ◽  
Vol 31 (2) ◽  
pp. 117-136 ◽  
Author(s):  
Vı́ctor Robles ◽  
Pedro Larrañaga ◽  
José M. Peña ◽  
Ernestina Menasalvas ◽  
Marı́a S. Pérez ◽  
...  

2020 ◽  
Vol 195 ◽  
pp. 105638
Author(s):  
Shuangcheng Wang ◽  
Siwen Zhang ◽  
Tao Wu ◽  
Yongrui Duan ◽  
Liang Zhou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document