Graph iteration job-oriented running time prediction system and method in a Gia system
A running time and iterative technology, applied in prediction, structured data retrieval, instrumentation, etc., can solve the problems of roughness and low prediction accuracy, and achieve the effect of low training overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0146] In this embodiment, as image 3 The running time prediction system integrated into the Gaia system shown above is an actual application scenario for processing the four iterative algorithms PageRank, Connected Components, SSSP, and Adsorption. The data sets used by the above iterative algorithms are shown in Table 1.
[0147] The single-source shortest path algorithm (SSSP) calculates the shortest distance from a certain source node to all other nodes in the graph. PageRank is a well-known web page ranking algorithm, which updates the importance score of each page node through iterative and recursive calculations. The Adsorption algorithm diffuses labels in the graph according to the Random Walk model until the distribution of labels in each node in the graph reaches a stable level. The Connected Components algorithm searches iteratively to find connected parts in a large graph. The datasets in Table 1 are all from the real world and downloaded from the Stanford Large...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - 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



