Visualization and analysis of user clickpaths

• US 7,278,105 B1
• Filed: 07/25/2002
• Issued: 10/02/2007
• Est. Priority Date: 08/21/2000
• Status: Active Grant

• Current Assignee: Ip Ot Sub Ulc
• Original Assignee: Vignette Corporation (Open Text Corporation)
• Inventors: Kitts, Brendan J.
• Primary Examiner(s): SAX, STEVEN PAUL
• Application Number:
  US10/202,741
• Time in Patent Office: 1,895 Days
• Field of Search: 715734-739, 715771-773, 715748-749, 715/805, 715/802, 715/969, 715/970, 715/811, 715/745, 715/513, 709/228, 709/217, 709/231, 709/513
• US Class Current: 715/736
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34

Abstract

Methods and data processing system readable media have been created to graph user clickstream data over a network or at a network site to yield meaningful and visually esthetic information. In one set of embodiments, the method can comprise (i) performing a significance test on data from a network log and generating significance results. The method can also comprise (ii) determining which of network addresses and clicktrails between network addresses meet a traffic flow criterion. The data that meet a significance criterion, traffic criterion, or both can form (iii) graphable addresses and relationships. The method can further comprise (iv) generating statistics about the graphable addresses and relationships. The method can still further comprise (v) generating a graph based on the statistics about the graphable addresses and relationships, and (vi) changing any or all of the traffic flow, significance criterion, and statistics being computed, and regenerating the graph.

Claims

1. A method of visualizing and analyzing user clickstream data for a network comprising:

performing a significance test on the user clickstream data from a network log and generating significance results, the network log storing activities of a plurality of users;

determining which of the user clickstream data from the network log meet a traffic flow criterion and which of the significance results meet a significance criterion to form determined data; and

generating a first graph based on the determined data, wherein the first graph comprises a node-and-line format with line segments between nodes and wherein generating the first graph further comprises;

placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

placing a second number near the corresponding line segment, wherein the second number comprises a click distance between the first network address and the second network address.

2. The method of claim 1, wherein performing the significance test comprises:

calculating a probability that a first network address will be requested by a user during a session;

calculating a probability that a second network address will be requested by the user during the session; and

calculating a probability that the first network address and the second network address will be requested by the user during the session.

3. The method of claim 2, wherein performing the significance test comprises:

calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

4. The method of claim 1, wherein determining comprises determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

5. The method of claim 1, wherein determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

6. The method of claim 1, wherein:

the line segments are part of arrows between the nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

7. The method of claim 1, further comprising:

changing at least one of the traffic flow and significance criteria to another criterion; and

determining which of the user clickstream data from the network log meet the another criterion.

8. A method of visualizing and analyzing user clickstream data for a network comprising:

performing a significance test on the user clickstream data from a network log and generating significance results, the network log storing activities of a plurality of users;

determining which of the user clickstream data from the network log meet a traffic flow criterion and which of the significance results meet a significance criterion to form determined data; and

generating a first graph based on the determined data, wherein the first graph comprises a node-and-line format with line segments between nodes and wherein generating the first graph further comprises;

placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

placing a second number near the corresponding line segment, wherein the second number comprises a probability that the first network address and the second network address will be requested by a user during a session.

9. The method of claim 8, further comprising:

changing at least one of the traffic flow and significance criteria to another criterion; and

determining which of the user clickstream data from the network log meet the another criterion.

10. The method of claim 8, wherein performing the significance test comprises:

calculating a probability that a first network address will be requested by a user during a session;

calculating a probability that a second network address will be requested by the user during the session; and

calculating a probability that the first network address and the second network address will be requested by the user during the session.

11. The method of claim 10, wherein performing the significance test comprises:

calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

12. The method of claim 8, wherein determining comprises determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

13. The method of claim 8, wherein determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

14. The method of claim 8, wherein:

the line segments are part of arrows between the nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

15. A method of visualizing and analyzing user clickstream data for a network comprising:

performing a significance test on the user clickstream data from a network log and generating significance results, wherein the network log stores activities of a plurality of users and wherein traffic flow information is incorporated into the significance test;

determining which of the significance results meet a significance criterion to form significant data; and

generating a first graph based on the significant data, wherein the first graph comprises a node-and-line format and line segments between nodes, wherein generating the first graph further comprises;

placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

placing a second number near the corresponding line segment, wherein the second number comprises a click distance between the first network address and the second network address.

16. The method of claim 15, wherein performing the significance test comprises:

calculating a probability that a first network address will be requested by a user during a session;

