2020
DOI: 10.1089/cmb.2019.0329
|View full text |Cite
|
Sign up to set email alerts
|

Learning Robust Multilabel Sample Specific Distances for Identifying HIV-1 Drug Resistance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…Furthermore, weighted categorical kernel functions were introduced to evaluate the contribution of different positions on the resistance prediction [ 15 ]. Recently, Brand expanded the application of the prediction model and proposed a multi-label classification model to predict the cross-resistance between RT sequences and five nucleoside analogs [ 16 ].…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, weighted categorical kernel functions were introduced to evaluate the contribution of different positions on the resistance prediction [ 15 ]. Recently, Brand expanded the application of the prediction model and proposed a multi-label classification model to predict the cross-resistance between RT sequences and five nucleoside analogs [ 16 ].…”
Section: Introductionmentioning
confidence: 99%
“…1 demonstrates, when noise exists in data, which is widely existed in real world, the learned projection matrix may deviate from expected significantly. Considering that outliers and noises are difficult to be identified and eliminated in most cases, many researchers focus on improving the robustness of PCA by utilizing 2,p (0 < p < 2) or 1 -norm loss functions to alleviate this problem due to their robustness to noise [13,14,15,16,17,18]. 1 -PCA is proposed to obtain the projection matrix by minimizing the 1 norm reconstruction error [19], which is to decompose an image matrix with a weighted combination of the nuclear norm and of the 1 -norm [20,21].…”
Section: Introductionmentioning
confidence: 99%
“…( 1) by relaxing the nonconvex 0 -norm to a convex one (e.g. 1 -norm) Liu andWang [2015, 2018], Liu et al [2019a], Yang et al [2019], Brand et al [2020] to obtain approximated solutions faster Mairal et al [2009], Wu et al [2018] or by focusing on reducing the computation complexity Rubinstein et al [2008], Gilboa et al [2018].…”
Section: Introductionmentioning
confidence: 99%