Graph Entity Library Search Result Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search engines fail to provide users with search results that accurately meet their demands due to the vast number of content matches, leading to irrelevant search outcomes.
Innovation Solution
A data processing method and apparatus that determine a search keyword from a user's input, associate it with relevant graph entity libraries based on category relationships, and construct a set of linked libraries to display results centered around the search keyword, reflecting the user's search intent.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional search engines retrieve all content matches for a search keyword, then the quantity of search results increases, but the relevance of search results to user demands decreases
Solution Approach 1:
The patent segments the search result set into multiple categories based on graph entity library classifications. Instead of presenting all matches uniformly, results are divided into distinct categories (e.g., news, videos, images, articles) with associated graph entity libraries, allowing users to selectively view relevant categories while maintaining comprehensive coverage.
Solution Approach 2:
The patent introduces graph entity libraries as intermediary structures between the search keyword and the actual search results. These libraries act as mediators that organize and filter results based on pre-established associations, improving relevance without losing comprehensive coverage.
2Loss of information
If search engines present all categories of search results, then completeness of information is improved, but complexity of result presentation increases
Solution Approach 1:
The patent segments comprehensive search results into distinct categorical groups, each with its own graph entity library. This segmentation maintains complete information coverage while organizing results into manageable, visually distinct sections that reduce presentation complexity.
Solution Approach 2:
The patent adds a categorical dimension to search result presentation by organizing results according to graph entity library types. This dimensional organization allows comprehensive information to be displayed in a structured, multi-dimensional layout rather than a flat, overwhelming list.
3Ease of operation
If search engines use simple keyword matching, then ease of operation is maintained, but accuracy of search results deteriorates
Solution Approach 1:
The patent introduces graph entity libraries as intermediary structures that enhance keyword matching accuracy without complicating user input. These libraries pre-establish semantic relationships and associations, allowing simple keyword queries to automatically benefit from sophisticated organization and filtering.
Solution Approach 2:
The patent performs preliminary organization of search results into graph entity library categories before presenting them to users. This pre-processing step establishes accurate associations between keywords and relevant content categories, improving result accuracy while keeping the user interface simple.
Data Source
AI summary
An apparatus and method for data processing includes determining a search keyword according to a search statement input by a user; determining a first graph entity library corresponding to a category to which the search keyword belongs; determining, according to an association relationship between graph entity libraries of a plurality of categories, a category of a graph entity library associated with the first graph entity library, and constructing a first set, the first set including at least one graph entity library which has an association relationship with the first graph entity library, and the association relationship between the graph entity libraries is established according to a search demand of a user; and displaying, after the first set is constructed, each graph entity library included in the first set by using the search keyword as a center.