calculating a probability that a second network address will be requested by the user during the session; and

calculating a probability that the first network address and the second network address will be requested by the user during the session.

17. The method of claim 16, wherein performing the significance test comprises:

calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

18. The method of claim 15, wherein determining comprises determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

19. The method of claim 15, wherein determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

20. The method of claim 15, wherein:

the first graph comprises arrows between nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

21. The method of claim 15, further comprising:

changing the significance criterion to a different criterion; and

determining which of the significance results meets the different criterion.

22. A method of visualizing and analyzing user clickstream data for a network comprising:

performing a significance test on the user clickstream data from a network log and generating significance results, wherein the network log stores activities of a plurality of users and wherein traffic flow information is incorporated into the significance test;

determining which of the significance results meet a significance criterion to form significant data; and

generating a first graph based on the significant data, wherein the first graph comprises a node-and-line format and line segments between nodes, wherein generating the first graph further comprises;

placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

placing a second number near the corresponding line segment, wherein the second number comprises a probability that the first network address and the second network address will be requested by a user during a session.

23. The method of claim 22, further comprising:

changing the significance criterion to a different criterion; and

determining which of the significance results meets the different criterion.

24. The method of claim 22, wherein performing the significance test comprises:

calculating a probability that a first network address will be requested by a user during a session;

calculating a probability that a second network address will be requested by the user during the session; and

calculating a probability that the first network address and the second network address will be requested by the user during the session.

25. The method of claim 24, wherein performing the significance test comprises:

calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

26. The method of claim 22, wherein determining comprises determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

27. The method of claim 22, wherein determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

28. The method of claim 22, wherein:

the first graph comprises arrows between nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

29. A data processing system readable medium having code embodied therein, the code comprising:

an instruction for performing a significance test on user clickstream data from a network log and generating significance results, the network log storing activities of a plurality of users;

an instruction for determining which of the user clickstream data from the network log meet a traffic flow criterion and which of the significance results meet a significance criterion to form determined data; and

an instruction for generating a first graph based on the determined data, wherein the first graph comprises a node-and-line format and line segments between nodes and wherein the instruction for generating the first graph further comprises;

an instruction for placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

an instruction for placing a second number near the corresponding line segment, wherein the second number comprises a click distance between the first network address and the second network address.

30. The data processing system readable medium of claim 29, wherein the instruction for performing the significance test comprises:

an instruction for calculating a probability that a first network address will be requested by a user during a session;

an instruction for calculating a probability that a second network address will be requested by the user during the session; and

an instruction for calculating a probability that the first network address and the second network address will be requested by the user during the session.

31. The data processing system readable medium of claim 30, wherein the instruction for performing the significance test comprises:

an instruction for calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

an instruction for calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

32. The data processing system readable medium of claim 29, wherein the instruction for determining comprises an instruction for determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

33. The data processing system readable medium of claim 29, wherein the instruction for determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

34. The data processing system readable medium of claim 29, wherein:

the line segments are part of arrows between the nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

35. The data processing system readable medium of claim 29, wherein the code further comprises:

an instruction, in response to receiving a signal from a user, for changing at least one of the traffic flow and significance criteria to another criterion;

an instruction for determining which of the user clickstream data from the network log meet the another criterion; and

an instruction for generating a second graph based on the user clickstream data meeting the another criterion.

36. A data processing system readable medium having code embodied therein, the code comprising:

an instruction for performing a significance test on user clickstream data from a network log and generating significance results, the network log storing activities of a plurality of users;

an instruction for determining which of the user clickstream data from the network log meet a traffic flow criterion and which of the significance results meet a significance criterion to form determined data; and

an instruction for generating a first graph based on the determined data, wherein the first graph comprises a node-and-line format and line segments between nodes and wherein the instruction for generating the first graph further comprises;

an instruction for placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

an instruction for placing a second number near the corresponding line segment, wherein the second number comprises a probability that the first network address and the second network address will be requested by a user during a session.

37. The data processing system readable medium of claim 36, wherein the code further comprises:

an instruction, in response to receiving a signal from a user, for changing at least one of the traffic flow and significance criteria to another criterion;

an instruction for determining which of the user clickstream data from the network log meet the another criterion; and

an instruction for generating a second graph based on the user clickstream data meeting the another criterion.

38. The data processing system readable medium of claim 36, wherein the instruction for performing the significance test comprises:

an instruction for calculating a probability that a first network address will be requested by a user during a session;

an instruction for calculating a probability that a second network address will be requested by the user during the session; and

an instruction for calculating a probability that the first network address and the second network address will be requested by the user during the session.

