On the public citation graph

Ranking with a P-Norm Push

0 signed · 51 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.1006/jcss.1997.1504openalex-snapshot
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
inferredcites →https://doi.org/10.1007/11503415_1openalex-snapshot
Ranking and Scoring Using Empirical Risk Minimization
inferredcites →https://doi.org/10.1007/11503415_5openalex-snapshot
Margin-Based Ranking Meets Boosting in the Middle
inferredcites →https://doi.org/10.1007/bf02530506openalex-snapshot
New approaches to statistical learning theory
inferredcites →https://doi.org/10.1016/s0925-2312(97)90018-7openalex-snapshot
Advances in neural information processing systems 7
inferredcites →https://doi.org/10.1023/a:1013912006537openalex-snapshot
Logistic Regression, AdaBoost and Bregman Distances
inferredcites →https://doi.org/10.1090/s0273-0979-01-00923-5openalex-snapshot
On the mathematical foundations of learning
inferredcites →https://doi.org/10.1162/0891201053630273openalex-snapshot
Discriminative Reranking for Natural Language Parsing
inferredcites →https://doi.org/10.1162/jmlr.2003.4.6.933openalex-snapshot
10.1162/jmlr.2003.4.6.933
inferredcites →https://doi.org/10.1214/aos/1015362183openalex-snapshot
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
inferredcites →https://doi.org/10.7551/mitpress/1120.003.0087openalex-snapshot
Pranking with Ranking

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-540-87987-9_21openalex-snapshot
Smooth Boosting for Margin-Based Ranking
inferred← citeshttps://doi.org/10.1007/978-3-642-12275-0_30openalex-snapshot
Maximum Margin Ranking Algorithms for Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-14125-6_3openalex-snapshot
Label Ranking Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-14267-3_3openalex-snapshot
The Pairwise Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-24097-3_30openalex-snapshot
Generalization Bounds of Ranking via Query-Level Stability I
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_26openalex-snapshot
Approximate Reduction from AUC Maximization to 1-Norm Soft Margin Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-34240-0_34openalex-snapshot
Ontology Mapping on Multi-ontology Graphs via Optimizing Ranking Function
inferred← citeshttps://doi.org/10.1007/s00365-010-9084-9openalex-snapshot
Overlaying Classifiers: A Practical Approach to Optimal Scoring
inferred← citeshttps://doi.org/10.1007/s10207-020-00515-6openalex-snapshot
A quantitative assessment of security risks based on a multifaceted classification approach
inferred← citeshttps://doi.org/10.1016/j.csl.2010.05.002openalex-snapshot
Semi-supervised ranking for document retrieval
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.05.013openalex-snapshot
Fast rates for ranking with large families
inferred← citeshttps://doi.org/10.1016/j.neucom.2017.02.018openalex-snapshot
Oracle inequalities for ranking and U -processes with Lasso penalty
inferred← citeshttps://doi.org/10.1080/08839514.2015.983014openalex-snapshot
A Novel Crossing Minimization Ranking Method
inferred← citeshttps://doi.org/10.1080/10485252.2017.1369078openalex-snapshot
Model selection consistency of U-statistics with convex loss and weighted lasso penalty
inferred← citeshttps://doi.org/10.1109/cvpr.2008.4587623openalex-snapshot
Improving local learning for object categorization by exploring the effects of ranking
inferred← citeshttps://doi.org/10.1109/iccrd.2011.5763955openalex-snapshot
Generalization bounds for ranking algorithms via almost everywhere stability
inferred← citeshttps://doi.org/10.1109/icdar.2019.00238openalex-snapshot
Logo Design Analysis by Ranking
inferred← citeshttps://doi.org/10.1109/icip.2009.5414269openalex-snapshot
Context ranking machine and its application to rigid localization of deformable objects
inferred← citeshttps://doi.org/10.1109/icitis.2010.5689665openalex-snapshot
Stability analysis for ranking algorithms
inferred← citeshttps://doi.org/10.1109/tit.2008.929939openalex-snapshot
Statistical Analysis of Bayes Optimal Subset Ranking
inferred← citeshttps://doi.org/10.1109/tmm.2007.906597openalex-snapshot
Improving Semantic Concept Detection Through Optimizing Ranking Function
inferred← citeshttps://doi.org/10.1145/1273496.1273498openalex-snapshot
Learning random walks to rank nodes in graphs
inferred← citeshttps://doi.org/10.1145/1281192.1281205openalex-snapshot
Real-time ranking with concept drift using expert advice
inferred← citeshttps://doi.org/10.1145/1390334.1390379openalex-snapshot
Learning to rank with partially-labeled data
inferred← citeshttps://doi.org/10.1145/2348283.2348384openalex-snapshot
Top-k learning to rank
inferred← citeshttps://doi.org/10.1145/2396761.2398681openalex-snapshot
A new probabilistic model for top-k ranking problem
inferred← citeshttps://doi.org/10.1214/009052607000000910openalex-snapshot
Ranking and Empirical Minimization of U-statistics
inferred← citeshttps://doi.org/10.1214/13-ejs805openalex-snapshot
Upper bounds and aggregation in bipartite ranking
inferred← citeshttps://doi.org/10.1214/21-ejs1907openalex-snapshot
Concentration inequalities for two-sample rank processes with application to bipartite ranking
inferred← citeshttps://doi.org/10.1214/25-ejs2392openalex-snapshot
A bipartite ranking approach to the two-sample problem
inferred← citeshttps://doi.org/10.1587/transinf.2017edp7233openalex-snapshot
Efficient Reformulation of 1-Norm Ranking SVM
inferred← citeshttps://doi.org/10.3115/1631828.1631835openalex-snapshot
Re-ranking algorithms for name tagging
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.267.456openalex-snapshot
Generalization Bounds for Certain Class of Ranking Algorithm
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.748.1051openalex-snapshot
Supervised Multidimensional Scaling for Ontology Similarity Measure and Ontology Mapping via Multi-Dividing
inferred← citeshttps://doi.org/10.48550/arxiv.0704.3359openalex-snapshot
Direct Optimization of Ranking Measures
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4597openalex-snapshot
Learning to Blend by Relevance
inferred← citeshttps://doi.org/10.48550/arxiv.1512.05698openalex-snapshot
Oracle inequalities for ranking and U-processes with Lasso penalty
inferred← citeshttps://doi.org/10.48550/arxiv.2002.08159openalex-snapshot
Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611133openalex-snapshot
Ranking the best instances
inferred← citeshttps://doi.org/10.70675/5bdaaedcz78d8z48aczb5e6zc178ffa29310openalex-snapshot
Ordonnancement par similarité pour la biométrie : théorie et pratique
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.