[0001] This application claims the benefit of the priority of (i) the Russian Utility Model application no. 2013137405 filed on August 13, 2013 entititled System, Method and Device for Scoring Browsing Sessions which is incorporated herein by reference in its entirety and (ii) International Patent Application no. PCT/RU2013/000603 filed on July 15, 2013 entitled System, Method and Device for Scoring Browsing Sessions which is incorporated herein by reference in its entirety.

FIELD OF THE DISCLOSURE

[0002] The field for the present disclosure relates to ranking systems, methods and algorithms for web pages, in particular ranking of web pages in browsing histories.

BACKGROUND OF THE DISCLOSURE

For Internet searching algorithms, ranking algorithms apply authority scores to web page, which allows web pages to be canonically ranked. With the ranking, search engines can present a list of web pages in a ranked order based on the derived authority scores. One approach to evaluating page importance analyzes a user's browsing histories and determines a web page's importance based on a probability using a stationary distribution analysis of a user's browsing graph.

SUMMARY OF THE DISCLOSURE

[0003] Embodiments of the present technology have been developed based on inventors' appreciation of certain shortcomings associated with the state of the art.

[0004] Existing algorithms do not include recency (i.e. time) of a browsing history in their analysis. Therefore, pages that were assigned a high score a few days ago may not be as authoritative for a current search, although the pages would still be attributed with their previous high scores.

[0005] Accordingly, there is a need for a system, method, device and technique that attempt to address at least some of the aforementioned issues with the current prior art schemes. [0006] In a first aspect, a method of calculating a page rank of a web page is provided. The method comprises: accessing browsing history data associated with the web page, the browsing history data comprising time data; computing a rank score for the web page utilizing the browsing history data and the time data; and ranking the web page in a list according to the rank score. [0007] In the method, computing the rank score may comprise: calculating a first score utilizing a browse rank score of the browsing history data and the time data; calculating a second score utilizing query dependent component for the web page; and adding the first score adjusted by a first factor with the second score adjusted by a second factor to produce the rank score.

[0008] In the method, the first factor may be mathematically related to the second factor. [0009] In the method, the time data may emphasize browsing data from histories that are more recent than browsing data from older histories.

[0010] In the method, the time data may comprise first and second instances of time and an interval of time from a first moment in time to a second moment in time.

[0011 ] In the method, computing the rank score may comprise applying a derivative function to a stationary distribution of a Markov process associated with the browser history data.

[0012] In the method, computing the rank score for the web page may comprise: selecting a sequence of at least one moment in time within the interval of time; computing a first freshness value for each of the at least one moment in time and a second freshness value for a web page associated with each of the at least one moment in time; and computing a freshness measure for the web page as a function of the first and second freshness values.

[0013] In the method, the browsing history data may correspond to an interval of time from a first moment in time to a second moment in time; and computing the rank score for the web page may comprise: selecting a sequence of one or more moments in time within the interval of time, and the second moment in time, where the interval of time is divided into at least one sub-interval of time; computing for the web page a first freshness value for each moment in time of the sequence; computing for the web page a second freshness value for each moment in time of the sequence; and computing a freshness measure for the web page as a function of the first and second freshness values. [0014] In the method, the first moment in time and each moment in time may divide the interval of time into two or more sub-intervals of time.

[0015] In the method, computing for the web page the first freshness value may utilize a creation time of the web page and a count of visits to the web page in the browsing history data during a sub-interval of time immediately preceding a sub-interval of time of each moment in time of the sequence.

[0016] In the method, computing for the web page the second freshness value may utilize a creation time of the web page and computed freshness values associated with each moment in time for web pages neighbouring the web page. [0017] The method may further comprise computing for the web page an interim freshness measure for each moment in time of the sequence utilizing any corresponding computed interim freshness measure associated with a moment in time in the sequence immediately preceding each moment in time, if any and the second freshness value associated with each moment in time. In the method, the computed freshness measure for the web page may comprise a computed interim freshness measure associated with the second moment in time.

[0018] In the method, computing the rank score for the web page may utilize a transition probability corresponding to the web page multiplied by a function of the freshness measure.

[0019] In the method, computing the rank score for the web page may comprise: multiplying an estimated staying time for the web page derived from a transition matrix for the browsing history data by a function of the freshness measure; and multiplying a stationary probability distribution for the web page by the function of the freshness measure.

