1. Field of the Invention
The present invention relates to network usage data. More particularly, the present invention relates to path discovery and analytics for network data.
2. Description of the Related Art
The process of analyzing Internet-based actions such as web surfing patterns is known as web analytics. One part of web analytics is understanding how user traffic flows through a network (also known as user paths). This typically involves analyzing which nodes a user encounters when accessing a particular network. In large networks such as, for example, large search engine/directories, billions of pageviews may be generated per day. As such, analyzing this huge amount of data can be daunting. Such analysis is needed, however, to determine common user behavior in order to optimize the network for better user engagement and network integration.
What is needed is a solution that efficiently discovers all user paths across a large-scale network.
A solution is provided that efficiently tracks user paths within a large network. Raw node visit data may be received that indicates which users visited which nodes in the network at which time. This data may then be organized into sessions. Unique pathviews may be calculated for each session of the nodes visit data as well as the frequency of occurrence of each unique path view. This information may then be used to understand how users are progressing through a network.
Reference will now be made in detail to specific embodiments of the invention including the best modes contemplated by the inventors for carrying out the invention. Examples of these specific embodiments are illustrated in the accompanying drawings. While the invention is described in conjunction with these specific embodiments, it will be understood that it is not intended to limit the invention to the described embodiments. On the contrary, it is intended to cover alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims. In the following description, specific details are set forth in order to provide a thorough understanding of the present invention. The present invention may be practiced without some or all of these specific details. In addition, well known features may not have been described in detail to avoid unnecessarily obscuring the invention.
A solution is provided that efficiently tracks user paths within a large network. Raw node visit data may be received that indicates which users visited which nodes in the network at which time. This data may then be organized into sessions. Unique pathviews may be calculated for each session of the nodes visit data as well as the frequency of occurrence of each unique path view. This information may then be used to understand how users are progressing through a network.
Splitting node visits into different sessions allows the resulting data to be easily analyzed as to how many times a transition from a particular node to another node occurred. This information is useful in determining user patterns, for example, whether something on node 1 drew the user to node 2, or whether the user accessed node 2 on a whim.
The data collector may convert the raw data into data that is grouped by session ids.
Referring back to
Referring back to
Referring back to
Thus, the user visited node D and then went back to node C, wherefrom he visited node E. The path views for this session may be:
These two path views indicate the unique paths the user took.
Referring back to
At 706, duplicate, successive node visits within the same session may be removed from the node visit data organized into sessions. At 708, it may be determined, from the node visit data, if the user has viewed more nodes than a predetermined threshold within a predetermined period of time. If so, then the node visit data corresponding to the user may be flagged with a flag indicating probable robotic activity.
At 710, all unique pathviews for each session of the node visit data organized into sessions may be calculated, wherein no loop occurs in any unique pathview. At 712, the frequency of occurrence of each unique path view may be calculated. At 714, the node visit data organized into sessions, the unique path view information, and the frequency of occurrence information may be organized into a single file.
While the invention has been particularly shown and described with reference to specific embodiments thereof, it will be understood by those skilled in the art that changes in the form and details of the disclosed embodiments may be made without departing from the spirit or scope of the invention. In addition, although various advantages, aspects, and objects of the present invention have been discussed herein with reference to various embodiments, it will be understood that the scope of the invention should not be limited by reference to such advantages, aspects, and objects. Rather, the scope of the invention should be determined with reference to the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
6470383 | Leshem et al. | Oct 2002 | B1 |
6671711 | Pirolli et al. | Dec 2003 | B1 |
6804701 | Muret et al. | Oct 2004 | B2 |
7017110 | Chi et al. | Mar 2006 | B1 |
7533179 | Tarquini et al. | May 2009 | B2 |
7590619 | Hurst-Hiller et al. | Sep 2009 | B2 |
20020067360 | Chi et al. | Jun 2002 | A1 |
20020130907 | Chi et al. | Sep 2002 | A1 |
20020143925 | Pricer et al. | Oct 2002 | A1 |
20040054784 | Busch et al. | Mar 2004 | A1 |
20040139192 | Spaid | Jul 2004 | A1 |
20080183664 | Cancel et al. | Jul 2008 | A1 |
20090037355 | Brave et al. | Feb 2009 | A1 |
Number | Date | Country | |
---|---|---|---|
20080069081 A1 | Mar 2008 | US |