AI RESEARCH
A proposal for PU classification under Non-SCAR using clustering and logistic model
arXiv CS.LG
•
ArXi:2604.17130v1 Announce Type: cross The present study aims to investigate a cluster cleaning algorithm that is both computationally simple and capable of solving the PU classification when the SCAR condition is unsatisfied. A secondary objective of this study is to determine the robustness of the LassoJoint method to perturbations of the SCAR condition. In the first step of our algorithm, we obtain cleaning labels from 2-means clustering.