Sub-domain Search Ranking via Cross-Domain Link Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing web search systems face challenges in providing accurate search results due to the structure of websites into Internet or Intranet sub-domains, which can lead to exaggerated or underestimated relevance of search results, as they only weigh webpages based on references within a specific sub-domain, neglecting related sub-domains that may contain more relevant information.
Innovation Solution
A computer-implemented system and method that identifies sub-domains of interest and related sub-domains, analyzes their content, and calculates scores to weigh and rank search results based on the content of both the sub-domain of interest and related sub-domains, providing a broader and more accurate reflection of relevance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a search system limits weighting to references within a specific sub-domain, then the search process remains simple and fast, but the accuracy of search results deteriorates due to inability to capture cross-sub-domain relevance
Solution Approach 1:
The patent segments the web into hierarchical sub-domains and processes them in a structured sequence. It identifies a target sub-domain, finds related sub-domains through link analysis, and processes them in an organized manner (identifying related sub-domains, calculating scores, combining results) to improve search accuracy without overwhelming system complexity
Solution Approach 2:
The patent extends the search from a single sub-domain dimension to multiple dimensions by incorporating related sub-domains. It adds a cross-sub-domain dimension to the search process, allowing relevance assessment across domain boundaries while maintaining organizational structure through hierarchical segmentation
2Measurement precision
If a search system expands to include multiple sub-domains for ranking, then the accuracy of search results improves, but the computational complexity and processing time increase
Solution Approach 1:
The patent performs preliminary identification of related sub-domains through link analysis before the actual search and ranking process. By pre-establishing the relationships between sub-domains and preparing the search framework in advance, it reduces the computational burden during the actual search execution, thereby reducing processing time while maintaining multi-sub-domain accuracy
Solution Approach 2:
The patent dynamically adjusts the search process by identifying and processing only the most relevant related sub-domains rather than all possible sub-domains. It uses link analysis to determine which sub-domains are actually connected to the target sub-domain and focuses computational resources on those specific areas, optimizing the balance between accuracy and processing time
3Reliability
If a search system uses only local sub-domain references for weighting, then the ease of operation is maintained, but the reliability of search results deteriorates due to limited search input
Solution Approach 1:
The patent uses link analysis as an intermediary mechanism to connect the target sub-domain with related sub-domains. This intermediary process automatically identifies relationships without requiring user input, maintaining ease of operation while expanding the search scope to improve reliability through cross-sub-domain reference incorporation
Data Source
AI summary
The present invention may provide a system, method and computer program for searching a sub-domain that involves linking to other sub-domains. In particular, the present invention may provide a sub-domain search that ranks and/or weighs search results based on relevance, such relevance being determined by a calculation operating on a broader range of domain and/or sub-domains than a single sub-domain. The present invention may weight and score a search of web pages in a sub-domain based on the content of web pages in other sub-domains.