Computer-implemented method for arranging hyperlinks on a graphical user-interface

Patent metadata

Field	Value
Publication number	US-10460359-B1
Application number	US-201916367891-A
Country	US
Kind code	B1
Filing date	Mar 28, 2019
Priority date	Mar 28, 2019
Publication date	Oct 29, 2019
Grant date	Oct 29, 2019

Abstract

Methods and systems for arranging hyperlinks on a graphical user-interface (GUI) of a computerized system include receiving, via the GUI, a user selection to display a plurality of hyperlinks, the hyperlinks corresponding to one or more nodes of a first set. The methods and systems further include determining, by a processor, a rank of each hyperlink in the plurality of hyperlinks. Determining a rank includes constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set, the first set and the second set being mutually exclusive, wherein edges of the first bipartite graph are weighted according to a first criterium and constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the second bipartite graph are weighted according to a second criterium, different from the first criterium. The first bipartite graph and the second bipartite graph are aggregated to form an aggregated bipartite graph. The one or more hyperlinks are ranked ordinally according to an aggregate weight of the corresponding node in the aggregate bipartite graph. The first-ranked hyperlink is automatically moved to a first position on the GUI and the second and subsequently ranked hyperlinks are automatically moved to second and subsequent positions, respectively, on the GUI.

First claim

What is claimed is:

1. A computer-implemented system comprising:
a memory storing instructions; and
at least one processor programmed to execute the instructions to perform a method for arranging hyperlinks on a graphical user-interface (GUI) of a computerized system, the method comprising:
receiving, via the GUI, a user selection to display a plurality of hyperlinks, the hyperlinks corresponding to one or more nodes of a first set;
determining, by a processor, a rank of each hyperlink in the plurality of hyperlinks, wherein determining a rank comprises:
constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set, the first set and the second set being mutually exclusive, wherein edges of the first bipartite graph are weighted according to a first criterium;
constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the second bipartite graph are weighted according to a second criterium, different from the first criterium;
aggregating the first bipartite graph and the second bipartite graph to form an aggregated bipartite graph; and
ranking the one or more hyperlinks ordinally according to an aggregate weight of the corresponding node in the aggregate bipartite graph;

automatically moving the first-ranked hyperlink to a first position on the GUI; and
automatically moving the second and subsequently ranked hyperlinks to second and subsequent positions, respectively, on the GUI.

2. The computer-implemented system of claim 1 , wherein:
receiving a user selection to display a plurality of hyperlinks comprises receiving an input from a keyboard or pointing device.

3. The computer-implemented system of claim 1 , wherein:
constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set comprises constructing a first weighted adjacency matrix having elements corresponding to the weights of the edges in the first bipartite graph;
constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set comprises constructing a first weighted adjacency matrix having elements corresponding to the weights of the edges in the second bipartite graph.

4. The computer-implemented system of claim 1 , wherein:
the one or more nodes of a first set correspond to sellers in an online marketplace;
the one or more nodes of a second set correspond to buyers in the online marketplace; and
the edges of the first bipartite graph are weighted according to a value of past transactions conducted between the respective buyer and seller.

5. The computer-implemented system of claim 4 , wherein:
the edges of the second bipartite graph are weighted according to one of:
a duration of past transactions between the respective buyer and seller; and
a frequency of past transactions between a respective buyer and seller.

6. The computer-implemented system of claim 4 , further comprising:
constructing a third bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the third bipartite graph are weighted according to a third criterium, different from the first criterium and the second criterium; and
aggregating the first bipartite graph and the second bipartite graph to form an aggregated bipartite graph further comprises aggregating the third bipartite graph with the first bipartite graph and the second bipartite graph.

7. The computer-implemented system of claim 6 , wherein:
the edges of the second bipartite graph are weighted according to a duration of past transactions between the respective buyer and seller; and
the edges of the third bipartite graph are weighted according to a value of past transactions conducted between the respective buyer and seller.

8. The computer-implemented system of claim 1 , wherein:
aggregating the first bipartite graph and the second bipartite graph to form an aggregated bipartite graph comprises:
building a first weighted adjacency matrix corresponding to the first bipartite graph;
building a second weighted adjacency matrix corresponding to the second bipartite graph; and
taking an algebraic sum of the first weighted adjacency matrix and the second weighted adjacency matrix.

9. The computer-implemented system of claim 8 , wherein:
taking the algebraic sum of the first weighted adjacency matrix and the second weighted adjacency matrix comprises multiplying the first weighted adjacency matrix and the second weighted adjacency matrix by different coefficients.

10. A computer-implemented method for arranging hyperlinks on a graphical user-interface (GUI) of a computerized system, the method comprising:
receiving, via the GUI, a user selection to display a plurality of hyperlinks, the hyperlinks corresponding to one or more nodes of a first set;
determining, by a processor, a rank of each hyperlink in the plurality of hyperlinks, wherein determining a rank comprises:
constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set, the first set and the second set being mutually exclusive, wherein edges of the first bipartite graph are weighted according to a first criterium;
constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the second bipartite graph are weighted according to a second criterium, different from the first criterium;
aggregating the first bipartite graph and the second bipartite graph to form an aggregated bipartite graph; and
ranking the one or more hyperlinks ordinally according to an aggregate weight of the corresponding node in the aggregate bipartite graph;

automatically moving the first-ranked hyperlink to a first position on the GUI; and
automatically moving the second and subsequently ranked hyperlinks to second and subsequent positions, respectively, on the GUI.

11. The computer-implemented method of claim 10 , wherein:
receiving a user selection to display a plurality of hyperlinks comprises receiving an input from a keyboard or pointing device.

12. The computer-implemented method of claim 10 , wherein:
constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set comprises constructing a first weighted adjacency matrix having elements corresponding to the weights of the edges in the first bipartite graph;
constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set comprises constructing a first weighted adjacency matrix having elements corresponding to the weights of the edges in the second bipartite graph.

13. The computer-implemented method of claim 10 , wherein:
the one or more nodes of a first set correspond to sellers in an online marketplace;
the one or more nodes of a second set correspond to buyers in the online marketplace; and
the edges of the first bipartite graph are weighted according to a value of past transactions conducted between the respective buyer and seller.

14. The computer-implemented method of claim 13 , wherein:
the edges of the second bipartite graph are weighted according to one of:
a duration of past transactions between the respective buyer and seller; and
a frequency of past transactions between a respective buyer and seller.

15. The computer-implemented method of claim 13 , wherein:
constructi

Assignees

• Coupang Corp

Inventors

• Huang Xiaojun

Classifications

• G06Q30/0641

  utilising user interfaces specially adapted for shopping · CPC title

• G06Q30/0631 Primary

  Recommending goods or services · CPC title

• G06Q30/0282 Primary

  Rating or review of business operators or products · CPC title

• G06F16/958

  Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking · CPC title

• G06F16/9577

  Optimising the visualization of content, e.g. distillation of HTML documents · CPC title