Website Classification via Graph Neural Network Trust Propagation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current website classification methods are inefficient in detecting malicious websites due to their reactive nature, high false positive rates, and inability to handle the scalability and stealthiness of on-chain compromises, which involve content and topology stealthiness, making it difficult to identify compromised nodes in a large graph with limited supervision information.

Innovation Solution

A graph neural network-based semi-supervised node classification model that uses Personalised Incredulity Rank (PIR) for fast and scalable domain trustworthiness analysis, combining local prediction and global propagation to classify websites based on their features and structural information, effectively identifying malicious nodes by propagating trustworthiness scores and pruning compromised nodes from the graph.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If deny-listing is used to block malicious websites, then protection against known threats is improved, but detection speed and responsiveness to new threats deteriorate due to reactive nature and update lag

Engineering Contradiction:
Improveprotection against known threatsVSAvoiddetection speed
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent performs preliminary classification of websites as trustworthy or untrustworthy before users access them. By pre-computing trust scores and propagating trustworthiness information through the web graph in advance, the system eliminates detection lag when users encounter new or previously unknown malicious sites, while maintaining reliability through rigorous classification criteria.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If allow-listing is used to restrict access to trusted sites, then security against malicious sites is improved, but user accessibility and ease of operation deteriorate due to restrictiveness and centralization

Engineering Contradiction:
Improvesecurity against malicious sitesVSAvoiduser accessibility
Core Design Contradiction:
ReliabilityVSEase of operation

Solution Approach 1:

The patent implements local quality by allowing each user or organization to maintain their own customized trust graph and classification preferences. Instead of a single centralized allow-list, the system enables local adaptation where users can adjust trust thresholds, select which neighbor websites to consider, and customize their browsing experience while maintaining security, thus improving ease of operation without sacrificing reliability.

Inventive Principle:
Principle #3Local quality

3Measurement precision

If manual updating of white or black lists is performed, then accuracy of threat detection is improved, but labor intensity and time consumption deteriorate

Engineering Contradiction:
Improveaccuracy of threat detectionVSAvoidupdate efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent implements self-service by automatically propagating trustworthiness scores through the web graph using graph neural networks and semi-supervised learning. The system autonomously updates classifications by leveraging the structure of hyperlink connections and machine learning models, eliminating manual intervention entirely. This maintains high accuracy through rigorous algorithmic classification while dramatically improving productivity by removing labor-intensive manual updating processes.

Inventive Principle:
Principle #25Self-service

4Measurement precision

If graph neural network with global propagation is used for website classification, then detection accuracy is improved, but computational complexity and device complexity deteriorate

Engineering Contradiction:
Improvedetection accuracyVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent applies segmentation by dividing the web graph into local neighborhoods around each website being classified. Instead of performing global propagation across the entire web graph which would be computationally prohibitive, the system segments the problem into manageable local regions, computing trust scores only for relevant neighbor websites within a limited depth. This maintains high detection accuracy by considering local trust relationships while reducing computational complexity to feasible levels.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS20240333730A1Website classification
Publication Date: 2024.10.03 COMMONWEALTH SCI & IND RES ORG
  • US20240333730A1 patent drawing
  • US20240333730A1 patent drawing
  • US20240333730A1 patent drawing

AI summary

This disclosure relates to classifying websites. A processor calculates importance values between a test website and multiple neighbour websites that are connected by way of one or more hyperlinks between that neighbour website and the test website. The processor then selects one or more of the multiple neighbour websites, based on the importance value. For each website in the selected one or more of the multiple neighbour websites and the test website, the processor determines content features for the website, and evaluates a trained machine learning model for the website, based on the content features to calculate multiple output values for the website. The processor then aggregates corresponding output values for each of the test website and the selected one or more of the multiple neighbour websites to calculate a classification value that classifies the test website.