Web Page Link Optimization via Precomputed Similarity Scores

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current electronic content delivery systems do not effectively consider the global link structure of web platforms, leading to suboptimal presentation of relevant content and impacting authority and quality of search results.

Innovation Solution

A method and system that generate similarity scores for pairwise combinations of web pages, identify linked-to pages based on these scores, and assign importance scores to determine optimal link structures for web pages, using algorithms like Markov Decision Process and Value Iteration to maximize organic traffic and ensure fairness in data presentation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If traditional link structures are used without considering global link structure, then implementation simplicity is maintained, but content relevance and search result quality deteriorate

Engineering Contradiction:
Improvecontent relevanceVSAvoidlink structure complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system pre-computes similarity scores for all pairwise combinations of web pages and stores them in a database before search operations. This preliminary action enables the search system to quickly retrieve and utilize pre-calculated similarity data during actual search operations, avoiding the need for complex real-time computations while maintaining high content relevance through global link structure consideration.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If similarity scores are generated for all pairwise combinations of web pages, then content relevance improves, but computational complexity and processing time increase

Engineering Contradiction:
Improvecontent similarity measurementVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The computational process is divided into distinct segments: first, similarity scores are computed for all pairwise page combinations and stored; second, these pre-computed scores are retrieved and used during search operations. This segmentation allows the complex computation to be performed once offline, while online search operations benefit from the pre-computed data without bearing the full computational burden, thus maintaining measurement precision while reducing operational complexity.

Inventive Principle:
Principle #1Segmentation

3Adaptability or versatility

If importance scores are generated for each web page, then link structure optimization improves, but data processing requirements increase

Engineering Contradiction:
Improvelink structure optimizationVSAvoiddata processing volume
Core Design Contradiction:
Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

The system generates importance scores for web pages based on the pre-computed similarity scores and existing link structures, allowing the system to self-optimize its link structure using its own internal data. This self-service approach enables automatic link structure optimization without requiring external intervention or additional manual data processing, as the system utilizes its own similarity measurements and existing page data to determine optimal link assignments.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11120092B1Optimization of links to electronic content
Publication Date: 2021.09.14 MICROSOFT TECHNOLOGY LICENSING LLC
  • US11120092B1 patent drawing
  • US11120092B1 patent drawing
  • US11120092B1 patent drawing

AI summary

A method and system for determining links for a linking page are provided. For each linking page of a plurality of linking pages, a similarity score between each linking page and each linked-to page is generated. Each linked-to page is associated with each linking page. Based on the similarity scores generated for each linking page, a set of linked-to pages for each linking page is identified. An importance score for the linking page is also generated. Identities of the plurality of linking pages, identities of the set of linked-to pages identified for each linking page, and the importance score for each linking page are stored as input. Based on the input, for each linking page, a subset of the set of linked-to pages identified for each linking page is assigned by a model.