[0020] The method may further comprise applying partial derivatives to a first function of the rank score for the web page with a training data of browsing histories to identify values for parameters for a second function generating the rank score. [0021] The method may further comprise: computing a query-dependent ranking for the web page based on a query; and computing a merged ranking for the web page as a function of the query-dependent ranking and the rank score.

[0022] In a second aspect, a server for calculating a page rank of a web page is provided. The server comprises: a processor; a database for storing records relating to browsing histories; and page ranking software operating on the server providing instructions to the processor executing any of methods provided above.

[0023] In other aspects, various combinations of sets and subsets of the above aspects are provided. [0024] Additional aspects and advantages of the present disclosure will be apparent in view of the description which follows. It should be understood, however, that the detailed description, while indicating embodiments of the disclosure, are given by way of illustration only, since various changes and modifications within the spirit and scope of the disclosure will become apparent to those skilled in the art from this detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] With reference to embodiments thereof, the technology will next be described in relation to the drawings, which are intended to be non-limiting examples of various embodiments of the present disclosure, in which:

[0026] Fig. 1 is a schematic diagram of a network containing a search engine server and a plurality of servers hosting web sites and a device in communication with the network that is accessing the search engine server according to an embodiment;

[0027] Fig. 2 is a schematic representation of a mapping of web site browsing histories of the device of Figure 1 and other devices and transformations of the browsing histories to a graph and a table for analysis according to an embodiment;

[0028] Fig. 3 is a schematic representation of the device of Fig. 1 and its browsing application according to an embodiment;

[0029] Fig. 4 is a schematic representation of the search engine server of Fig. 1 and its

(web) page rank application according to an embodiment; and

[0030] Fig. 5 is a flowchart of an exemplary browse ranking algorithm executed by the page rank application of the search engine server of Fig. 1 according to an embodiment. DETAILED DESCRIPTION OF THE DISCLOSURE

[0031] Details of example embodiments are provided herein. The description which follows and the embodiments described therein are provided by way of illustration of an example or examples of particular embodiments of principles of the present disclosure. These examples are provided for the purposes of explanation and not limitation of those principles and of the disclosure. In the description which follows, like parts are marked throughout the specification and the drawings with the same respective reference numerals.

[0032] Before discussing details on specific features of an embodiment, a description is provided on a network having a device, as a server, that provides connections to other devices, as clients, according to an embodiment. Then, details are provided on an example device in which an embodiment operates.

[0033] First, details are provided on example networks where devices according to an embodiment may operate. Referring to Fig. 1 , details on a system of example networks and communication devices according to an embodiment are provided. Fig. 1 shows a communication system 100 where a network 102 connects search engine server 104 to other servers 106 (i.e. servers 106a and 106b) and device 108a via various communication links. A network 1 1 2 may be connected to network 1 02 via a communication link (not shown) that may be wired or wireless and permanent or temporary. Device 108a is connected to network 102 via communication link 1 10, which may be wired or wireless and permanent or temporary. In the specific embodiment, the communication link 1 10 is implemented as a wireless network havign a base station 1 1 1 . Network 102 may be the Internet. Devices connected to network 1 12, such as device 108b, may access search engine server 104 and other servers 106 through network 1 12. Two exemplary services are provided to devices 108a, 108b connected (directly or indirectly) to the network 102: website search engines; and general website browsing. Exemplary features of each service are briefly discussed in turn.

[0034] For the browsing service through servers 106 in the network 1 02, device 108b may browse through various websites in the Internet using a web browser in its graphical user interface (GUI). A typical browsing session may have a distinct opening event (e.g. opening of a new browsing window or tab in the GUI) and may have a distinct closing event (e.g. closing of the window for the session by an action of the user or by the browser itself). A session may be deemed to be ended after a certain period of time that the browser session is at a given website (e.g. 15 minutes at the current website displayed in the browser (e.g. www.yahoo.com) without any input activity to change the current website by the device 108b). When a web page is generated in the browser, as a user at device 108b activates a hyperlink in the web page such as through an input device (such as a mouse) that is associated with device 108b over a hyperlink in the web page, a call is initiated to retrieve a web page associated with the hyperlink from the server associated with the address of the hyperlink. The retrieved page, if available, is produced in the GUI and the browsing session continues. A monitoring application may be installed on device 108b relating to the browser that, upon user permission and/or authorization, tracks and monitors browsing sessions and produces data in a browsing history log relating to the sessions. Anonymized information describing a user's browsing activities (including for example, visited pages, times of visiting, submitted queries etc.) is stored in the browsing history log (not dpeicted).

