IP Library Granted Patent US 10,860,590
Granted Patent B2
US 10,860,590 · App. 15/954,662 · Granted Dec 8, 2020

Method and apparatus of information processing

Inventors: Duke Hongtao Dai (Shanghai, CN); Winston Lei Zhang (Shanghai, CN); Kun Wu (Sheperd) Huang (Shanghai, CN); Charlie Chao Chen (Shanghai, CN); Jingjing Liu (Shanghai, CN)
Assignee: EMC IP Holding Corporation LLC
G06F16/24578G06F16/2246G06F16/3326
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,860,590
App. No.
15/954,662
Granted
Dec 8, 2020
Kind
B2
Abstract

The present disclosure provides method and apparatus of information processing. The method comprises: in response to a request of a first user for first information, searching a database to obtain second information; determining a first relevance between a second user associated with the second information and the first user; determining a second relevance between the second information and the first information based on the first relevance; and presenting the second information to the first user based at least in part on the second relevance.

Claims (62)

1. A method of information processing, comprising:

in response to a request of a first user for first information, searching a database to obtain second information;

determining a first relevance between a second user associated with the second information and the first user;

determining a second relevance between the second information and the first information based on the first relevance; and

presenting the second information to the first user based at least in part on the second relevance,

wherein determining the first relevance comprises:

determining a first leaf node representing the first user and a second leaf node representing the second user from a graphical tree structure representing a relevance between a plurality of users including the first user and the second user; and

determining the first relevance by calculating a distance between the first leaf node and the second leaf node of the graphical tree structure.

2. The method of claim 1 , wherein the graphical tree structure includes one or more internal nodes, and a plurality of edges interconnecting the one or more internal nodes, the first leaf node, and the second leaf node, and wherein calculating the distance comprises:

traversing, from the first leaf node to the second leaf node, a minimum number of edges from among the plurality of edges included in the graphical tree structure,

wherein the traversed minimum number of edges represents the calculated distance between the first leaf node and the second leaf node.

3. The method of claim 2 , wherein calculating the distance further comprises:

in response to determining that the first and second users belong to a same first group in an organization:

determining a first internal node from among the one or more internal nodes that represents the first group; and

traversing, from the first leaf node to at least the first internal node and ultimately to the second leaf node, the minimum number of edges from among the plurality of edges included in the graphical tree structure.

4. The method of claim 3 wherein calculating the distance further comprises:

in response to determining that the first user further belongs to a second group in the organization, the second group being different from the first group:

determining a third leaf node representing the first user from the graphical tree structure;

determining a second internal node from among the one or more internal nodes that represents the second group;

traversing, from the first leaf node to at least the first internal node and ultimately to the second leaf node, a first number of edges from among the plurality of edges included in the graphical tree structure;

traversing, from the third leaf node to at least the second internal node and ultimately to the second leaf node, a second number of edges from among the plurality of edges included in the graphical tree structure; and

obtaining the minimum number of edges from the lesser of the first number of edges and the second number of edges.

5. The method of claim 1 , wherein the graphical tree structure is generated based on a structural diagram of an organization to which the plurality of users belong.

6. The method of claim 1 , wherein determining the first relevance by calculating the distance between the first leaf node and the second leaf node comprises:

determining the first relevance based on a power function, the power function using the distance as a variable.

7. The method of claim 1 , wherein determining the second relevance comprises:

adjusting, based on the first relevance, an initial relevance between the first information and the second information to obtain the second relevance.

8. The method of claim 7 , wherein presenting the second information comprises:

determining, based on the second relevance, a position of the second information in pieces of information to be presented to the first user.

9. An electronic device, comprising:

a processing unit; and

a memory coupled to the processing unit and having instructions stored thereon, the instructions, when being executed by the processing unit, causing the device to perform acts including:

in response to a request of a first user for first information, searching a database to obtain second information;

determining a first relevance between a second user associated with the second information and the first user;

determining a second relevance between the second information and the first information based on the first relevance; and

presenting the second information to the first user based at least in part on the second relevance,

wherein determining the first relevance comprises:

determining a first leaf node representing the first user and a second leaf node representing the second user from a graphical tree structure representing a relevance between a plurality of users including the first user and the second user; and

determining the first relevance by calculating a distance between the first leaf node and the second leaf node of the graphical tree structure.

10. The device of claim 9 , wherein the graphical tree structure includes one or more internal nodes, and a plurality of edges interconnecting the one or more internal nodes, the first leaf node, and the second leaf node, and wherein calculating the distance comprises:

