Access and presentation of files based on semantic proximity to current interests

• US 9,460,191 B1
• Filed: 04/14/2016
• Issued: 10/04/2016
• Est. Priority Date: 07/22/2015
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gaucher, Brian P., Kephart, Jeffrey O., Lenchner, Jonathan, Melville, David O. S.
• Primary Examiner(s): Hussain, Tauqir
• Application Number:
  US15/098,485
• Time in Patent Office: 173 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/156 Query results presentation
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/287 Visualization; Browsing
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: H04L 51/04 Real-time or near real-time messaging, e.g. instant messaging [IM]
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

A method for managing and rendering one or more information nodes relative to a current focus. The method receives one or more principal topics from an analysis of the information nodes. The method determines a topic vector from a similarity of a first information node to each of the principal topics and a map from the topic vector to a storage location of the first information node. The method determines one or more current topics from a second information node that has been recently accessed by a user and a current focus vector from a similarity of the one or more current topics to the one or more principal topics. The method renders the current focus vector and the first information node according to a rendering algorithm that is applied to the current focus vector and the first information node.

Claims

1. A method for managing and rendering one or more information nodes relative to a current focus, the method comprising:

receiving, by a processor, one or more principal topics from a content of one or more information nodes visited by a user, wherein the one or more information nodes includes at least one first information node;

determining, by a processor, a topic vector from a similarity of a content of the first information node to the one or more principal topics, wherein the topic vector is determined using a Latent Dirichlet Allocation algorithm;

creating, by a processor, a map from the topic vector to a storage location of the first information node;

determining, by a processor, one or more current topics from a content of a second information node, wherein the second information node is an information node that has been accessed recently;

determining, by a processor, a current focus vector from a similarity of the one or more current topics to each of the one or more principal topics, wherein the current focus vector is determined using the Latent Dirichlet Allocation algorithm;

rendering, by a processor, a representation of the current focus vector and a representation of the first information node according to a rendering algorithm, wherein the rendering algorithm;

determines a position and a size of the representation of the current focus vector and of the first information node;

includes a force-directed drawing algorithm;

includes an algorithm that renders a content of the first information node as a word cloud; and

uses the similarity of the one or more current topics to each of the one or more principal topics to generate a position and a size of the representation of the current focus vector and of the first information node; and

accessing the first information node in the storage location by selecting the representation of the first information node.