USER NAVIGATION IN A TARGET PORTAL

• US 20160125072A1
• Filed: 10/29/2015
• Published: 05/05/2016
• Est. Priority Date: 11/05/2014
• Status: Active Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kussmaul, Timo
• Granted Patent: US 10,255,350 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/903 Querying for retrieval from the web G06F16/953
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links

Abstract

User navigation in a target portal with at least two portal pages. At least one query is created that includes uniform resource locators (URLs) of selected portal pages as search terms in a first search level; repeating until a certain abort criterion is reached: Receiving and analyzing search results of the at least one query including external websites containing search terms as part of their content; selecting a set of uniform resource locators from the received search results; creating a node in a graph-like-model for each selected URL if not already contained in the graph-like-model and associating the node with the selected uniform resource locator; creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level; and in case the certain abort criterion is reached, performing a number of actions.

Claims

1. A method of user navigation in a target portal with at least two portal pages, said method comprising:

creating at least one query including at least one of uniform resource locators of selected portal pages or content of selected portal pages as search terms in a first search level;

repeating until a certain abort criterion is reached;

receiving and analyzing search results of said at least one query including external websites containing search terms as part of their content;

selecting a set of uniform resource locators from said received search results;

creating a node in a graph-like-model for each uniform resource locator of said selected set of uniform resource locators, based on the node not already being contained in said graph-like-model and associating said node with said uniform resource locator;

creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level;

based on reaching said certain abort criterion performing;

computing said graph-like-model containing nodes and edges representing direct or indirect references between said external websites and portal pages of said target portal based on said created nodes;

defining a threshold value for a maximum distance for pairs of portal pages in said graph-like-model;

calculating distances in said graph-like-model for said pairs of portal pages of said target portal;

comparing said calculated distances for said pairs of portal pages with said defined threshold value;

creating an additional navigation path for pairs of portal pages whose distance is smaller than said threshold value; and

displaying said additional navigation path in said target portal.

2. The method according to claim 1, wherein said certain abort criterion is defined by at least one of the following thresholds:

a maximum number of nodes in said graph-like-model, and a maximum number of processed search levels.

3. The method according to claim 1, wherein said content of selected portal pages in said at least one search term comprises one of the following:

a page title, sub-title or keyword.

4. The method according to claim 1, wherein the computing an graph-like-model comprises:

for each node in said graph-like-model;

requesting a page represented from said node from an external website according to a uniform resource locator that is associated with said node;

parsing a markup of a corresponding page; and

identifying links contained in said markup.

5. The method according to claim 4, further comprising checking a corresponding reference for each identified link.

6. The method according to claim 5, wherein based on a link referencing a page of said target portal, creating a corresponding node in said graph-like-model and an edge between an actual node and the node said link references.

7. The method according to claim 5, wherein based on a link referencing a node in said graph-like-model, creating an edge between an actual node and the node said link references.

8. The method according to claim 1, wherein based on said graph-like-model, creating a distance matrix containing nodes of said graph-like-model, wherein said distance matrix gives said distances for pairs of nodes in said graph-like-model.

9. The method according to claim 8, wherein said distance matrix is created by determining the distances for said pairs of nodes in said graph-like-model by counting a number of edges along a shortest path between two nodes of a corresponding pair of nodes.

10. The method according to claim 1, further comprising:

determining page weights by calculating usage statistics for pages of said target portal; and

defining a page-specific threshold value as a function of a corresponding page weight.

11. The method according to claim 1, further comprising:

determining page weights by calculating usage statistics for pages of said target portal and for a specific user or user group; and

defining page- and user-specific threshold values as a function of corresponding page weights.

12. A computer system for user navigation in a target portal with at least two portal pages, said computer system comprising:

a memory; and

a processor in communication with the memory, wherein the computer system is configured to perform a method, said method comprising;

creating at least one query including at least one of uniform resource locators of selected portal pages or content of selected portal pages as search terms in a first search level;

repeating until a certain abort criterion is reached;

receiving and analyzing search results of said at least one query including external websites containing search terms as part of their content;

selecting a set of uniform resource locators from said received search results;

creating a node in a graph-like-model for each uniform resource locator of said selected set of uniform resource locators, based on the node not already being contained in said graph-like-model and associating said node with said uniform resource locator;

creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level;

based on reaching said certain abort criterion performing;

computing said graph-like-model containing nodes and edges representing direct or indirect references between said external websites and portal pages of said target portal based on said created nodes;

defining a threshold value for a maximum distance for pairs of portal pages in said graph-like-model;

calculating distances in said graph-like-model for said pairs of portal pages of said target portal;

comparing said calculated distances for said pairs of portal pages with said defined threshold value;

creating an additional navigation path for pairs of portal pages whose distance is smaller than said threshold value; and

displaying said additional navigation path in said target portal.

13. The computer system according to claim 12, wherein the computing said graph-like-model comprises:

for each node in said graph-like-model;

requesting a page represented from said node from an external website according to a uniform resource locator that is associated with said node;

parsing a markup of a corresponding page; and

identifying links contained in said markup.

14. The computer system according to claim 13, wherein the method further comprises checking a corresponding reference for each identified link, and wherein based on a link referencing a page of said target portal, creating a corresponding node in said graph-like-model and an edge between an actual node and the node said link references.

15. The computer system according to claim 12, wherein based on said graph-like-model, creating a distance matrix containing nodes of said graph-like-model, wherein said distance matrix gives said distances for pairs of nodes in said graph-like-model.

16. A computer program product for user navigation in a target portal with at least two portal pages, said computer program product comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

creating at least one query including at least one of uniform resource locators of selected portal pages or content of selected portal pages as search terms in a first search level;

repeating until a certain abort criterion is reached;

receiving and analyzing search results of said at least one query including external websites containing search terms as part of their content;

selecting a set of uniform resource locators from said received search results;

creating a node in a graph-like-model for each uniform resource locator of said selected set of uniform resource locators, based on the node not already being contained in said graph-like-model and associating said node with said uniform resource locator;

creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level;

based on reaching said certain abort criterion performing;

computing said graph-like-model containing nodes and edges representing direct or indirect references between said external websites and portal pages of said target portal based on said created nodes;

defining a threshold value for a maximum distance for pairs of portal pages in said graph-like-model;

calculating distances in said graph-like-model for said pairs of portal pages of said target portal;

comparing said calculated distances for said pairs of portal pages with said defined threshold value;

creating an additional navigation path for pairs of portal pages whose distance is smaller than said threshold value; and

displaying said additional navigation path in said target portal.

17. The computer program product according to claim 16, wherein the computing said graph-like-model comprises:

for each node in said graph-like-model;

requesting a page represented from said node from an external website according to a uniform resource locator that is associated with said node;

parsing a markup of a corresponding page; and

identifying links contained in said markup.

18. The computer program product according to claim 17, wherein the method further comprises checking a corresponding reference for each identified link, and wherein based on a link referencing a page of said target portal, creating a corresponding node in said graph-like-model and an edge between an actual node and the node said link references.

19. The computer program product according to claim 16, wherein based on said graph-like-model, creating a distance matrix containing nodes of said graph-like-model, wherein said distance matrix gives said distances for pairs of nodes in said graph-like-model.

20. The computer program product according to claim 16, wherein the method further comprises:

determining page weights by calculating usage statistics for pages of said target portal; and

defining a page-specific threshold value as a function of a corresponding page weight.