Patent Document ID: 9524511
Application ID: 14929934
Patent Flag: 1

Claim One:
1. A method for analysing traffic on a website, the website being arranged on a server, the method comprising the steps of: allowing a plurality of visitors to visit the website, for each visit, registering a sequence of pages viewed by the visitor and/or actions performed by the visitor during the visit, for each visit, monitoring navigations and/or actions performed by the visitor during the visit while accumulating value points in accordance with content viewed by the visitor and actions performed by the visitor, and in accordance with predefined value point settings associated with content of the website, thereby obtaining an accumulated value point score for the visit, the accumulated value point score reflecting the value points collected by the visitor during the visit, defining a set of visits from the plurality of visits, building path patterns based on the visits of the set of visits, where the registered sequences form the path patterns, the path patterns including one or more full path patterns, each full path pattern corresponding to a complete registered sequence of at least one visit, and for each full path pattern, calculating a total path value being the sum of accumulated value point scores for all visits with registered sequences forming said full path pattern, the total path value for a given full path pattern thereby reflecting value points collected during all of the visits which followed the path of the full path pattern, the path patterns along with the calculated total path values thereby providing information regarding which registered sequences of pages and/or actions generate value and which do not; and redesigning the website to reinforce positive behaviour and diminish negative behaviour based on the information regarding which registered sequences of pages and/or actions generate value and which do not; wherein the path patterns form an ordered tree data structure, wherein the pages and/or actions of the registered sequences form nodes of the ordered tree data structure; wherein the method further comprises: for each visit, defining an exit node as the node where the visit ends, and assigning an exit value to the exit node, the exit value being the accumulated value point score for the visit; for each node, calculating a total exit value being the sum of all exit values assigned to the node; assigning an exit count to each exit node, the exit count being the number of visits ending at said exit node; and for each exit node, calculating a total exit efficiency per visit being the total exit value divided by the exit count.