Results Merging in the Patent Domain

by   Vasileios Stamatis, et al.

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.


page 1

page 2

page 3

page 4


Brain Inspired Computing Approach for the Optimization of the Thin Film Thickness of Polystyrene on the Glass Substrates

Advent in machine learning is leaving a deep impact on various sectors i...

Evaluating Hospital Case Cost Prediction Models Using Azure Machine Learning Studio

Ability for accurate hospital case cost modelling and prediction is crit...

On Ensembling vs Merging: Least Squares and Random Forests under Covariate Shift

It has been postulated and observed in practice that for prediction prob...

Exoskeleton-Based Multimodal Action and Movement Recognition: Identifying and Developing the Optimal Boosted Learning Approach

This paper makes two scientific contributions to the field of exoskeleto...

Experiments on Learning Based Industrial Bin-picking with Iterative Visual Recognition

This paper shows experimental results on learning based randomized bin-p...

A Sparse Linear Model and Significance Test for Individual Consumption Prediction

Accurate prediction of user consumption is a key part not only in unders...

DeepMerge: Classifying High-redshift Merging Galaxies with Deep Neural Networks

We investigate and demonstrate the use of convolutional neural networks ...