traversing, from the first leaf node to the second leaf node, a minimum number of edges from among the plurality of edges included in the graphical tree structure,

wherein the traversed minimum number of edges represents the calculated distance between the first leaf node and the second leaf node.

11. The device of claim 10 , wherein calculating the distance further comprises:

in response to determining that the first user and the second user belong to a same first group in an organization:

determining a first internal node from among the one or more internal nodes that represents the first group; and

traversing, from the first leaf node to at least the first internal node and ultimately to the second leaf node, the minimum number of edges from among the plurality of edges included in the graphical tree structure.

12. The device of claim 9 , wherein the graphical tree structure is generated based on a structural diagram of an organization to which the plurality of users belong.

13. The device of claim 9 , wherein determining the first relevance by calculating the distance between the first leaf node and the second leaf node comprises:

determining the first relevance based on a power function, the power function using the distance as a variable.

14. The device of claim 9 , wherein determining the second relevance comprises:

adjusting, based on the first relevance, an initial relevance between the first information and the second information to obtain the second relevance.

15. The device of claim 14 , wherein presenting the second information comprises:

determining, based on the second relevance, a position of the second information in pieces of information to be presented to the first user.

16. A computer program product for information processing, the computer program product comprising:

a non-transitory computer readable medium encoded with computer-executable code, the code configured to enable the execution of:

in response to a request of a first user for first information, searching a database to obtain second information;

determining a first relevance between a second user associated with the second information and the first user;

determining a second relevance between the second information and the first information based on the first relevance; and

presenting the second information to the first user based at least in part on the second relevance;

wherein determining the first relevance comprises:

determining a first leaf node representing the first user and a second leaf node representing the second user from a graphical tree structure representing a relevance between a plurality of users including the first user and the second user; and

determining the first relevance by calculating a distance between the first leaf node and the second leaf node of the graphical tree structure.

Assignments (8)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053546/0001) Recorded Jun 23, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL MARKETING L.P. (ON BEHALF OF ITSELF AND AS SUCCESSOR-IN-INTEREST TO CREDANT TECHNOLOGIES, INC.); DELL INTERNATIONAL L.L.C.; DELL PRODUCTS L.P.; DELL USA L.P.; EMC CORPORATION; DELL MARKETING CORPORATION (SUCCESSOR-IN-INTEREST TO FORCE10 NETWORKS, INC. AND WYSE TECHNOLOGY L.L.C.); EMC IP HOLDING COMPANY LLC
Reel/Frame 071642/0001 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (046366/0014) Recorded May 20, 2022
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS NOTES COLLATERAL AGENT
To: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
Reel/Frame 060450/0306 →
RELEASE OF SECURITY INTEREST AT REEL 046286 FRAME 0653 Recorded Nov 2, 2021
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
Reel/Frame 058298/0093 →
SECURITY AGREEMENT Recorded Apr 22, 2020
From: CREDANT TECHNOLOGIES INC.; DELL INTERNATIONAL L.L.C.; DELL MARKETING L.P.; DELL PRODUCTS L.P.; DELL USA L.P.; EMC CORPORATION; FORCE10 NETWORKS, INC.; WYSE TECHNOLOGY L.L.C.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A.
Reel/Frame 053546/0001 →
SECURITY AGREEMENT Recorded Mar 21, 2019
From: CREDANT TECHNOLOGIES, INC.; DELL INTERNATIONAL L.L.C.; DELL MARKETING L.P.; DELL PRODUCTS L.P.; DELL USA L.P.; EMC CORPORATION; FORCE10 NETWORKS, INC.; WYSE TECHNOLOGY L.L.C.; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A.
Reel/Frame 049452/0223 →
PATENT SECURITY AGREEMENT (CREDIT) Recorded Jun 1, 2018
From: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT
Reel/Frame 046286/0653 →
PATENT SECURITY AGREEMENT (NOTES) Recorded Jun 1, 2018
From: DELL PRODUCTS L.P.; EMC CORPORATION; EMC IP HOLDING COMPANY LLC
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
Reel/Frame 046366/0014 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 23, 2018
From: DAI, DUKE; ZHANG, WINSTON LEI; HUANG, KUN WU (SHEPERD); CHEN, CHARLIE CHAO; LIU, JINGJING
To: EMC IP HOLDING COMPANY LLC
Reel/Frame 045607/0647 →
Priority Claims (1)
CN 2017 1 0250544 · Apr 17, 2017 · national
Continuity (1)
Related Publication 20180307689A1 · Oct 25, 2018