[0035] For the search engine service in network 1 02, as a typical search engine service, search engine server 104 hosts a search engine web site that presents a GUI on a display of the device 108a, 108b accessing the search engine web site allowing text to be entered to the GUI relating to an Internet query to be executed through search engine server 104. For example, once a query is entered through the GUI (e.g. "What is the capital city of France <CR>"), the text of the query is parsed by search engine server 104; a search is initiated of web pages that are tracked by search engine server 104 to identify a set of web pages that align with the search; and a list of ranked web pages are displayed in the GUI. As a user at the device activates one or more of the search results, a web page from server 1 06 associated with the activated link is retrieved and displayed on device 108a, 108b.

[0036] Data relating to histories of browsing sessions and web engine searches initiated at devices 108a/108b may be tracked and stored at device 1 08a/108b in their local storage device(s), at search engine server 104 in its local database 104b and / or at other locations (not shown) in network 102. Browsing histories contain records of data relating to each web page visited during a browsing session, including data on when the session was started, how the session was started, what websites were visited, when the websites were visited, what the duration of browsing at each website was, how each web site was accessed, how the session ended and when the session ended and other information about the browsing session. Different portions of the session data may be stored at different locations. Devices 108a, 108b may execute software applications to monitor and track browsing sessions in a browsing history logs (not depicted). Data for browsing histories for one or more devices 108a, 108b may be stored at various locations, e.g. in databases of Internet Search Providers (ISPs), in local browser data files on devices, since browsers and search engines are integrated together in applications (e.g. in Chrome and Yandex), in databases of mobile networks, in data stored by browser plug-ins operating on devices 1 08a, 1 08a, 1 08b and in other applications installed in smartphones and computers. Different devices potentially present in the system 100 may access search engine server 1 04 and may also locally and / or remotely store data relating to their search histories. Data may be collected and amalgamated from one or more of the different locations and from one or more of the devices 108, then processed and analyzed to identify trends in web-browsing activities from users at devices 108a, 108b accessing search engine server 104. Data for browsing histories may be requested and retrieved from various local and remote sources using data acquisition techniques known in the art.

[0037] Fig. 2 provides a schematic mapping of browse / search history data from one or more devices 108a, 108b accessing of a mapping tool (not depicted) employed by an embodiment to create and populate data structures to store website browsing histories and patterns. Histories 200(1 ), 200(2)... 200(n) show lists of website visitation data for browsing sessions and / or searching sessions. For example, history 200(1 ) shows entries 202(1 ) for device 108a for a browsing session for a particular browsing window conducted around Jan. 1 at around 1 :00- 1 :10PM. The session information may include one or more of the URLs visited, the time of visitation and the duration of stay on the page and the method of visiting (e.g. URL input or hyperlink click from previous page).

