Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Target node key information filling method and system based on association network

A target node and key information technology, which is applied in the fields of instruments, finance, and data processing applications, can solve the problems of low accuracy of key information, failure to fill in key information of target nodes, and occupying a lot of resources, so as to reduce feature dimensions and reduce Training complexity and the effect of mitigating feature sparsity

Active Publication Date: 2020-01-17
SICHUAN XW BANK CO LTD
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] In view of the problems of the above research, the purpose of the present invention is to provide a method and system for filling key information of target nodes based on an associated network, to solve the problem in the prior art that (1) when filling key information of target nodes, it is necessary to rely on the target node itself The characteristics of the target node, in the case that the target node has no relevant features, it is impossible to fill the key information of the target node; (2) the accuracy of the key information of the target node is low; (3) the problem of occupying a lot of resources

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Target node key information filling method and system based on association network
  • Target node key information filling method and system based on association network
  • Target node key information filling method and system based on association network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0082] According to the financial credit application scenario, a relationship network is established based on 50,200 nodes, and 23,090 nodes with key information (overdue or not) are selected as target nodes to establish an associated network. Among them, the 23,090 relationship networks corresponding to 23,090 target nodes are 23,090 associated network;

[0083] Based on the above-mentioned target nodes, there are 23,090 associated networks, and the associated network is integrated into labels containing target nodes, key information corresponding to target nodes, associated nodes corresponding to target nodes, node weights of each associated node, and key information related to target nodes. The data structure of the attribute vectors of the associated nodes and each associated node, that is, the integrated training set;

[0084] After the associated nodes are found through the association network, and the attribute vectors of the associated nodes are mined, the integrated t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a target node key information filling method and system based on an association network, and belongs to the technical field of data mining, machine learning and graph theory. The problem of low accuracy of the filled key information of the target node in the prior art is solved. According to an application scene, the method comprises steps of establishing a relational network of a large number of nodes; based on network relation, obtaining an association network of a target node with key information, integrating the association network into a data structure comprising atarget node, a label, an association node, an association node weight and an attribute vector, performing multiple three-dimensional sampling on the data structure based on an improved random forestmethod to obtain a subset of a plurality of training decision trees, giving a plurality of decision trees to perform training, and performing integration after training to obtain a final model; and based on the associated nodes of the to-be-filled target node, performing prediction through the final model, and performing weighted average on multiple results after prediction to obtain final fillinginformation. The key information of the target node is filled based on the association network.

Description

technical field [0001] A method and system for filling key information of a target node based on an association network, used for filling key information of a target node based on an association network, belonging to the technical fields of data mining, machine learning, and graph theory. Background technique [0002] In many scenarios, there is a need to predict the key information of the target when there is insufficient target information. Specific scenarios include the fields of financial credit, e-commerce recommendation, health assessment, and other fields. [0003] Scenario 1: In the field of financial credit, how to conduct credit evaluation for credit white account access. The credit white account itself does not have enough basic credit information for financial institutions to evaluate its repayment willingness and repayment ability. At this time, the relevant information of the target node's close relatives (that is, the adjacent network nodes) can be used as th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q40/02G06Q50/00
CPCG06Q50/01G06Q40/03
Inventor 郑乐韩晗刘嵩陈锐浩毛正冉王张琦
Owner SICHUAN XW BANK CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products