Dynamic Classification: Leveraging Self-Supervised Classification to Enhance Prediction Performance

In this study, we propose an innovative dynamic classification algorithm aimes at achieving zero missed detections and minimal false positives, critical in safety-critical domains (e.g., medical diagnostics) where undetected cases risk severe outcomes. The algorithm partitions data in a self-supervised learning-generated way, which allows the model to learn from training set to understand the data distribution and thereby divide training set and prediction set into N different subareas. The training and prediction subset in the same subareas will have nearly the same boundary. For each subareas, there will be the same type of model, such as linear or random forest model, to predict the results of that subareas. In addition, algorithm will uses subareas boundary to refine predictions and filter out substandard results without requiring additional models. This approach allows each model to operate within a smaller data range and remove the inaccurate prediction results, thereby improving overall accuracy. Experimental results show that, with minimal data partitioning errors, the algorithm achieves exceptional performance with zero missed detections and minimal false positives, outperforming existing ensembles like XGBoost or LGBM model. Even with larger classification errors, it remains comparable to that of state-of-the-art models. Key innovations include self-supervised classification learning, small-range subset predictions, and optimize the prediction results and eliminate the unqualified ones without the need for additional model support. Although the algorithm still has room for improvement in automatic parameter tuning and efficiency, it demonstrates outstanding performance across multiple datasets. Future work will focus on optimizing the classification components to enhance robustness and adaptability.