arXiv (OAI Expanded)
open access
A proposal for PU classification under Non-SCAR using clustering and logistic model
The present study aims to investigate a cluster cleaning algorithm that is both computationally simple and capable of solving the PU classification when the SCAR condition is unsatisfied. A secondary objective of this study is to determine the robustness of the LassoJoint method to perturbations of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Randomized subspace correction methods for convex optimization#173322
- Subgroup analyses and effect modification with Bayesian kernel machine regression.#1354
- Local Robustness Quantification for Naive Bayes Classifiers and Generative Forests: a General Approach#998900
- Detecção de fraude por Bypass em redes de distribuição de água utilizando machine learning#404642
- An Investigation of Missing Data Methods for Classification Trees#942812
Record · ID 1084183
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive