Whole page personalization with cyclic dependencies
US11609964B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 16, 2020 |
| Grant date | Mar 21, 2023 |
| Priority date | — |
| Expiry date | Apr 17, 2041 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/306
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: modeling a webpage as a random field, wherein the random field comprises an undirected graph comprising nodes and edges; identifying a cyclic dependency in the undirected graph, wherein the cyclic dependency involves at least three of the nodes; breaking one or more of the edges of the undirected graph that connects the at least three of the nodes in the cyclic dependency; determining a probability of the webpage having exceeded a predetermined threshold based on compatibility functions of the edges, as updated; and sending instructions to display the webpage based at least in part on the probability of the webpage having exceeded the predetermined threshold. Other embodiments are described.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.