Behavioral WEB Graph

• US 20080313137A1
• Filed: 12/06/2007
• Published: 12/18/2008
• Est. Priority Date: 06/12/2007
• Status: Abandoned Application

• Current Assignee: SoundStarts, Inc.
• Original Assignee: SoundStarts, Inc.
• Inventors: Galvin, Brian
• Application Number:
  US11/951,753
• Publication Number:
  US 20080313137A1
• Time in Patent Office: Days
• US Class Current: 707/2
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A map representing relationships between network nodes is provided, comprising a matrix of points in the map, each point representing a pair of different nodes or collections of nodes coupled to the network, and a value associated with each point, the value indicating a probability that a user connected at one of the nodes or collection of nodes associated with the point will next connect to the other node or collection of nodes associated with the point.

Claims

1. A map representing relationships between network nodes, comprising:

a matrix of points in the map, each point representing a pair of different nodes or collections of nodes coupled to the network; and

a value associated with each point, the value indicating a probability that a user connected at one of the nodes or collection of nodes associated with the point will next connect to the other node or collection of nodes associated with the point.

2. The map of claim 1 wherein the network is a communications network, the user at one of the nodes is a first user having a communication device coupled to the network, and connecting to the other node comprises placing and connecting a call to a second user having a communication device coupled to the network.

3. The map of claim 1 wherein the network is a data packet network, the user at one of the nodes is a first user having a first network-compatible digital appliance, and connecting to the other node comprises establishing a data sharing connection to a second network-compatible digital appliance associated with a second user.

4. The map of claim 3 wherein the network is the Internet network.

5. The map of claim 1 wherein the matrix is a square matrix with a unique row and a unique column associated with each node, the points in the map being intersections of rows and columns in the matrix, each intersection defining a probability for the two associated nodes at the intersection.

6. The map of claim 5 wherein the network is the Internet network, and the nodes are web pages connected in the Internet network.

7. The map of claim 6 further comprising rows and columns representing nodes connected to the Internet, other than web pages in the network.

8. The map of claim 7 wherein the probability values at the points in the map are normalized as decimal values between zero and one, so that the sum of values in a row or a column is 1, representing all of the actions that might be taken.

9. A method for representing relationships between network nodes, comprising steps of:

developing a matrix of points in a map, each point representing a pair of different nodes or collections of nodes coupled to the network; and

associating a value with each point, the value indicating a probability that a user connected at one of the nodes or collection of nodes associated with the point will next connect to the other node or collection of nodes associated with the point.

10. The method of claim 9 wherein the network is a communications network, the user at one of the nodes is a first user having a communication device coupled to the network, and connecting to the other node comprises placing and connecting a call to a second user having a communication device coupled to the network.

11. The method of claim 9 wherein the network is a data packet network, the user at one of the nodes is a first user having a first network-compatible digital appliance, and connecting to the other node comprises establishing a data sharing connection to a second network-compatible digital appliance associated with a second user.

12. The method of claim 11 wherein the network is the Internet network.

13. The map of claim 9 wherein the matrix is a square matrix with a unique row and a unique column associated with each node, the points in the map being intersections of rows and columns in the matrix, each intersection defining a probability for the two associated nodes at the intersection.

14. The method of claim 13 wherein the network is the Internet network, and the nodes are web pages connected in the Internet network.

15. The method of claim 14 further comprising rows and columns representing nodes connected to the Internet, other than web pages in the network.

16. The method of claim 15 wherein the probability values at the points in the map are normalized as decimal values between zero and one, so that the sum of values in a row or a column is 1, representing all of the actions that might be taken.