# Results Merging in the Patent Domain

arXiv: https://arxiv.org/abs/2203.00350 · HTML: https://mlsanity.com/paper/2203.00350/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Mar 2022.

## Built on by (most cited first, 1 of 1)

- [Patent Novelty Assessment Accelerating Innovation and Patent Prosecution](https://mlsanity.com/paper/2501.06956/) (2025)

## Abstract (arXiv)

In this paper, we test machine learning methods for results merging in patent document retrieval. Specifically, we examine random forest, decision tree, support vector machine (SVR), linear regression, polynomial regression, and deep neural networks (DNNs). We use two different methods for results merging, the multiple models (MM) method and the global model method (GM). Furthermore, we examine whether the ranking of the document's scores is linearly explainable. The CLEF-IP 2011 standard test collection was used in our experiments. The random forest produces the best results in comparison to all other models, and it fits the data better than linear and polynomial approaches.