Batch Classiications with Discrete Finite Mixtures
نویسندگان
چکیده
In this paper we study batch classiication problems where multiple predictions are made simultaneously, in contrast to the standard independent classiication case, where the predictions are made independently one at a time. The main contribution of this paper is to demonstrate how the standard EM algorithm for nite mixture models can be modiied for the batch classiication case. In the empirical part of the paper, the results obtained by the batch classiication approach are compared to those obtained by independent predictions.
منابع مشابه
Batch Classification with Discrete Finite Mixtures
In this paper we study batch classiication problems where multiple predictions are made simultaneously, in contrast to the standard independent classiication case, where the predictions are made independently one at a time. The main contribution of this paper is to demonstrate how the standard EM algorithm for nite mixture models can be modiied for the batch classiication case. In the empirical...
متن کاملOn a discrete-time GI/Geo/1/N queue with single working vacation and partial batch rejection
This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...
متن کاملFINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کامل