Social Network Node Grouping by Relevance Degree
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In traditional social networks, users face difficulties in quickly expanding their relationship chains as they need to search and transform potential association nodes into association nodes, making it inconvenient to develop new relationships.
Innovation Solution
A method and apparatus for grouping social network nodes by obtaining candidate nodes with potential association relationships, association nodes with existing relationships, and calculating relevance degrees to combine and output these nodes based on their grouping identifiers, facilitating the expansion of relationship chains.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If candidate nodes and association nodes are divided into two separate blocks for presentation, then the data structure is simple and easy to manage, but the user cannot quickly expand their relationship chain and must manually search and transform nodes
Solution Approach 1:
The patent combines candidate nodes and association nodes into a single unified presentation block, allowing users to view and interact with both types of nodes together. This merging eliminates the need for separate blocks and manual transformation operations, enabling users to directly expand their relationship chain by selecting candidate nodes within the same interface where association nodes are displayed.
2Productivity
If users manually search and transform candidate nodes into association nodes, then the system structure remains simple, but the operation efficiency and user experience deteriorate
Solution Approach 1:
The system pre-calculates and pre-presents candidate nodes that have potential association relationships with the target user before the user initiates any action. By having these candidate nodes already identified and displayed in the presentation block alongside association nodes, the system eliminates the manual search step and allows users to immediately expand their relationship chain by selecting from pre-processed candidate nodes.
3Speed
If candidate nodes are kept separate from association nodes, then the data management is straightforward, but the system response time and user interaction speed decrease
Solution Approach 1:
While presenting nodes in a unified block, the system segments them using visual distinctions such as different icons, colors, or labels to differentiate between candidate nodes and association nodes. This segmentation approach allows the system to maintain a simple unified presentation structure while providing clear visual cues for users to identify and interact with different types of nodes, thereby improving interaction speed without requiring complex separate structures.
Data Source
AI summary
According to an embodiment, a candidate node having a potential association relationship with a target node, an association node having an association relationship with the target node, and a grouping identifier of the association node are obtained. A relevance degree between the association node and the target node and a relevance degree between the candidate node and the target node within each grouping identifier are obtained. Based on the relevance degrees, the association node and the candidate node in each grouping identifier are combined for outputting.