GKF-PUAL: A group kernel-free approach to positive-unlabeled learning with variable selection

Variable selection is important for classification of data with many irrelevant predicting variables, but it has not yet been well studied in positive-unlabeled (PU) learning, where classifiers have to be trained without labelled-negative instances. In this paper, we propose a group kernel-free PU classifier with asymmetric loss (GKF-PUAL) to achieve quadratic PU classification with group-lasso regularisation embedded for variable selection. We also propose a five-block algorithm to solve the optimization problem of GKF-PUAL. Our experimental results reveal the superiority of GKF-PUAL in both PU classification and variable selection, improving the baseline PUAL by more than 10% in F1-score across four benchmark datasets and removing over 70% of irrelevant variables on six benchmark datasets. The code for GKF-PUAL is at https://github.com/tkks22123/GKF-PUAL . • We propose a group kernel-free PU classifier (GKF-PUAL) with variable selection. • We propose a five-block algorithm for optimization of GKF-PUAL. • Experimental results verify the superiority of GKF-PUAL.

Authors

Institutions

Publication Details

Journal
Information Sciences
Published
2024-10-22
DOI
https://doi.org/10.1016/j.ins.2024.121574
Primary Topic
Machine Learning and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GKF-PUAL: A group kernel-free approach to positive-unlabeled learning with variable selection

Rui Zhu, Jing‐Hao Xue, Xiaoke Wang
Information Sciences
Machine Learning and Algorithms
article

GKF-PUAL: A group kernel-free approach to positive-unlabeled learning with variable selection

Rui Zhu, Jing‐Hao Xue, Xiaoke Wang
article en

Abstract

Variable selection is important for classification of data with many irrelevant predicting variables, but it has not yet been well studied in positive-unlabeled (PU) learning, where classifiers have to be trained without labelled-negative instances. In this paper, we propose a group kernel-free PU classifier with asymmetric loss (GKF-PUAL) to achieve quadratic PU classification with group-lasso regularisation embedded for variable selection. We also propose a five-block algorithm to solve the optimization problem of GKF-PUAL. Our experimental results reveal the superiority of GKF-PUAL in both PU classification and variable selection, improving the baseline PUAL by more than 10% in F1-score across four benchmark datasets and removing over 70% of irrelevant variables on six benchmark datasets. The code for GKF-PUAL is at https://github.com/tkks22123/GKF-PUAL . • We propose a group kernel-free PU classifier (GKF-PUAL) with variable selection. • We propose a five-block algorithm for optimization of GKF-PUAL. • Experimental results verify the superiority of GKF-PUAL.

Information SciencesVol. 690
City, University of London (GB), University College London (GB)
Openalex Percentile: Top 84%
Machine Learning and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.