[0038] Collectively, histories 200(1 )...(n) may be mapped into graph 204 representing a browser history for multiple devices 1 08a, 108b accessing multiple web pages from multiple servers 108a, 108b at different points of time. In graph 204 vertices 206(1 ), (2)... (n) represent web pages (corresponding to URLs) and edges 208(1 ), (2)..(m), shown as directed arrows, show transitions from one web site to another of one device 108a, 108b in its browsing history, where the base of the edge is the current website and the head of the edge (at the arrow) is the resulting destination web site being visited after a transition (e.g. after activation of a hyperlink in a current website to move to another website). There may be multiple edge 208 connecting two vertices 206 where different vertices reflect the noted web page transitions initiated independently by different devices 108a, 108b. Alternatively, edge 208 connecting two vertices 206 may reflect a collective web page transitions for all devices 108a, 108b. Graph 204 shows all browsing histories 200(1 )...(n) and does not reflect, in this view, specific single browsing histories. A feature of an embodiment maps browsing histories and generates a dataset, akin to graph 204, with additional temporal information (as to the date/time of each browsing session used to populate the graph) and then applies data shaping algorithms to rank pages utilizing a browsing graph, such as graph 204. The data may be provided from Internet browsers at devices 108a, 108b and / or collected from the servers 106. [0039] Graph 204 may be presented in table format, as foe example a table 210, containing rows and columns for each of the vertices 206(1 ), (2)... (n) represent web pages and cells 212 at the (i, j th) entry in table 210 represent browsing data for a transition from vertex 206i to vertex 206j in graph 204. Entries in the diagonal at (i, i th) entry in table 21 0 represent browsing data of remaining at vertex i in the browsing session. For example, the entries may include time data (e.g. reflecting the time when there was a transition between web pages for one or more instances (derived from browsing histories from one or more sources), transition data (e.g. reflecting how transitions were activated), location data (e.g. reflecting the locations of the computers where the web pages were being browsed) and other data (e.g. reflecting the type of browsing software used, etc.). It will be appreciated that table 21 0 contains data that can be provided from browsing histories data or from other sources.

[0040] One aspect of an embodiment provides a temporal factor (namely a "freshness" factor) that is used to apply a weighting value to a web page that is present in a browsing history for a web session. This freshness factor is calculated based on entries in table 210 and is used as a factor in ranking an importance of a web page in a browsing history.

[0041] In describing features of an embodiment, for the purpose of illustration and not limitation, the following terms and related definitions are provided describing characteristics and relationships in data relating to browsing sessions. The terms are provided in exemplary equations that one embodiment employs to map and rank aspects of the browsing sessions.

[0042] For a browsing session (denoted herein as "S") conducted on device 1 08, the web pages visited in session S are denoted as pages pi(S), P2(S), ... P _k <s ₎ (S). In the browsing history for each i E {1 , 2, k(S) - 1 } a record p,(S) transitioning to p _i+1 (S) is made ("p,(S)→ p _i+1 (S)"). Pages p,(S), Pi ₊ i(S) are neighboring elements of the session S.

[0043] For each page ("p") in the browsing history, s(p) represents the number of sessions that have been initiated at page "p". For each pair of neighboring elements {p _/ , p _/+ i}from a session, l(p,, p _i+ i) represents the number of sessions containing that pair of neighboring elements.

[0044] Graph 204 is algebraically represented as G = (V, E), which can be seen as another algebraic representation of data presented in table 210. Therein, a set of vertices V (representing vertices 206) include all web pages identified in the browsing histories and includes additional vertex x. The set of directed edges E (representing edges 208) include ordered pairs of neighboring elements {p1 , p2}. The set E also includes additional edges from the last pages of all the sessions to vertex x. [0045] Reset probability σ(ρ) is denoted as a probability of choosing page p when a new browsing session is started. It is proportional to a number of sessions s(p) starting from the page p. As such for one embodiment, the reset probability can be set to zero, so that σ(χ) = 0.

[0046] l(p, x) denotes the number of sessions of the browsing histories that end on page p, where p→ x e E. Transition probability "co" represents a probability of activating a hyper link on page pi to transit to p ₂ ("pi→P ₂ ") _> so that:

ω (p1→ p2) = Equation 1

[0047] Q (p) represents an estimated staying time in a browsing history at page p. A ranking value of page p, noted as a browse rank BR(p), is represented by:

BR (p) = 0(ρ)π(ρ),

Equation 2 where

(p)— ά(ρ) {ρ) -f- ωϊρ ρ.ϋ ΐτξ ρ

Equation 3

[0048] It will be appreciated that Equations 2 and 3 hold for p = x as well, where

~a(p) = a(1 - π(χ)) + π(χ).

[0049] A variable that an embodiment introduces into evaluating a browsing session is timeliness. Generally, BR (p) may not reflect the freshness of links in a browsing history. As such, rankings based on BR (p) alone may provide results where a user is present with rankings where "old" and "fresh" links have probabilities that are similar as there is no time component factored into their probabilities. An embodiment incorporates a freshness measure to browsing histories, providing a Freshness Browsing Probability (FBR) function. Further details on this freshness measure is provided below. [0050] For an embodiment, as part of a freshness measure, time intervals for a browsing session are used to measure the "freshness" of a page in the session. For a browsing session having two instances of time τ and T, where τ < T, a time interval [τ, T] is divided into K parts, so that for the set of times [t,_i , t,], i e {1 , 2,..., K}, to = τ, ti - ti_i = (Τ-τ) / K Equation 4

[0051] Time t(p) represents the time (e.g. the date) when page p from V was created. Vertex x is considered to be created at moment τ. For time interval i e {1 , 2,... K}, p e V is defined as a vertex (web page) created before moment t,.

[0052] An embodiment calculates a freshness score to a browser page, which can then be used in a ranking algorithm when assessing browsing histories. An embodiment defines the function F ("Freshness") at time t = i for an initial value F ⁰ , (p) representing a freshness value of page p and its links as follows:

' ^" Equation 5a where a ⁰ and b° are non-negative parameters, n,(p) = 1 if the vertex p is created in the i-th period, otherwise n,(p) = 0; m,(p) is the number of visits of page in the i-th period. As an initial calculation, an embodiment can set F ⁰ ,(x) = 0. In Equation 5, the higher the value of F ⁿ i(x), the "fresher" its score. [0053] Expressed differently, an embodiment provides a freshness value for web page p, ("f(p)") that is based on a combination of a plurality of factors each of which may be provided with a weighting value relative to the other factors. In one embodiment, f(p) for web page p includes a FBR(p) component and a query dependent component ("QD(p)") for the web page. The QD component may be provided from a document ranking function, such as BM25 (or "Okapi BM25"). As such, a f(p) may be expressed as: f _q (p) = A FBR(p) + (1 -A) QD(p,q) Equation 5b where λ may be a value between 0 and 1 . As such, the first factor for FBR(p) is mathematically related to the second factor for QD(p, q). Here, the mathematical relationship inversely scales the two components by the λ and (1 - λ) factors. In other embodiments, independent factors can be applied to the FBR and QD components.

[0054] Equation 5a provides a calculation for an initial measure F ⁰ , (p). Equation 6, below, provides an incremental (delta) freshness value that is based on spreading the initial freshness value over vertices towards the outgoing edges of a graph. In one embodiment, spreading involves using the time associated with the browsing history (as a time marker as a freshness value for the web pages in the browser history) and arithmetically distributing a component of the time across the web pages in the browsing history as part of a rank score for the web pages. For example, in the browsing history, a transition from web page X to web page Y on January 1 , 2013 will be provided a certain rank score based on the freshness of that transition relative to the date of the execution of a ranking algorithm by an embodiment. Also, from the browsing history, a transition from web page X to web page Y on February 1 , 2013 will be provided another rank score based on the freshness of that transition relative to the date of the execution of the ranking algorithm. The transition executed on February 1 , 2013 may be ranked higher (i.e. more prominently) than the transition executed on January 1 , 2013, as the February 1 , 2013 transition is more recent than the January 1 , 2013 transition. For an embodiment, an incremental freshness value is calculated as follows:

W p)

