17 June 2022 in CAAI Transactions on Intelligence Technology
Relevance Vector Machine (RVM) is a supervised learning algorithm extended from Support Vector Machine based on the Bayesian sparsity model. Relevance Vector Machine classification suffers from theoretical limitations and computational inefficiency mainly because there is no closed‐form solution for the posterior of the weight parameters. We propose two advanced Bayesian approaches for RVM classification, namely the Enhanced RVM and the Reinforced RVM, to perfect the theoretic framework of RVM and extend the algorithm to the imbalanced data problem, which has an arresting skew in data size between classes. First, the Enhanced RVM conducts a strict Bayesian sampling process instead of the approximation method in the original one to remedy its theoretic limitations, especially the non‐convergence of the iterations. Secondly, we conjecture that the hierarchical prior makes the Reinforced RVM achieve consistent estimations of the quantities of interest compared with the non‐consistent estimations of the original RVM. Consistency is necessary for RVM classification since it makes the model more stable and localises the relevant vectors more accurately in the imbalanced data problem. The two‐level prior also renders the Reinforced one competitive in the imbalanced data problem by building the inner connection of parameter dimensions and alloting a more vital relevance to the small class data weight parameter. The theoretic proofs and several numeric studies demonstrate the merits of our two proposed algorithms.
4 July 2024 in Maritime Policy & Management
1. Safety is an eternal theme in the maritime world. Along with the sustainable development of the international shipping industry and the rising ocean economy, people are increasingly concerned ab...
23 October 2021 in Mathematical Problems in Engineering
To address the imbalanced data problem in classification, the studies of the combination of AdaBoost, short for “Adaptive Boosting,” and cost-sensitive learning have shown convincing results in the literature. The cost-sensitive AdaBoost algorithms are practical since the “boosting” property in AdaBoost can iteratively enhance the small class of the cost-sensitive learning to solve the imbalanced data issue. However, the most available cost-sensitive AdaBoost algorithms are heuristic approaches, which are improved from the standard AdaBoost algorithm by cost-sensitively adjusting the voting weight parameters of weak classifiers or the sample updating weight parameters without strict theoretic proof. The algorithms are appended the cost-sensitive factors to focus on the high-cost and small-class samples, but they have no procedures to show the best place to add the cost factors and the cost factor value set. To complete the cost-sensitive AdaBoost algorithms’ framework, the present article has two main contributions. First, we summarize the popular cost-sensitive boosting algorithms in the literature and propose a generally comprehensive form. We name our specific one, the “AdaImC algorithm,” which is typically appliable to solve the imbalanced data classification problem with theoretic proof. Second, a statistical approach to prove the AdaImC algorithm is proposed to verify the inner relationship between the cost parameters. We show that our proposed algorithm in the machine learning field is identical to the Product of Experts (PoE) model in the statistics field. Besides, a way to determine the cost parameter value by the statistical analysis is introduced. Several numeric studies are listed finally to support our proposed algorithm.