arrow
Return

A loss matrix-based alternating optimization method for sparse PU learning

delete2022-12-01
delete2
PRE
AI
邱
邱剑锋 (Jianfeng Qiu)
X
Xiaoqiang Cai
张
张磊 (Lei Zhang)
程
程凡 (Fan Cheng) *
DOI:10.1016/j.swevo.2022.101174delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Positive and unlabeled (PU) learning is an important research topic in machine learning area, whose aim is to learn a good classifier from PU data. Due to its wide applications, a variety of PU algorithms with promising performance have been proposed. However, few of them consider PU learning from high-dimensional PU data. To fill the gap, in this work, we focus on designing the sparse PU classifier. However, it is difficult to achieve it, since the labels of U samples are uncertain. To this end, a loss matrix-based alternating optimization method, named LMAO-PU is proposed, where a two-stage alternating optimization idea is suggested to solve the difficulty in sparse PU learning. Firstly, a loss matrix is designed to measure the classification performance of the PU classifier on U samples. Then, a two-stage alternating optimization under the guide of loss matrix is developed. Specifically, the first stage is to optimize the PU model, aiming to address the challenge of labels uncertainty of U samples, where two objectives, TPR (True Positive Rate) and a suggested LRU (Loss Rate on Unlabeled), are optimized simultaneously. The second stage is to perform the sparse model optimization, where Sparsity and ErrorRate are adopted as the objectives to obtain the sparse model. The two-stage optimization procedure mentioned above is carried alternately and the sparse PU classifier with high quality is finally achieved. Experiments on 10 high-dimensional datasets demonstrate the superiority of proposed method over six state-of-the-art baselines in terms of sparsity, accuracy and area under ROC curve.
Keywords:
Sparse PU learning
Alternating optimization
Loss matrix
Multi-objective evolutionary algorithm

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.2K
Citations:
1.0W

Organization

A
anhui university
Scholars:
1.9W
Papers: 1.2W
Citations: 24
Cited Papers

Cited Papers

Isothermal Dilatometric Study of Sintering in Kaolin
err2012-10-21
err0
PREAI
errJán Ondruška; Anton Trník; Martin Keppert; Igor Medved’; Libor Vozár
errShare
errSave
errShare
errSave
Multi-objective evolutionary algorithm for optimizing the partial area under the ROC curve
err2019-04-01
err13
PREAI
errCheng, Fan; Fu, Guanglong; Zhang, Xingyi; Qiu, Jianfeng
errShare
errSave
Streptozotocin-induced diabetes is associated with altered expression of peptide-encoding mRNAs in rat sensory neurons
err1996-01-01
err0
PREAI
errPeter A. Rittenhouse; James E. Marchand; Juan Chen; Richard M. Kream; Susan E. Leeman
errShare
errSave
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
err2001-07-13
err0
errOAAI
errAmir Herzberg; Stanisław Jarecki; Hugo Krawczyk; Moti Yung
errShare
errSave
A survey on multi-objective evolutionary algorithms for the solution of the environmental/economic dispatch problems
err2018-02-01
err182
PREAI
errQu, B. Y.; Zhu, Y. S.; Jiao, Y. C.; Wu, M. Y.; Suganthan, P. N.; Liang, J. J.
errShare
errSave
Chemical Constituents and Insecticidal Activities ofAjania fruticulosaEssential Oil
err2016-08-17
err0
PREAI
errJun‐Yu Liang; Shan‐Shan Guo; Chun‐Xue You; Wen‐Juan Zhang; Cheng‐Fang Wang; Zhu‐Feng Geng; Zhi‐Wei Deng; Shu‐Shan Du; Ji Zhang
errShare
errSave
researcher View more