Displaying artists related to an artist of interest

• US 20070282886A1
• Filed: 05/16/2006
• Published: 12/06/2007
• Est. Priority Date: 05/16/2006
• Status: Active Grant

• Current Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Original Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Inventors: Plutowski, Mark, Purang, Khemdut
• Granted Patent: US 7,961,189 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9038 Presentation of query results
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957

Abstract

A graph of nodes and edges is used to represent artist influence between different artists. Each node of the graph represents an artist. An edge between two nodes represents an influence relationship between two artists. The relative influence between artists is computed for the artists represented in the graph. Furthermore, a weighted artist influence graph is generated based on the computed influences.

Claims

1. A computerized method comprising:

receiving influence information associated with a plurality of artists, the influence information comprising data that represents influence relationships among the plurality of artists;

generating a first graph from the influence information, the first graph comprising nodes and edges, wherein each node represents an artist, and wherein a pair of nodes is coupled with an edge, the edge representing the influence relationship between the artists represented by the pair of nodes;

computing artist influence data for each of the artists, wherein the computing uses the first graph; and

generating a second graph using the first graph and the artist influence data.

2. The computerized method of claim 1, wherein generating the second graph further comprises:

adding an artist node to the second graph, wherein the artist node represents a first artist selected from the plurality of artists;

adding an influence node to the second graph, wherein the influence node represents a second artist that influences the first artist, wherein the size of the influence node depends on the second artist'"'"'s computed influence data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the influencing node influencing the artist node.

3. The computerized method of claim 1, wherein generating the second graph further comprises:

adding an artist node to the second graph, the artist node represents an first artist selected from the plurality of artists;

adding a following node to the second graph, wherein the following node represents a second artist that followings the first artist, wherein the size of the following node depends on the second artist'"'"'s computed following data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the artist node influencing the following node.

4. The computerized method of claim 1, wherein generating the second graph further comprises:

limiting the number of influence nodes added to the second graph to a pre-determined number of nodes.

5. The computerized method of claim 1, wherein generating the second graph further comprises:

limiting the number of following nodes added to the second graph to a pre-determined number of nodes.

6. A machine readable medium having executable instructions to cause a processor to perform a method comprising:

receiving influence information associated with a plurality of artists, the influence information comprising data that represents influence relationships among the plurality of artists;

generating a first graph from the influence information, the first graph comprising nodes and edges, wherein each node represents an artist, and wherein a pair of nodes is coupled with an edge, the edge representing the influence relationship between the artists represented by the pair of nodes;

computing artist influence data for each of the artists, wherein the computing uses the first graph; and

generating a second graph using the first graph and the artist influence data.

7. The machine readable medium of claim 6, wherein generating the second graph further comprises:

adding an artist node to the second graph, wherein the artist node represents a first artist selected from the plurality of artists;

adding an influence node to the second graph, wherein the influence node represents a second artist that influences the first artist, wherein the size of the influence node depends on the second artist'"'"'s computed influence data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the influencing node influencing the artist node.

8. The machine readable medium of claim 6, wherein generating the second graph further comprises:

adding an artist node to the second graph, the artist node represents an first artist selected from the plurality of artists;

adding a following node to the second graph, wherein the following node represents a second artist that followings the first artist, wherein the size of the following node depends on the second artist'"'"'s computed following data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the artist node influencing the following node.

9. The machine readable medium of claim 6, wherein generating the second graph further comprises:

limiting the number of influence nodes added to the second graph to a pre-determined number of nodes.

10. The machine readable medium of claim 6, wherein generating the second graph further comprises:

limiting the number of following nodes added to the second graph to a pre-determined number of nodes.

11. An apparatus comprising:

means for receiving influence information associated with a plurality of artists, the influence information comprising data that represents influence relationships among the plurality of artists;

means for generating a first graph from the influence information, the first graph comprising nodes and edges, wherein each node represents an artist, and wherein a pair of nodes is coupled with an edge, the edge representing the influence relationship between the artists represented by the pair of nodes;

means for computing artist influence data for each of the artists, wherein the computing uses the first graph; and

means for generating a second graph using the first graph and the artist influence data.

12. The apparatus of claim 11, wherein the means for generating the second graph further comprises:

means for adding an artist node to the second graph, wherein the artist node represents a first artist selected from the plurality of artists;

means for adding an influence node to the second graph, wherein the influence node represents a second artist that influences the first artist, wherein the size of the influence node depends on the second artist'"'"'s computed influence data associated with the first artist; and

means for adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the influencing node influencing the artist node.

13. The apparatus of claim 11, wherein the means for generating the second graph further comprises:

means for adding an artist node to the second graph, the artist node represents an first artist selected from the plurality of artists;

means for adding a following node to the second graph, wherein the following node represents a second artist that followings the first artist, wherein the size of the following node depends on the second artist'"'"'s computed following data associated with the first artist; and

means for adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the artist node influencing the following node.

14. The apparatus of claim 11, wherein the means for generating the second graph further comprises:

means for limiting the number of influence nodes added to the second graph to a pre-determined number of nodes.

15. The apparatus of claim 11, wherein the means for generating the second graph further comprises:

means for limiting the number of following nodes added to the second graph to a pre-determined number of nodes.

16. A system comprising:

a processor;

a memory coupled to the processor though a bus; and

a process executed from the memory by the processor to cause the processor to receive influence information associated with a plurality of artists, the influence information comprising data that represents influence relationships among the plurality of artists, to generate a first graph from the influence information, the first graph comprising nodes and edges, wherein each node represents an artist, and wherein a pair of nodes is coupled with an edge, the edge representing the influence relationship between the artists represented by the pair of nodes, to compute artist influence data for each of the artists, wherein the computing uses the first graph, and to generate a second graph using the first graph and the artist influence data.

17. The system of claim 16, wherein to generate the second graph further comprises:

adding an artist node to the second graph, wherein the artist node represents a first artist selected from the plurality of artists;

adding an influence node to the second graph, wherein the influence node represents a second artist that influences the first artist, wherein the size of the influence node depends on the second artist'"'"'s computed influence data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the influencing node influencing the artist node.

18. The system of claim 16, wherein to generate the second graph further comprises:

adding an artist node to the second graph, the artist node represents an first artist selected from the plurality of artists;

adding a following node to the second graph, wherein the following node represents a second artist that followings the first artist, wherein the size of the following node depends on the second artist'"'"'s computed following data associated with the first artist; and

adding a first edge to the second graph, wherein the first edge couples the artist node to the influence node and represents the artist node influencing the following node.

19. The system of claim 16, wherein to generate the second graph further comprises:

limiting the number of influence nodes added to the second graph to a pre-determined number of nodes.

20. The system of claim 16, wherein to generate the second graph further comprises:

limiting the number of following nodes added to the second graph to a pre-determined number of nodes.