Web-Resource Prioritization via Graph Trust Scores
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing number of web-resources on the internet strains computational resources due to the need for efficient malicious data assessment, particularly in assessing parent, child, and sub-child web-resources for malicious content.
Innovation Solution
A method and system for prioritizing web-resources for malicious data assessment using a graph structure that assigns trust scores to parent, child, and sub-child nodes based on their associations, applying a shortest-path algorithm to determine the order of assessment, thereby reducing computational strain.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all web-resources (parent, child, and sub-child) are assessed for malicious data, then comprehensive security coverage is achieved, but computational resources are excessively strained
Solution Approach 1:
The patent segments web-resources into three hierarchical categories: parent web-resources (assessed first based on direct requests), child web-resources (assessed based on hyperlink associations), and sub-child web-resources (assessed based on transitive hyperlink associations). This segmentation allows the system to prioritize assessment efforts on high-risk resources while potentially reducing or skipping assessment of lower-risk resources, thereby maintaining security coverage while reducing overall computational burden.
Solution Approach 2:
The patent applies different assessment strategies to different categories of web-resources based on their risk profiles. Parent web-resources receive full assessment due to direct user requests, child web-resources receive assessment based on their association strength with parent resources, and sub-child web-resources receive assessment based on transitive associations. This local quality approach ensures that computational resources are allocated proportionally to the security risk each category represents.
2Reliability
If child and sub-child web-resources are assessed simultaneously with parent web-resources, then comprehensive security coverage is achieved, but computational resources are excessively strained
Solution Approach 1:
The patent implements preliminary action by assessing parent web-resources first before proceeding to child and sub-child web-resources. The system evaluates parent resources based on direct user requests, then uses the results to inform the assessment of child resources, and finally uses those results to guide sub-child resource assessment. This sequential preliminary action approach maintains comprehensive security coverage while improving computational efficiency by avoiding redundant assessments and prioritizing high-risk resources.
3Measurement precision
If trust scores are assigned to all web-resources in the graph structure, then prioritization accuracy is improved, but computational resources are excessively strained
Solution Approach 1:
The patent uses parameter changes by implementing a trust score system that quantifies the reliability of each web-resource based on multiple factors including hyperlink associations, content analysis, and historical data. The trust scores are calculated dynamically and used to prioritize assessment efforts. This parameter-based approach improves prioritization accuracy by providing a quantitative basis for decision-making while reducing computational resource consumption by focusing assessments on low-trust resources.
Data Source
AI summary
The disclosed systems and methods are for scheduling web-resources for a malicious data comprising receiving requests to publish web-resources, and generating a graph structure comprising: a parent nodes associated with parent web-resources, a zero-vertex node being connected with the of parent nodes via zero-vertex edges, child nodes associated with child web-resources, and web-resource edges connecting the parent nodes, child nodes and sub-child nodes. Using the graph structure, assigning, to a given child node a first assigned trust score based on a lowest trust score of a subset of parent nodes connected to the given child node in the graph structure such that a web-resource edge length connecting the given, child node and the subset of parent nodes is a representative of the first assigned trust score, applying a shortest-path algorithm for calculating a shortest-path and based on the shortest-path determining at least one web-resource prioritized for the malicious data assessment.