Pith. sign in

REVIEW

Adaptive Dual Channel Convolution Hypergraph Representation Learning for Technological Intellectual Property

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.05947 v1 pith:HHQTDDRQ submitted 2022-10-12 cs.IR cs.LG

classification cs.IRcs.LG
keywords hypergraphintellectualpropertytechnologicalgraphchannelinformationhidden
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the age of big data, the demand for hidden information mining in technological intellectual property is increasing in discrete countries. Definitely, a considerable number of graph learning algorithms for technological intellectual property have been proposed. The goal is to model the technological intellectual property entities and their relationships through the graph structure and use the neural network algorithm to extract the hidden structure information in the graph. However, most of the existing graph learning algorithms merely focus on the information mining of binary relations in technological intellectual property, ignoring the higherorder information hidden in non-binary relations. Therefore, a hypergraph neural network model based on dual channel convolution is proposed. For the hypergraph constructed from technological intellectual property data, the hypergraph channel and the line expanded graph channel of the hypergraph are used to learn the hypergraph, and the attention mechanism is introduced to adaptively fuse the output representations of the two channels. The proposed model outperforms the existing approaches on a variety of datasets.

Discussion (0). Continue with ORCID to comment.

Pith tools