ArticleBiomimetics (Basel, Switzerland)2025
High-Value Patents Recognition with Random Forest and Enhanced Fire Hawk Optimization Algorithm.
Article in Biomimetics (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- A CD index guided ensemble framework for screening potentially disruptive patent candidates in artificial intelligence.Scientific reports · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
High-value patents are a key indicator of new product development, the emergence of innovative technology, and a source of innovation incentives. Multiple studies have shown that patent value exhibits a significantly skewed distribution, with only about 10% of patents having high value. Identifying high-value patents from a large volume of patent data in advance has become a crucial problem that needs to be addressed urgently. However, current machine learning methods often rely on manual hyperparameter tuning, which is time-consuming and prone to suboptimal results. Existing optimization algorithms also suffer from slow convergence and local optima issues, limiting their effectiveness on complex patent datasets. In this paper, machine learning and intelligent optimization algorithms are combined to process and analyze the patent data. The Fire Hawk Optimization Algorithm (FHO) is a novel intelligence algorithm suggested in recent years, inspired by the process in nature where Fire Hawks capture prey by setting fires. This paper firstly proposes the Enhanced Fire Hawk Optimizer (EFHO), which combines four strategies, namely adaptive tent chaotic mapping, hunting prey, adding the inertial weight, and enhanced flee strategy to address the weakness of FHO development. Benchmark tests demonstrate EFHO's superior convergence speed, accuracy, and robustness across standard optimization benchmarks. As a representative real-world application, EFHO is employed to optimize Random Forest hyperparameters for high-value patent recognition. While other intelligent optimizers could be applied, EFHO effectively overcomes common issues like slow convergence and local optima trapping. Compared to other classification methods, the EFHO-optimized Random Forest achieves superior accuracy and classification stability. This study fills a research gap in effective hyperparameter tuning for patent recognition and demonstrates EFHO's practical value on real-world patent datasets.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.