On the public citation graph

Optimizing Estimated Loss Reduction for Active Sampling in Rank Learning

0 signed · 12 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-23808-6_16openalex-snapshot
Rule-Based Active Sampling for Learning to Rank
inferred← citeshttps://doi.org/10.1007/978-3-662-44848-9_14openalex-snapshot
Active Learning for Support Vector Machines with Maximum Model Change
inferred← citeshttps://doi.org/10.1109/icmlc.2009.5212408openalex-snapshot
A query-level active sampling approach for learning to rank
inferred← citeshttps://doi.org/10.1109/ijcnn.2019.8852041openalex-snapshot
Active Learning with Interpretable Predictor
inferred← citeshttps://doi.org/10.1145/3077136.3080684openalex-snapshot
The Impact of Linkage Methods in Hierarchical Clustering for Active Learning to Rank
inferred← citeshttps://doi.org/10.1145/3086820openalex-snapshot
Active Learning for Classification with Maximum Model Change
inferred← citeshttps://doi.org/10.17148/iarjset/nciarcse.2017.29openalex-snapshot
Modified Active Learning for Document Level Clustering
inferred← citeshttps://doi.org/10.17148/ijarcce.2017.6590openalex-snapshot
“Active Learning for Ranking through Expected Loss Optimization” based on Data Mining
inferred← citeshttps://doi.org/10.17760/d20002915openalex-snapshot
Collection construction methodologies for learning to rank
inferred← citeshttps://doi.org/10.18178/ijmlc.2020.10.3.950openalex-snapshot
Sampling Non-relevant Documents of Training Sets for Learning-to-Rank Algorithms
inferred← citeshttps://doi.org/10.21275/v4i12.nov151889openalex-snapshot
Ranking Models and Learning to Rank: A Survey
inferred← citeshttps://doi.org/10.48047/nq.2021.19.7.nq21126openalex-snapshot
The Expected Loss Optimization Framework for Active Learning for Ranking
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.