scholarly journals Réseaux bayésiens jumelés et noyau de Fisher pondéré pour la classification de documents XML

2014 ◽  
Vol Volume 17 - 2014 - Special... ◽  
Author(s):  
Ait Ali Yahia Yassine ◽  
Amrouche Karima

International audience In this paper, we are presenting a learning model for XML document classification based on Bayesian networks. Then, we are proposing a model which simplifies the arborescent representation of the XML document that we have, named coupled model and we will see that this approach improves the response time and keeps the same performances of the classification. Then, we will study an extension of this generative model to the discriminating model thanks to the formalism of the Fisher’s kernel. At last, we have applied a ponderation of the structure components of the Fisher’s vector. We finish by presenting the obtained results on the XML collection by using the CBS and SVM methods

2007 ◽  
Vol Vol. 9 no. 1 (Distributed Computing and...) ◽  
Author(s):  
Pascale Minet ◽  
Steven Martin ◽  
Leila Azouz Saidane ◽  
Skander Azzaz

Distributed Computing and Networking International audience In this paper, we focus on applications having quantitative QoS (Quality of Service) requirements on their end-to-end response time (or jitter). We propose a solution allowing the coexistence of two types of quantitative QoS garantees, deterministic and probabilistic, while providing a high resource utilization. Our solution combines the advantages of the deterministic approach and the probabilistic one. The deterministic approach is based on a worst case analysis. The probabilistic approach uses a mathematical model to obtain the probability that the response time exceeds a given value. We assume that flows are scheduled according to non-preemptive FP/FIFO. The packet with the highest fixed priority is scheduled first. If two packets share the same priority, the packet arrived first is scheduled first. We make no particular assumption concerning the flow priority and the nature of the QoS guarantee requested by the flow. An admission control derived from these results is then proposed, allowing each flow to receive a quantitative QoS guarantee adapted to its QoS requirements. An example illustrates the merits of the coexistence of deterministic and probabilistic QoS guarantees.


2011 ◽  
Vol 74 (16) ◽  
pp. 2444-2451 ◽  
Author(s):  
Xiang-guo Zhao ◽  
Guoren Wang ◽  
Xin Bi ◽  
Peizhen Gong ◽  
Yuhai Zhao

Sign in / Sign up

Export Citation Format

Share Document