اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMajority Vote of Diverse Classifiers for Late Fusion
229
0
0.0
(
0
)
تأليف
Emilie Morvant
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle this problem, we investigate a recent and elegant well-founded quadratic program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq looks for the weighted combination, over a set of real-valued functions seen as voters, leading to the lowest misclassification rate, while maximizing the voters diversity. We propose an extension of MinCq tailored to multimedia indexing. Our method is based on an order-preserving pairwise loss adapted to ranking that allows us to improve Mean Averaged Precision measure while taking into account the diversity of the voters that we want to fuse. We provide evidence that this method is naturally adapted to late fusion procedures and confirm the good behavior of our approach on the challenging PASCAL VOC07 benchmark.
قيم البحث
اقرأ أيضاً
We tackle the issue of classifier combinations when observations have multiple views. Our method jointly learns view-specific weighted majority vote classifiers (i.e. for each view) over a set of base voters, and a second weighted majority vote class
ifier over the set of these view-specific weighted majority vote classifiers. We show that the empirical risk minimization of the final majority vote given a multiview training set can be cast as the minimization of Bregman divergences. This allows us to derive a parallel-update optimization algorithm for learning our multiview model. We empirically study our algorithm with a particular focus on the impact of the training set size on the multiview learning results. The experiments show that our approach is able to overcome the lack of labeled information.
Non-Markovian dynamics pervades human activity and social networks and it induces memory effects and burstiness in a wide range of processes including inter-event time distributions, duration of interactions in temporal networks and human mobility. H
ere we propose a non-Markovian Majority-Vote model (NMMV) that introduces non-Markovian effects in the standard (Markovian) Majority-Vote model (SMV). The SMV model is one of the simplest two-state stochastic models for studying opinion dynamics, and displays a continuous order-disorder phase transition at a critical noise. In the NMMV model we assume that the probability that an agent changes state is not only dependent on the majority state of his neighbors but it also depends on his {em age}, i.e. how long the agent has been in his current state. The NMMV model has two regimes: the aging regime implies that the probability that an agent changes state is decreasing with his age, while in the anti-aging regime the probability that an agent changes state is increasing with his age. Interestingly, we find that the critical noise at which we observe the order-disorder phase transition is a non-monotonic function of the rate $beta$ of the aging (anti-aging) process. In particular the critical noise in the aging regime displays a maximum as a function of $beta$ while in the anti-aging regime displays a minimum. This implies that the aging/anti-aging dynamics can retard/anticipate the transition and that there is an optimal rate $beta$ for maximally perturbing the value of the critical noise. The analytical results obtained in the framework of the heterogeneous mean-field approach are validated by extensive numerical simulations on a large variety of network topologies.
We study a nonequilibrium model with up-down symmetry and a noise parameter $q$ known as majority-vote model of M.J. Oliveira $1992$ on opinion-dependent network or Stauffer-Hohnisch-Pittnauer networks. By Monte Carlo simulations and finite-size scal
ing relations the critical exponents $beta/ u$, $gamma/ u$, and $1/ u$ and points $q_{c}$ and $U^*$ are obtained. After extensive simulations, we obtain $beta/ u=0.230(3)$, $gamma/ u=0.535(2)$, and $1/ u=0.475(8)$. The calculated values of the critical noise parameter and Binder cumulant are $q_{c}=0.166(3)$ and $U^*=0.288(3)$. Within the error bars, the exponents obey the relation $2beta/ u+gamma/ u=1$ and the results presented here demonstrate that the majority-vote model belongs to a different universality class than the equilibrium Ising model on Stauffer-Hohnisch-Pittnauer networks, but to the same class as majority-vote models on some other networks.
The stationary critical properties of the isotropic majority vote model on random lattices with quenched connectivity disorder are calculated by using Monte Carlo simulations and finite size analysis. The critical exponents $gamma$ and $beta$ are fou
nd to be different from those of the Ising and majority vote on the square lattice model and the critical noise parameter is found to be $q_{c}=0.117pm0.005$.
We present a novel analysis of the expected risk of weighted majority vote in multiclass classification. The analysis takes correlation of predictions by ensemble members into account and provides a bound that is amenable to efficient minimization, w
hich yields improved weighting for the majority vote. We also provide a specialized version of our bound for binary classification, which allows to exploit additional unlabeled data for tighter risk estimation. In experiments, we apply the bound to improve weighting of trees in random forests and show that, in contrast to the commonly used first order bound, minimization of the new bound typically does not lead to degradation of the test error of the ensemble.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