(I - μ ) -

Equation 6 where μ e [0, 1 ]. W,(p) is a score assigned by the "local" freshness measure to the vertex p in the i- th period. This local measure is defined in the same way as initial measure F ⁰ , values:

Equation 7 [0055] An embodiment spreads the freshness measure through outgoing links from a page even if there are no fresh links among them. As such, in calculation, the weight of the page is increased by a value (e.g. increased by a value of 1 ) if it was created before moment t,. The results of Equation 7 illustrate an influence of neighbors on the freshness measure of the page. [0056] With the above equations defined, an embodiment defines a freshness measure, F, as follows:

F,(p) = pF,_ ₁ (p) ₊ AF,(p) Equation 8

As a general feature, the freshness measure decreases as time goes if there are no activities concerned with the vertex p (the parameter β is from (0, 1 )). The decrease may be linear, nonlinear or exponential. One embodiment applies an exponential decrease, such that:

F,(p) = AFo(p) Equation 9 if there were no browsing activities during the period [τ, t,]. Equations 8 and 9 provide exemplary formulae which may be implemented in an algorithm for arithmetically distributing a component of the time across the web pages in the browsing history as part of the rank score for the web pages.

[0057] An example of application of a freshness analysis in a browse history by an embodiment is now provided, where for Equation 7 all considered vertices and edges have been assumed to be created before the time t,.

