动态逻辑集成模型自动分组,提升复杂分类准确率
Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification
- 通过递归概率计算自动划分数据集,构建多子集逻辑回归集成
- 在模拟群体结构的数据上,层数增加显著提升分类性能
- 兼顾可解释性与效率,适合需要透明决策的高风险场景
本文提出一种基于动态逻辑集成的二分类新方法,针对内部存在聚类但无明显特征分离的数据集。通过扩展传统逻辑回归,算法自动将数据划分为多个子集,构建逻辑回归集成模型以提升分类精度。核心创新在于通过代数推导和数学归纳法实现递归概率计算,支持高效、可扩展的模型构建。相较传统集成方法如Bagging和Boosting,本方法保持可解释性的同时表现相当。进一步利用最大似然和代价函数,解析推导出递归梯度作为集成深度的函数。在人工构造的数据集上验证有效性,该数据集通过引入噪声和偏移模拟群体结构,结果显示随着层数增加性能显著提升。代码已开源,实现兼顾计算效率与理论严谨性,为复杂分类任务提供稳健且可解释的解决方案。
原文摘要 · Abstract (English)
This paper presents a novel approach to binary classification using dynamic logistic ensemble models. The proposed method addresses the challenges posed by datasets containing inherent internal clusters that lack explicit feature-based separations. By extending traditional logistic regression, we develop an algorithm that automatically partitions the dataset into multiple subsets, constructing an ensemble of logistic models to enhance classification accuracy. A key innovation in this work is the recursive probability calculation, derived through algebraic manipulation and mathematical induction, which enables scalable and efficient model construction. Compared to traditional ensemble methods such as Bagging and Boosting, our approach maintains interpretability while offering competitive performance. Furthermore, we systematically employ maximum likelihood and cost functions to facilitate the analytical derivation of recursive gradients as functions of ensemble depth. The effectiveness of the proposed approach is validated on a custom dataset created by introducing noise and shifting data to simulate group structures, resulting in significant performance improvements with layers. Implemented in Python, this work balances computational efficiency with theoretical rigor, providing a robust and interpretable solution for complex classification tasks with broad implications for machine learning applications. Code at https://github.com/ensemble-art/Dynamic-Logistic-Ensembles
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。