Computing Patent Similarity Based on Hierarchical Feature of Claims
[Objective]This paper proposes a new model to compute patent similarity,which fully leverages the characteristics of patent texts and their structural and context features.[Methods]First,we used technical compound sentences,the weighting of information core degree,and information richness to represent patents.Then,we calculated patent-to-patent similarity with the representation.Finally,we conducted comparative experiments with correlation scores and patent classification.[Results]The proposed method outperformed benchmark methods in computing patent similarities.The technical compound sentences and weighting of information core degree and richness further improved the model's performance.[Limitations]We only examined the model with quantum computing.[Conclusions]Using a claim tree and technical compound sentences to organize patent information can improve the efficiency of patent text processing.The weighting of information core degree and richness based on hierarchical features of patents can improve their representation and patent similarity computing tasks.
NETL
NSTL
万方数据