[0058] For the example, the freshness measure assigns to page p in graph G a freshness score F _K (p). The value for the number of sessions, I, is factored with a freshness probability score, such that l(pi, p ₂ ) is replaced with \(p p ₂ ) x F _K (p ₂ )- As such, a fresh transition probability oo _F (p1→p2) of edge p1→p2 is provided as:

Equation 10 where Table A

[0059] Following is a description of processes used to identify some exemplary values for the parameters provided in Table A. Once values Table A are determined, then a time-based rank for a web page can be computed using Equation 10.

[0060] Following is a description of another features of an embodiment. For an exemplary set of browser history data, f _q (p) represents a freshness value for a page p for a query q, to which a query dependency component is added (per Equation 5b). Exemplary browsing histories comprise sets of pages V ¹ _q , V ² _q ,...V ^k _q for each query q, which are ordered from the most relevant ("most recent") to least relevant ("oldest") pages. In other words, V ¹ _q is the set of all pages with the highest score selected from among k labels, pages from the set V ^k _q have the lowest score. For any two pages pi e Vq', p ₂ e V _q ^j , a penalty score, h, is a loss function. In an embodiment, h (i, j, f _q (p ₂ )— f _q (pi)) is a penalty value imposed if the position of page pi according to a ranking algorithm is higher than the position of page p ₂ but

i < j. For the loss function, an embodiment considers a loss with margins by > 0, where b y are fixed for each pair i,j and where 1 < i < j < k, where h (i, j, x) = min {x+b , 0} ² , namely where h (i, j, x) = 0 if x + by > 0, otherwise, h (i, j, x) = (x + by) ² . A vector ω represents a vector of parameters of browser history values. For an embodiment, the freshness value in

Equation 1 1 may be minimized by a gradient-based optimization analysis, such as gradient descent. As part of an optimization analysis, a gradient may be calculated for i (p) instead of F (co), since F (co) is the sum of the functions h (i, j, x) and since the function h is composed of h(x) and f _p (x). As such:

Equation 1 2 and as such : Equation 1 3.

[0061 ] It will be appreciated that parameters for a fresh ranking algorithm may involve tuning of its parameters. While such tuning may be achieved via various methods (e.g. manually, iteratively, trial and error, etc.), an embodiment provides a formulaic method for identifying appropriate values for the parameters of Equation 1 0, using derivatives.

[0062] In particular, an embodiment applies a derivative function to a stationary distribution of a Markov process of a browser history when its transition probabilities are functions of a stationary distribution of another Markov process. Partial derivatives d _Fres I da , 3π _Ρ / 3β as solutions of a system of linear equations may be found by solving the equations:

Equation 14 (x} + (l -- jx

Equation 15

A solution for the derivative 3ω / 3β (q→p) may be determined by finding 3F _k / 3β (p) from the following equation:

Equation 16 As such, an embodiment may utilize a system of linear equations having solutions for 3π _Ρ /3μ , 3π _Ρ / 3a ₀ , 3 _F / 3ai (derivatives 3 _F / 3b ₀ , 3 _F / 3bi are the solutions of the same equations).

The first equations of the system of linear equations may be the same as Equation 15. By choosing a parameter for β, the remaining values to be determined are for dAF, 1 3μ, dAF„ 13a ₀ and dAF, I 3ai For an embodiment, these values are determined as follows:

where W p→ p) .... W p) / ∑ WJp') ;

Equation 17

Equation 18

From Equations 1 7 and 18, values for different parameters (e.g. a, a ⁰ and a ¹ ) can be produced for selected time intervals. As such, for an embodiment, values for parameters τ, T, K are identified and populated into Equations 17-18 to produce the values for the parameters. Values for parameters τ, T, K may be chosen from a relatively small number of values. For example, an embodiment may utilize a period of time [τ, T] for a period of 1 week and parameter K may be selected so that the length of one period [ί,-ι, t,] is selected from different time values, such as web pages being 1 day old, 6 hours old, 3 hours old and 1 hour old. More recent, newer (namely "fresher") pages contained in browsing histories may be ranked higher than older pages. As such, the time data incorporated in the browsing history data emphasizes results in the history that are more recent than browsing data that are older in the history. Other time periods and intervals may be used. It will be appreciated that an embodiment may use different parameters for identifying fresher pages from older pages. One embodiment may use a relative threshold (e.g. fresher pages are pages browsed within the last hour, day, week, month etc. of the current date or an event) or an parameters for identifying fresher pages from older pages. One embodiment may use an absolute threshold (e.g. fresher pages are pages browsed before January 1 , 2013 or another set date or time or event).

