On the public citation graph

X-CLE a VER

0 signed · 37 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-57868-4_56openalex-snapshot
Bottom-up induction of oblivious read-once decision graphs
inferredcites →https://doi.org/10.1007/978-3-031-02298-2openalex-snapshot
Scalability Challenges in Web Search Engines
inferredcites →https://doi.org/10.1007/978-3-642-36973-5_13openalex-snapshot
Training Efficient Tree-Based Models for Document Ranking
inferredcites →https://doi.org/10.1007/978-3-642-36973-5_36openalex-snapshot
Two-Stage Learning to Rank for Information Retrieval
inferredcites →https://doi.org/10.1007/bf00116251openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1007/s10791-009-9112-1openalex-snapshot
Adapting boosting for information retrieval measures
inferredcites →https://doi.org/10.1007/s10791-012-9209-9openalex-snapshot
The whens and hows of learning to rank for web search
inferredcites →https://doi.org/10.1016/j.ipm.2016.05.004openalex-snapshot
Quality versus efficiency in document scoring with learning-to-rank models
inferredcites →https://doi.org/10.1016/j.patcog.2014.03.021openalex-snapshot
Exploration of classification confidence in ensemble learning
inferredcites →https://doi.org/10.1109/cvpr.2015.7298672openalex-snapshot
Global refinement of random forest
inferredcites →https://doi.org/10.1109/tkde.2013.73openalex-snapshot
Runtime Optimizations for Tree-Based Machine Learning Models
inferredcites →https://doi.org/10.1111/j.2517-6161.1996.tb02080.xopenalex-snapshot
Regression Shrinkage and Selection Via the Lasso
inferredcites →https://doi.org/10.1145/1183614.1183698openalex-snapshot
Optimisation methods for ranking functions with multiple parameters
inferredcites →https://doi.org/10.1145/1321440.1321528openalex-snapshot
A comparison of statistical significance tests for information retrieval evaluation
inferredcites →https://doi.org/10.1145/1718487.1718538openalex-snapshot
Early exit optimizations for additive machine learned ranking systems
inferredcites →https://doi.org/10.1145/1835449.1835475openalex-snapshot
Learning to efficiently rank
inferredcites →https://doi.org/10.1145/2487575.2487630openalex-snapshot
Direct optimization of ranking measures for learning to rank models
inferredcites →https://doi.org/10.1145/2766462.2767733openalex-snapshot
QuickScorer
inferredcites →https://doi.org/10.1145/2911451.2914758openalex-snapshot
Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles
inferredcites →https://doi.org/10.1145/2911451.2914763openalex-snapshot
Post-Learning Optimization of Tree Ensembles for Efficient Ranking
inferredcites →https://doi.org/10.1145/2987380openalex-snapshot
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees
inferredcites →https://doi.org/10.1145/582415.582418openalex-snapshot
Cumulated gain-based evaluation of IR techniques
inferredcites →https://doi.org/10.1214/aos/1013203451openalex-snapshot
Greedy function approximation: A gradient boosting machine.
inferredcites →https://doi.org/10.1561/1500000016openalex-snapshot
Learning to Rank for Information Retrieval
inferredcites →https://doi.org/10.1609/aaai.v29i1.9579openalex-snapshot
Pareto Ensemble Pruning
inferredcites →https://doi.org/10.48550/arxiv.1606.05060openalex-snapshot
Pruning Random Forests for Prediction on a Budget
inferredcites →https://doi.org/10.7551/mitpress/1113.003.0010openalex-snapshot
Large Margin Rank Boundaries for Ordinal Regression

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-030-99736-6_18openalex-snapshot
Ensemble Model Compression for Fast and Energy-Efficient Ranking on FPGAs
inferred← citeshttps://doi.org/10.1007/s10618-023-00921-zopenalex-snapshot
Joint leaf-refinement and ensemble pruning through $$L_1$$ regularization
inferred← citeshttps://doi.org/10.1007/s13042-020-01217-0openalex-snapshot
Dynamic pricing in profit-driven task assignment: a domain-of-influence based approach
inferred← citeshttps://doi.org/10.1109/access.2020.2986943openalex-snapshot
Effective Lightweight Learning-to-Rank Method Using Unified Term Impacts
inferred← citeshttps://doi.org/10.1109/access.2023.3331088openalex-snapshot
Early Exit Strategies for Learning-to-Rank Cascades
inferred← citeshttps://doi.org/10.1109/tcyb.2021.3109796openalex-snapshot
Evolving Gradient Boost: A Pruning Scheme Based on Loss Improvement Ratio for Learning Under Concept Drift
inferred← citeshttps://doi.org/10.1145/3209978.3210048openalex-snapshot
Selective Gradient Boosting for Effective Learning to Rank
inferred← citeshttps://doi.org/10.1145/3331184.3334824openalex-snapshot
Learning to Rank in Theory and Practice
inferred← citeshttps://doi.org/10.1145/3397271.3401256openalex-snapshot
Query-level Early Exit for Additive Learning-to-Rank Ensembles
inferred← citeshttps://doi.org/10.1145/3477495.3531740openalex-snapshot
The Istella22 Dataset
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.