US 2023/0401222 A1 · DYNAMIC PRESENTATION OF SEARCHABLE CONTEXTUAL ACTIONS AND DATA

Abstract

Disclosed methods and systems allow a central server to monitor electronic units of work accessible to a group of computers and generate a nodal data structure representing the units of work. The server then uses various protocols, such as hashing algorithms and/or executing artificial intelligence and machine learning models to identify similar and/or related units of work. The server then merges/links the nodes corresponding to the similar/related units of work. The server also monitors all user activities. When a user or a software system/service accesses electronic content on his, her, or its electronic device, the server identifies a node corresponding to the accessed electronic content and associated unit(s) of work and presents searchable data and actions related to the identified node and any related/linked nodes.

Claims20

Dependent claims

A method comprising:

receiving, by a processor, an indication that a user has interacted with a representation of a subset of a set of data output by a computing device;
identifying, by the processor using a nodal data structure, at least one node and at least one node associated with to the at least one node, the nodal data structure comprising a set of nodes corresponding to at least a portion of the set of data,
wherein each node within the set of nodes corresponds to a respective subset of the set of data, and wherein each pair of nodes that comprises two nodes relevant to each other based on a relevancy threshold are associated together within the nodal data structure;
and
presenting, by the processor to the computing device, data corresponding to the at least one node and at least one other node associated within the nodal data structure.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application

18/239,077Filed 28 Aug 2023

Priority

18 Oct 2017

Published

14 Dec 2023

Term ends

Not estimatedThe source records don’t support an estimate.

Classification11 codes

G06F 7/32
Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc: merging, i.e. combining data contained in…
G06F 16/2465
Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries: query processing support for facilitating data mining…
G06F 9/451
Arrangements for executing specific programs: execution arrangements for user interfaces
G06F 16/137
File access structures, e.g. distributed indices: hash-based

Family

Application62/573,914Us provisional application · filed 18 Oct 2017

Application16/164,465Continuation in part · filed 18 Oct 2018

Application62/854,682Us provisional application · filed 30 May 2019

Application62/951,748Us provisional application · filed 20 Dec 2019

Application16/889,409Continuation in part · filed 1 Jun 2020

Application17/127,872Continuation · filed 18 Dec 2020

Application17/510,349Continuation · filed 25 Oct 2021

Application17/568,526Continuation · filed 4 Jan 2022

Application18/239,077Continuation

Application17/127,872Continuation in part

US 10,762,060 B1Related patent