~30 unique US inventions (84-entry WIPO corpus) by Christopher J. C. Burges, the Microsoft Research scientist who invented the RankNet/LambdaRank/LambdaMART learning-to-rank lineage. RankNet (US 7,689,615) is the pairwise neural ranker; LambdaRank (US 7,617,164) is the arbitrary-cost extension that optimizes NDCG; LambdaMART (US 12/032,697) is the gradient-boosted ensemble that won the Yahoo LTR Challenge 2010. Also covers behavioral-variability adaptation, web-page multi-graph analysis, link-spam smoothing, margin-tree boosting, k-NN probability estimation. Spans 2001 to 2019. Co-authors include Robert Ragno (LambdaRank), Irina Matveeva, Timo Burkard.
About the Christopher Burges, Microsoft Research Learning-to-Rank Patents track
~30 unique US inventions (84-entry WIPO corpus) by Christopher J. C. Burges, the Microsoft Research scientist who invented the RankNet/LambdaRank/LambdaMART learning-to-rank lineage. RankNet (US 7,689,615) is the pairwise neural ranker; LambdaRank (US 7,617,164) is the arbitrary-cost extension that optimizes NDCG; LambdaMART (US 12/032,697) is the gradient-boosted ensemble that won the Yahoo LTR Challenge 2010. Also covers behavioral-variability adaptation, web-page multi-graph analysis, link-spam smoothing, margin-tree boosting, k-NN probability estimation. Spans 2001 to 2019. Co-authors include Robert Ragno (LambdaRank), Irina Matveeva, Timo Burkard.
Learning-to-Rank Trinity
- Ranking Results Using Multiple Nested Ranking (RankNet) (US 7,689,615 · March 30, 2010)
- Efficiency of Training for Ranking Systems Based on Pairwise Training with Aggregated Gradients (LambdaRank) (US 7,617,164 · November 10, 2009)
- Training a Learning System with Arbitrary Cost Functions (LambdaRank app) (US App 11/305,395 · December 16, 2005)
- Boosting a Ranker for Improved Ranking Accuracy (LambdaMART) (US App 12/032,697 · February 18, 2008)
- Linear Combination of Rankers (US App 12/836,660 · July 14, 2010)
- Linear Combination of Rankers (app 2007) (US App 11/975,518 · October 19, 2007)
- System and Method for Learning Ranking Functions on Data (US App 11/462,932 · August 7, 2006)
Behavioral & Spam-Resistant Ranking
- Accounting for Behavioral Variability in Web Search (US App 11/904,103 · September 26, 2007)
- Smooth Link-Spam Classification (US App 13/921,862 · June 19, 2013)
- Link-Spam Smoothing (2008 app) (US App 11/901,072 · September 14, 2007)
- Web-Page Analysis Multi-Graph (US App 11/901,049 · September 14, 2007)
- Re-Ranking Top Results (US App 12/421,022 · April 9, 2009)
ML Infrastructure
- Margin-Based Tree Classification (US App 10/179,049 · June 24, 2002)
- K-Nearest-Neighbor Probability Estimation (US App 11/296,919 · December 8, 2005)
- Semi-Supervised Graphical Model Training (US App 11/170,989 · June 29, 2005)
- Auto Playlist Generator (US App 09/870,292 · May 30, 2001)
Why this inventor matters
Each inventor track inside the Nizam SEO War Room patents archive isolates one engineer's research arc — typically a decade or more of continuations, divisionals, and follow-up patents on a coherent research thread. Reading by inventor (rather than by topic) recovers the narrative: how the original disclosure evolved, what the continuations added, which claims got carved out into divisional applications, and how the thread eventually intersected with other research lines at Google or Microsoft. This is how working SEOs build durable intuition about search-engine internals — not by memorizing claim language, but by following the research bibliography that shipped the algorithms we now optimize against.
How to read this track
Start with the earliest filing — it sets the foundational disclosure. Continuations refine the claims; divisional applications split out separable inventions; the follow-up patents tend to introduce performance optimizations, edge-case handling, or downstream integration with other systems. Each patent on this site is annotated with the ranking surface it touches — query understanding, document retrieval, ranking, behavioral signals, knowledge graph, or AI search — so the practitioner can map the research back to the algorithm output observed on live SERPs.