[0063] Once values for parameters are produced from Equations 17 and 18, effectively, values for the parameters listed in Table A have been identified. As such, a time-based rank for a web page can be computed using Equation 10 using all the calculated values, producing a score for a web page. The process can be repeated for N web pages producing N scores and the web pages can be ranked according to the scores. As such, when device 108a, 108b is accessing search engine server 104 and when device 108a, 108b submits a search query to server 1 04, server 104 can analyze data relating to browsing histories that it has access to, select appropriate values for time frames, calculate parameters for the FBR equations (e.g. equations 17 and 1 8), calculate time based browsing history scores for web pages, rank the scored web pages and send the results of the search to device 108a, 108b for generation on its display, showing a ranked list of web pages as the search results for the search query.

[0064] Further detail is provided on devices that collectively implement all features of an embodiment described herein. [0065] Referring to Fig. 3, device 108a, 1 08b is a computing device that connects to network 102. Device 108a, 108b is built on a processor-based platform having typical, computing-based components, including display 300, processor 302, memory storage device 304, secondary storage hard drive (not shown) and communication module 306 (providing necessary hardware, software and firmware components to allow device 1 08a, 108b to connect to outside networks, such as network 102. Applications stored in memory storage device 304 provide instructions executed on processor 302 enabling processor 302 to control features and functions of device 1 08, receive inputs and process outputs. Browser application 308 generates a set of graphical user interfaces (GUIs) on display 300 and allow inputs to be provided to the GUIs (e.g. from keyboards, mice, touchpads, external devices etc.). It will be appreciated that device 108a, 108b may be a "thin" or "thick" client to network 102. Statistics may be tracked and stored on device 102 in memory storage device 304. For example a data file 310 containing browsing histories generated by browser application 308 may be stored. The browsing histories may include all or some of the data described herein for earlier browsing histories.

[0066] Referring to Fig. 4, server 104 is located in network 102 and also is a computing device. Server 104 may be a single server or comprise multiple servers. Server 104 is a processor-based device having processor 400, memory storage device 402, access to secondary storage database 104b and communication module 404 (providing necessary hardware, software and firmware components to allow server 104 to connect to outside devices and networks, such as device 108a, 108b and network 102. Applications stored in memory 402 provide instructions executed on processor 400 enabling processor 400 to control features and functions of device server 104. Search engine application 406 is stored in memory 402 and provides instructions to processor 400 to analyze data in browsing histories, rank web pages and generate ranked results in response to queries. Search engine application 406 may include algorithms that implement any of the equations as provided herein in determining a page rank. [0067] Referring to Fig. 5, process 500 shows a flow chart of exemplary processes executed by search engine application 406 on server 104 through processor 400. After search engine 406 is initiated at start process 502, at some point, server 1 04 receives a signal that a query has been submitted to it (e.g. from device 108). At that point, process 504 receives the query and initiates a freshness browse rank analysis as described herein. As part of process 504, browse history data is retrieved. The browse history data may be in part, locally accessible (e.g. from database 104a or memory 402) and / or it may be remotely accessible (e.g. from device 108). After the browsing history is retrieved, at process 506, various parameters for the fresh browse rank (FBR) analysis are identified. In one embodiment, time parameters (e.g. τ, T, K ) are selected from preset ranges / values. Once parameters have been selected, one or more parameters of an FBR equation (e.g. from Equations 17 and 18) may be calculated for a given browser history per process 508. This may include applying a derivative function to a stationary distribution of a Markov process of a browser history when its transition probabilities are functions of a stationary distribution of another Markov process. One or more of these values may have been previously calculated and simply retrieved by the application. Next at process 510, a FBR score is computed using an appropriate FBR equation (e.g. Equation 10) for each web page in the history. At process 512, all of the web pages are ranked based at least in part on the FBR scores and ranked results may be sent to a device in the network, such as to device 108, which initiated the query. The receiving device (e.g. device 108) can then access the results and a ranked list of web pages would be generated on its display. Next at process 514, a check is made to see if one or more of the browser histories have been updated and / or if another trigger condition has been satisfied (e.g. passage of a predetermined amount of time since the last execution of a ranking, such as a day, week or month, etc., occurrence of a change event in the browsing environment, such as the entry or loss of a predetermined number of browser histories or web pages, etc.). If so, process 500 returns to process 506, but it may instead return to a different process (e.g. process 502, 504, 508, 510 etc.) in another embodiment. Alternatively or additionally, process 500 may initiate an intermediary process (not shown) prior to its return (to process 506) or a different process may be spawned.

[0068] It will be appreciated that in other embodiments the order of processes in process 500 may be re-arranged and additional processes may be provided. Process 500 is shown as executing on server 104, but its execution may be distributed among many servers/devices. Process 500 may in part or in whole be executed on device 108. [0069] As an exemplary validation of features of an embodiment, a trial run of a fresh browse ranking algorithm following scoring and ranking features described herein was executed on a browsing history generated from searches conducted on a commercial search engine including approximately 1 13,000 web pages and 478,000 transitions in the browsing log. For ranking evaluation, a set of queries from the queries submitted by users during over a three day period, where a query was tracked as a query pair containing <text of query, time query>. Each query pair was manually assigned a label based on both the freshness of the page in respect to the query time and the topical relevance of the page to the query. [0070] A relevance score was marked using grading label, such as Perfect, Excellent, Good, Fair, Bad. The browsing data was divided into two parts. In the first part, comprising 75% of the dataset, the parameters were trained as noted and the second part the algorithms described herein was tested. The parameters for a test run for an embodiment were identified by maximizing the loss- function in the way described in above. The parameters for Table A were identified utilizing a maximizing a Normalized Discounted Cumulative Gain (NDCG) metric, producing the following values:

K = 24, a - 5.2, b - 1 .0, a - 6.9, b « 1 .1 , μ = 0.2, a = 0.18, β = 0.9.

The value for K was chosen from the set {7, 28, 56, 168}. In these cases the lengths of periods [ti ₊ i , ti] equal to 1 day, 6 hours, 3 hours and 1 hour correspondingly. Table B illustrates results of ranking performance on metrics NDCG@5 and NDCG@10 over ranking algorithms according to an embodiment.

Table B

[0071] It will be appreciated that the embodiments relating to client devices, server devices and systems may be implemented in a combination of electronic modules, hardware, firmware and software. The firmware and software may be implemented as a series of processes, applications and / or modules that provide the functionalities described herein, typically by providing instructions for execution on a related processor. The instructions may be stored in a memory storage device on either or both of the client or server devices that is accessible by the processor. Typically, the memory device is locally located in the same device (or near to the same device) housing the processor. The modules, applications, algorithms and processes described herein may be executed in different order(s) and in parallel. Interrupt routines may be used. Data, applications, processes, programs, software and instructions may be stored in volatile and non-volatile devices described and may be provided on other tangible medium, like USB drives, computer discs, CDs, DVDs or other substrates herein and may be updated by the modules, applications, hardware, firmware and / or software. The data, applications, processes, programs, software and instructions may be sent from one device to another via a data transmission.

[0072] As used herein, the wording "and / or" is intended to represent an inclusive-or. That is, "X and / or Y" is intended to mean X or Y or both.

[0073] In this disclosure, where a threshold or measured value is provided as an approximate value (for example, when the threshold is qualified with the word "about"), a range of values will be understood to be valid for that value. For example, for a threshold stated as an approximate value, a range of about 25% larger and 25% smaller than the stated value may be used. Thresholds, values, measurements and dimensions of features are illustrative of embodiments and are not limiting unless noted. Further, as an example, a "sufficient" match with a given threshold may be a value that is within the provided threshold, having regard to the approximate value applicable to the threshold and the understood range of values (over and under) that may be applied for that threshold.

[0074] It will be seen from the disclosure that a technical problem that the disclosure addresses is how to provide improved web page rankings of using browser history data. A further technical problem that the disclosure addresses is how to provide efficient analysis of web browser history data for web page rankings.

[0075] The present disclosure is defined by the claims appended hereto, with the foregoing description being merely illustrative of embodiments of the disclosure. Those of ordinary skill may envisage certain modifications to the foregoing embodiments which, although not explicitly discussed herein, do not depart from the scope of the disclosure, as defined by the appended claims.