: Imbalanced data remain a critical challenge in classification, as skewed distributions bias models toward majority classes and diminish sensitivity to minority classes, which are often the most critical. To address this issue, this paper proposes the Information Filtered Hybrid Algorithm (IF-HA), a novel entropy-based sampling method that integrates undersampling and oversampling guided by information theory. IF-HA quantifies instance importance through an instance-wise difference statistic. In the undersampling stage, majority of instances with low difference statistics in the border area are eliminated, while in the oversampling stage, synthetic samples are generated from two minority core points or two minority instances with high difference statistics located in the border area. This process removes noise, eliminates redundant majority border points, and generates synthetic minority samples in informative regions until an entropy-based imbalance threshold is reached. The proposed algorithm is evaluated on 20 benchmark datasets from the UCI and KEEL repositories. Results demonstrate that IF-HA consistently improves minority detection and achieves higher F1 Scores, recall, and AUC (Area Under the Curve) than other methods, including SMOTE, Borderline-SMOTE, ADASYN (Adaptive Synthetic Sampling), and SMOTE-TLNN-DEPSO. A real-world tuberculosis (TB) dataset from Indonesia was further used to validate the practical applicability of IF-HA using KNN, Random Forest, and XGBoost (eXtreme Gradient Boosting) classifiers. The results show consistent improvements after applying IF-HA. These findings indicate that entropy-based hybrid sampling is a promising approach for structured tabular imbalanced classification, while further validation on high-dimensional text and image datasets remains necessary to establish broader generalizability.
R. Kuo, Muhammad Rizki, F. E. Zulvia et al.· Computers, Materials & C...· 0 citations
In neural topic modeling, the reliability of a document representation varies from one document to the next: a syntactic view drawn from a dependency graph is informative when the parse is well formed, whereas a semantic view drawn from a pretrained transformer is more dependable when the parse is sparse or fragmented. Existing hybrid models combine the two views with a fixed rule, set once for the whole corpus through concatenation, averaging, or a constant weight, so the locally less reliable view is over-weighted on individual documents. To close these gaps, a Graph-Adapted Semantic Topic Model with Instance-Aware Dual-View Fusion (GASTM) is proposed. Within a variational autoencoder, a GGNN-based dependency encoder and a pretrained transformer semantic encoder are kept jointly trainable, while corpus-wide lexical statistics are carried through a learnable node embedding on the graph branch. A continuous per-document fusion weight is then produced by an instance-aware adaptive gate, allowing the two views to be combined in a controlled manner before reaching the latent inference space. On five benchmarks, GASTM is shown to consistently outperform the baselines on both topic quality and downstream classification. A fusion-type ablation further yields counterintuitive findings that support the effectiveness of the adaptive gate strategy over static alternatives.
R. Kuo, Thi-Thuy-Quynh Trinh· IEEE Access· 0 citations