Linked Network Score Propagation via Segmented Anchored Records

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing predictive analytic approaches face challenges in efficiently updating scores in networks of linked nodes, particularly in managing and propagating score values across interconnected entities, which is crucial for accurate outcome estimation and event likelihood assessment.

Innovation Solution

A method is provided for updating scores in a network of linked nodes by receiving scoring information, identifying anchored network records, computing network score values, and updating node records, which involves a system comprising a processor and computer-readable medium with instructions to perform these operations, enabling efficient scoring and propagation of scores across the network.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If scoring information is propagated across all anchored network records containing a node, then the accuracy of outcome estimation is improved, but the computational time and complexity increase

Engineering Contradiction:
Improveaccuracy of outcome estimationVSAvoidcomputational time for score propagation
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The network is segmented into multiple anchored network records, each representing a different perspective or anchor node. Instead of propagating scores across the entire network at once, the system divides the propagation task into smaller segments corresponding to individual anchored network records. This allows parallel processing and reduces the computational burden on any single operation while maintaining comprehensive score propagation across all relevant network contexts.

Inventive Principle:
Principle #1Segmentation

2Reliability

If multiple anchored network records are updated with score values, then the reliability of event likelihood assessment is improved, but the device complexity increases

Engineering Contradiction:
Improvereliability of event likelihood assessmentVSAvoidcomplexity of network record management
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The anchored network record structure serves multiple functions simultaneously: it stores node information, maintains network relationships, enables score propagation from different anchors, and supports various query operations. This multi-functionality reduces the need for separate data structures for each purpose, thereby managing complexity while improving reliability through comprehensive score assessment.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The system pre-identifies and stores multiple anchored network records that contain a given node before score propagation is needed. By having these records readily available and pre-organized, the system avoids the complexity of dynamically searching and constructing network views during score updates. This preliminary organization enables reliable multi-perspective scoring while keeping the management structure manageable.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If real-time score updates are performed across the network, then the productivity of predictive analytics is improved, but the loss of time for data consistency propagation increases

Engineering Contradiction:
Improvespeed of predictive analyticsVSAvoidtime for score consistency across records
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The system performs score propagation in periodic cycles across different anchored network records rather than attempting simultaneous universal updates. Each anchored network record can be updated in succession or parallel batches, allowing the system to maintain real-time analytics productivity while managing the time required for consistency propagation through structured periodic operations.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS10243831B2Linked network scoring update
Publication Date: 2019.03.26 SAS INSTITUTE INC
  • US10243831B2 patent drawing
  • US10243831B2 patent drawing
  • US10243831B2 patent drawing

AI summary

A method of updating a score in a network of linked nodes is provided. Scoring information including a node identifier and a score value for a node in a network of nodes is received. The score value is determined using an analytic model and a parameter value. An anchored network record for which the node is an anchor is identified using the node identifier. A node record for the node is identified in the identified anchored network record. A network score value is computed based on the score value. The identified node record is updated with the score value and the computed network score value. A next anchored network record that includes the node is identified using the node identifier. A second node record for the node is identified in the identified next anchored network record. The second node record is updated based on the updated, identified node record.