39. The data processing system readable medium of claim 38, wherein the instruction for performing the significance test comprises:

an instruction for calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

an instruction for calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

40. The data processing system readable medium of claim 36, wherein the instruction for determining comprises an instruction for determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

41. The data processing system readable medium of claim 36, wherein the instruction for determining comprises determining whether an affinity between two network addresses is at least at a predetermined threshold level.

42. The data processing system readable medium of claim 36, wherein:

the line segments are part of arrows between the nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

43. A data processing system readable medium having code embodied therein, the code comprising:

an instruction for performing a significance test on user clickstream data from a network log and generating significance results, wherein the network log stores activities of a plurality of users and wherein traffic flow information is incorporated in the significance test;

an instruction for determining which of the significance results meet a significance criterion to form significant data; and

an instruction for generating a first graph based on the significant data, wherein the first graph comprises a node-and-line format and line segments between nodes and wherein the instruction for generating the first graph further comprises;

an instruction for placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

an instruction for placing a second number near the corresponding line segment or the corresponding arrow, wherein the second number comprises a click distance between the first network address and the second network address.

44. The data processing system readable medium of claim 43, wherein the instruction for performing the significance test comprises:

an instruction for calculating a probability that a first network address will be requested by a user during a session;

an instruction for calculating a probability that a second network address will be requested by the user during the session; and

an instruction for calculating a probability that the first network address and the second network address will be requested by the user during the session.

45. The data processing system readable medium of claim 44, wherein the instruction for performing the significance test comprises:

an instruction for calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

an instruction for calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

46. The data processing system readable medium of claim 43, wherein the instruction for determining comprises an instruction for determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

47. The data processing system readable medium of claim 43, wherein the instruction for determining comprises an instruction for determining whether an affinity between two network addresses is at least at a predetermined threshold level.

48. The data processing system readable medium of claim 43, wherein:

the first graph comprises arrows between nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.

49. The data processing system readable medium of claim 43, wherein the code further comprises:

an instruction, in response to receiving a signal from a user, for changing the significance criterion to a different criterion;

an instruction for determining which of the significance results meets the different criterion; and

an instruction for generating a second graph based on the significance results meeting the different criterion.

50. A data processing system readable medium having code embodied therein, the code comprising:

an instruction for performing a significance test on user clickstream data from a network log and generating significance results, wherein the network log stores activities of a plurality of users and wherein traffic flow information is incorporated in the significance test;

an instruction for determining which of the significance results meet a significance criterion to form significant data; and

an instruction for generating a first graph based on the significant data, wherein the first graph comprises a node-and-line format and line segments between nodes and wherein the instruction for generating the first graph further comprises;

an instruction for placing a first number near a corresponding line segment between a first node and a second node, wherein the first number comprises one of the significance results and represents a significance between a first network address, which corresponds to the first node, and a second network address, which corresponds to the second node; and

an instruction for placing a second number near the corresponding line segment or the corresponding arrow, wherein the second number comprises a probability that the first network address and the second network address will be requested by a user during a session.

51. The data processing system readable medium of claim 50, wherein the code further comprises:

an instruction, in response to receiving a signal from a user, for changing the significance criterion to a different criterion;

an instruction for determining which of the significance results meets the different criterion; and

an instruction for generating a second graph based on the significance results meeting the different criterion.

52. The data processing system readable medium of claim 50, wherein the instruction for performing the significance test comprises:

an instruction for calculating a probability that a first network address will be requested by a user during a session;

an instruction for calculating a probability that a second network address will be requested by the user during the session; and

an instruction for calculating a probability that the first network address and the second network address will be requested by the user during the session.

53. The data processing system readable medium of claim 52, wherein the instruction for performing the significance test comprises:

an instruction for calculating a product of the probability that the first network address will be requested by the user during the session and the probability that the second network address will be requested by the user during the session; and

an instruction for calculating a quotient by dividing (i) the probability that the first network address and the second network address will be requested by the user during the session by (ii) the product.

54. The data processing system readable medium of claim 50, wherein the instruction for determining comprises an instruction for determining whether a network address is requested at least a predetermined threshold number or a predetermined threshold request rate.

55. The data processing system readable medium of claim 50, wherein the instruction for determining comprises an instruction for determining whether an affinity between two network addresses is at least at a predetermined threshold level.

56. The data processing system readable, medium of claim 50, wherein:

the first graph comprises arrows between nodes; and

a direction of each of the arrows indicates a more predominant direction between its corresponding nodes compared to a reverse direction between those nodes.