Near-Optimal Differentially Private k-Center for Service Computing With Access Control近最优差分隐私k-中心算法在服务计算与访问控制中的应用IEEE Transactions on Services ComputingIF5.82026-04-230PRE
Efficient Algorithm for the k-Means Problem with Must-Link and Cannot-Link ConstraintsTSINGHUA SCIENCE AND TECHNOLOGYIF3.52023-12-011OA