On the public citation graph

Margin-Based Ranking Meets Boosting in the Middle

0 signed · 58 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.1002/0471667196.ess0047.pub2openalex-snapshot
Annals of the Institute of Statistical Mathematics
inferredcites →https://doi.org/10.1006/game.1999.0738openalex-snapshot
Adaptive Game Playing Using Multiplicative Weights
inferredcites →https://doi.org/10.1007/10463.1572-9052openalex-snapshot
Annals of the Institute of Statistical Mathematics
inferredcites →https://doi.org/10.1007/978-3-540-27819-1_35openalex-snapshot
Boosting Based on a Smooth Margin
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.1214/aos/1015362183openalex-snapshot
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
inferredcites →https://doi.org/10.1214/aos/1016218223openalex-snapshot
Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
inferredcites →https://doi.org/10.1214/aos/1024691352openalex-snapshot
Boosting the margin: a new explanation for the effectiveness of voting methods
inferredcites →https://doi.org/10.21236/ada350721openalex-snapshot
Machine Learning: Proceedings of the Fifteenth International Conference
inferredcites →https://doi.org/10.5555/1005332.1044712openalex-snapshot
The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118562796.ch2openalex-snapshot
Learnable Ranking Models for Automatic Text Summarization and Information Retrieval
inferred← citeshttps://doi.org/10.1007/11776420_43openalex-snapshot
Ranking with a P-Norm Push
inferred← citeshttps://doi.org/10.1007/11871842_37openalex-snapshot
Boosting in PN Spaces
inferred← citeshttps://doi.org/10.1007/11894841_26openalex-snapshot
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-031-99928-4_7openalex-snapshot
Learning-to-Rank
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_1openalex-snapshot
An Alternative Ranking Problem for Search Engines
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_43openalex-snapshot
Robust Reductions from Ranking to Classification
inferred← citeshttps://doi.org/10.1007/978-3-540-74958-5_2openalex-snapshot
Putting Things in Order: On the Fundamental Role of Ranking in Classification and Probability Estimation
inferred← citeshttps://doi.org/10.1007/978-3-540-74958-5_33openalex-snapshot
Hinge Rank Loss and the Area Under the ROC Curve
inferred← citeshttps://doi.org/10.1007/978-3-540-74958-5_60openalex-snapshot
An Unsupervised Learning Algorithm for Rank Aggregation
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-14980-1_64openalex-snapshot
A Linear Combination of Classifiers via Rank Margin Maximization
inferred← citeshttps://doi.org/10.1007/s10994-008-5058-6openalex-snapshot
Robust reductions from ranking to classification
inferred← citeshttps://doi.org/10.1007/s10994-010-5176-9openalex-snapshot
Preference-based learning to rank
inferred← citeshttps://doi.org/10.1007/s10994-010-5185-8openalex-snapshot
Learning to rank on graphs
inferred← citeshttps://doi.org/10.1007/s10994-012-5325-4openalex-snapshot
Ranking data with ordinal labels: optimality and pairwise aggregation
inferred← citeshttps://doi.org/10.1007/s10994-019-05826-xopenalex-snapshot
Rankboost$$+$$: an improvement to Rankboost
inferred← citeshttps://doi.org/10.1016/j.patcog.2007.11.017openalex-snapshot
Maximizing the area under the ROC curve by pairwise feature combination
inferred← citeshttps://doi.org/10.1016/j.physd.2020.132676openalex-snapshot
Ranking with hamiltonian dynamics
inferred← citeshttps://doi.org/10.1080/00207160.2017.1322688openalex-snapshot
Analysis of k -partite ranking algorithm in area under the receiver operating characteristic curve criterion
inferred← citeshttps://doi.org/10.1080/10485252.2014.967770openalex-snapshot
The TreeRank Tournament algorithm for multipartite ranking
inferred← citeshttps://doi.org/10.1109/ijcnn.2006.1716080openalex-snapshot
Learning to Rank by Maximizing AUC with Linear Programming
inferred← citeshttps://doi.org/10.1109/mlsp.2011.6064638openalex-snapshot
Optimization of average precision with Maximal Figure-of-Merit Learning
inferred← citeshttps://doi.org/10.1109/tmm.2007.906597openalex-snapshot
Improving Semantic Concept Detection Through Optimizing Ranking Function
inferred← citeshttps://doi.org/10.1117/12.749062openalex-snapshot
JBC: Joint Boost Clustering method for synthesis aperture radar images
inferred← citeshttps://doi.org/10.1145/1273496.1273513openalex-snapshot
Learning to rank
inferred← citeshttps://doi.org/10.1145/1273496.1273518openalex-snapshot
Magnitude-preserving ranking algorithms
inferred← citeshttps://doi.org/10.1145/1388240.1388242openalex-snapshot
Theory research at Google
inferred← citeshttps://doi.org/10.1145/1900008.1900052openalex-snapshot
Learning to rank using 1-norm regularization and convex hull reduction
inferred← citeshttps://doi.org/10.1145/2064988.2064992openalex-snapshot
Adding smarter systems instead of human annotators
inferred← citeshttps://doi.org/10.11606/t.55.2006.tde-01092006-155445openalex-snapshot
"Novas abordagens em aprendizado de máquina para a geração de regras, classes desbalanceadas e ordenação de casos"
inferred← citeshttps://doi.org/10.1214/009053607000000785openalex-snapshot
Analysis of boosting algorithms using the smooth margin function
inferred← citeshttps://doi.org/10.1214/25-ejs2392openalex-snapshot
A bipartite ranking approach to the two-sample problem
inferred← citeshttps://doi.org/10.15765/e.v3i3.413openalex-snapshot
Boosting en el modelo de aprendizaje PAC
inferred← citeshttps://doi.org/10.17877/de290r-872openalex-snapshot
Scalable and accurate knowledge discovery in real world databases
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.48550/arxiv.0710.2889openalex-snapshot
An efficient reduction of ranking to classification
inferred← citeshttps://doi.org/10.48550/arxiv.1301.5332openalex-snapshot
Online Learning with Pairwise Loss Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01118openalex-snapshot
Learning how to rank from heavily perturbed statistics - digraph clustering approach
inferred← citeshttps://doi.org/10.48550/arxiv.1804.05981openalex-snapshot
A Univariate Bound of Area Under ROC
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13659openalex-snapshot
Uncoupled Regression from Pairwise Comparison Data
inferred← citeshttps://doi.org/10.48550/arxiv.2107.01285openalex-snapshot
Optimizing ROC Curves with a Sort-Based Surrogate Loss Function for Binary Classification and Changepoint Detection
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611133openalex-snapshot
Ranking the best instances
inferred← citeshttps://doi.org/10.7551/mitpress/10290.001.0001openalex-snapshot
Foundations of Machine Learning
inferred← citeshttps://doi.org/10.7907/7b0f-e145.openalex-snapshot
From ordinal ranking to binary classification
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.