Website Navigation Structure Optimization via Precomputed Path Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing website navigation processes based on stratified data drives require multiple level-by-level clicking operations, increasing the burden on website servers and network bandwidth, and are inconvenient for users due to the need for extensive browsing to locate desired content.
Innovation Solution
A website navigation process that generates a navigation hierarchical structure diagram based on historical user search behavior, calculates the searching cost for each diagram, and implements the structure with the lowest searching cost to optimize the browsing experience by rearranging category relationships and displaying categories based on confidence levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple level-by-level clicking operations are used for navigation, then users can locate desired content through systematic browsing, but the burden on website servers and network bandwidth increases
Solution Approach 1:
The patent pre-calculates and stores the optimal navigation path from the initial node to all possible target nodes before user queries arrive. When a user searches for content, the system directly retrieves the pre-computed navigation path from storage, avoiding real-time multi-level querying. This preliminary action significantly reduces server burden and network bandwidth consumption while maintaining accurate navigation guidance.
2Adaptability or versatility
If multiple level-by-level clicking operations are required, then comprehensive category browsing is enabled, but user convenience and time efficiency deteriorate
Solution Approach 1:
The patent introduces a navigation path recommendation module that acts as an intermediary between the user's search intent and the category navigation system. This module analyzes user queries, retrieves pre-computed optimal paths, and guides users directly to relevant categories without requiring manual traversal through multiple levels. Users gain efficient access to desired content while the system maintains comprehensive category coverage.
3Stability of the object's composition
If traditional stratified navigation is used, then systematic category exploration is possible, but the number of clicks and viewing requirements increases
Solution Approach 1:
The patent segments the navigation process into two distinct phases: offline path computation and online path retrieval. During the offline phase, the system divides the category hierarchy into manageable segments and pre-calculates optimal paths between nodes. During online usage, users receive instantly retrieved navigation guidance without traversing multiple levels. This segmentation preserves the systematic structure of categories while dramatically reducing navigation time and clicks required.
Data Source
AI summary
Implementing website navigation includes deriving a confidence level for at least one leaf node of a website navigation category diagram using historical user operation data; generating one or more navigation hierarchical structure diagrams based on the website navigation category diagram; determining a searching cost associated with each of the one or more navigation hierarchical structure diagrams; determining the navigation hierarchical structure diagram associated with the lowest searching cost; and implementing at least in part a website navigation mode using the navigation hierarchical structure diagram associated with the lowest searching cost.