The following pages link to (Q4247005):
Displaying 13 items.
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- Grey-box steganography (Q393133) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- A biased least squares support vector machine based on Mahalanobis distance for PU learning (Q2153189) (← links)
- On the noise estimation statistics (Q2238618) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Learning from positive and unlabeled examples (Q2581364) (← links)
- Learning naive Bayes classifiers from positive and unlabelled examples with uncertainty (Q2935076) (← links)
- Grey-Box Steganography (Q3010419) (← links)
- (Q4370220) (← links)
- Single-class classification with mapping convergence (Q5896775) (← links)
- Single-class classification with mapping convergence (Q5920545) (← links)
- \(L_1\)-penalized fraud detection support vector machines (Q6134388) (← links)
