Graph node classification method and application
A classification method and node technology, applied in the field of artificial intelligence, can solve problems such as no simultaneous combination, and achieve the effect of improving accuracy and reducing convolution calculations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0044] S1: Input
[0045] S1-1: Graph network structure, the connection relationship between nodes in the graph can be represented by an adjacency matrix A.
[0046] S1-2: The characteristics of the nodes in the graph network, expressed as v={v 1 ,v 2 ,...,v n }, where n is the total number of nodes in the graph. Feature matrix X=[x 1 , x 2 ,...,x n ] T ,x i The dimension is d.
[0047] S1-3: Hyperparameters: M represents the maximum number of convolutional layers, and max_iter represents the number of model training iterations.
[0048] S1-4: Partially labeled true node classes for model training and testing y'={y' 1 ,y' 2 ,...,y' N’ }, N'<=N (semi-supervised learning, only some labels are marked).
[0049] S2: output
[0050] S2-1: The category of the predicted node, expressed as y={y 1 ,y 2 ,...,y N }.
[0051] S3: Process
[0052] S3-1: Loop the following process, from 0 to max_iter.
[0053] S3-1-1: Loop the following process, t from 0 to M;
[00...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com