IP Library Granted Patent US 12,602,421
Granted Patent B1
US 12,602,421 · App. 19/034,960 · Granted Apr 14, 2026

Classifying retrieved context data for a relativistic response

Inventors: Ofir Ezrielev (Be'er Sheva, IL); Lev Makler (Be'er Sheva, IL); Yehonatan Cohen (Ashdod, IL)
Assignee: Dell Products L.P.
G06F16/35G06F16/383
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,602,421
App. No.
19/034,960
Granted
Apr 14, 2026
Kind
B1
Abstract

Methods and systems for managing operation of a system are disclosed. A prompt may be obtained that indicates that relativistic response is to be provided by an inference model. A retrieval process may be performed based on the prompt to obtain context data. The context data may be classified to obtain context data groupings and corresponding meaning descriptions. The context data groupings may be classified based on characteristics of portions of the context data. Ingest data sets may be obtained using the prompt and the context data groupings. The ingest data sets may be provided to the inference model to obtain corresponding responses. The responses may be compared using the meaning descriptions to obtain the relativistic response for use in providing computer-implemented services.

Claims (73)

1 . A method for managing operation of a system, the method comprising:

based on a determination that a relativistic response for a prompt submitted for processing by a generative trained machine learning model is to be provided:

performing a retrieval process for the prompt to obtain a plurality of portions of context data from at least one designated data source;

classifying at least the plurality of portions of context data to obtain context data groupings and corresponding meaning descriptions for the context data groupings;

obtaining ingest data sets using the prompt and the context data groupings;

obtaining at least one non-relativistic response using the ingest data sets and the generative trained machine learning model;

obtaining the relativistic response using the at least one non-relativistic response and the corresponding meaning descriptions; and

providing computer-implemented services using the relativistic response,

wherein prior to performing the retrieval process, the method further comprises:

analyzing at least the prompt for indication of desirability of the relativistic response; and

in a first instance of the analyzing where the indication is that the relativistic response is desired: making the determination.

2 . The method of claim 1 , wherein classifying the at least the plurality of portions of context data comprises:

identifying a highest ranked portion of the plurality of portions of the context data;

identifying characteristics of the highest ranked portion; and

clustering the plurality of portions of the context data based on the characteristics to obtain the context data groupings.

3 . The method of claim 2 , wherein during the retrieval process the plurality of portions of the context data are ranked with respect to relevancy to the prompt, and the identifying of the highest ranked portion is performed using the rankings of the plurality of portions of the context data with respect to relevancy to the prompt.

4 . The method of claim 2 , wherein identifying the characteristics of the highest ranked portion comprises at least one selected from a list of identification processes consisting of:

identifying existing tags associated with the highest ranked portion, each of the existing tags ascribing at least one of the characteristics; and

analyzing information context of the highest ranked portion to obtain the characteristics.

5 . The method of claim 2 , wherein each of the context data groupings comprises a portion of the plurality of portions of the context data, and each portion of the plurality of portions of the context data is a member of only one of the context data groupings.

6 . The method of claim 2 , wherein the corresponding meaning descriptions indicate unique meanings for each of the context data groupings, and the corresponding meaning descriptions being based on the characteristics and the context data groupings.

7 . The method of claim 1 , wherein obtaining the ingest data sets comprises:

adding a copy of the prompt to each of the ingest data sets; and

adding members of different context data groupings to the ingest data sets so that each ingest data set has non-duplicative members of the context data groupings with respect to other ingest data sets.

8 . The method of claim 1 , obtaining the at least one non-relativistic response comprises:

separately submitting each of the ingest data sets to the generative trained machine learning model as input data to obtain the at least one non-relativistic response.

9 . The method of claim 1 , wherein obtaining the relativistic response comprises:

obtaining at least one comparative statement between at least two of the at least one non-relativistic response using the corresponding meaning descriptions; and

generating the relativistic response using the at least one comparative statement and the at least two of the at least one non-relativistic response.

10 . The method of claim 1 , further comprising and prior to performing the retrieval process:

in a second instance of the analyzing where the indication is that the relativistic response is not desired: providing second computer implemented services using a second non-relativistic response generated using the generative trained machine learning model.

11 . A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations for managing operation of a system, the operations comprising:

based on a determination that a relativistic response for a prompt submitted for processing by a generative trained machine learning model is to be provided:

performing a retrieval process for the prompt to obtain a plurality of portions of context data from at least one designated data source;

classifying at least the plurality of portions of context data to obtain context data groupings and corresponding meaning descriptions for the context data groupings;

obtaining ingest data sets using the prompt and the context data groupings;

obtaining at least one non-relativistic response using the ingest data sets and the generative trained machine learning model;

obtaining the relativistic response using the at least one non-relativistic response and the corresponding meaning descriptions; and

providing computer-implemented services using the relativistic response,

wherein prior to performing the retrieval process, the operations further comprise:

analyzing at least the prompt for indication of desirability of the relativistic response; and

in a first instance of the analyzing where the indication is that the relativistic response is desired: making the determination.

12 . The non-transitory machine-readable medium of claim 11 , wherein classifying the at least the plurality of portions of context data comprises:

identifying a highest ranked portion of the plurality of portions of the context data;

identifying characteristics of the highest ranked portion; and

clustering the plurality of portions of the context data based on the characteristics to obtain the context data groupings.

13 . The non-transitory machine-readable medium of claim 12 , wherein during the retrieval process the plurality of portions of the context data are ranked with respect to relevancy to the prompt, and the identifying of the highest ranked portion is performed using the rankings of the plurality of portions of the context data with respect to relevancy to the prompt.

14 . The non-transitory machine-readable medium of claim 12 , wherein identifying the characteristics of the highest ranked portion comprises at least one selected from a list of identification processes consisting of:

identifying existing tags associated with the highest ranked portion, each of the existing tags ascribing at least one of the characteristics; and

analyzing information context of the highest ranked portion to obtain the characteristics.

15 . The non-transitory machine-readable medium of claim 12 , wherein each of the context data groupings comprises a portion of the plurality of portions of the context data, and each portion of the plurality of portions of the context data is a member of only one of the context data groupings.

16 . A data processing system, comprising:

a processor; and

a memory coupled to the processor to store instructions, which when executed by the processor, cause operations for managing operation of a system to be performed, the operations comprising:

based on a determination that a relativistic response for a prompt submitted for processing by a generative trained machine learning model is to be provided:

performing a retrieval process for the prompt to obtain a plurality of portions of context data from at least one designated data source;

classifying at least the plurality of portions of context data to obtain context data groupings and corresponding meaning descriptions for the context data groupings;

obtaining ingest data sets using the prompt and the context data groupings;

obtaining at least one non-relativistic response using the ingest data sets and the generative trained machine learning model;

obtaining the relativistic response using the at least one non-relativistic response and the corresponding meaning descriptions; and

providing computer-implemented services using the relativistic response,

wherein prior to performing the retrieval process, the operations further comprise:

analyzing at least the prompt for indication of desirability of the relativistic response; and

in a first instance of the analyzing where the indication is that the relativistic response is desired: making the determination.

17 . The data processing system of claim 16 , wherein classifying the at least the plurality of portions of context data comprises:

identifying a highest ranked portion of the plurality of portions of the context data;

identifying characteristics of the highest ranked portion; and

clustering the plurality of portions of the context data based on the characteristics to obtain the context data groupings.

18 . The data processing system of claim 17 , wherein during the retrieval process the plurality of portions of the context data are ranked with respect to relevancy to the prompt, and the identifying of the highest ranked portion is performed using the rankings of the plurality of portions of the context data with respect to relevancy to the prompt.

19 . The data processing system of claim 17 , wherein identifying the characteristics of the highest ranked portion comprises at least one selected from a list of identification processes consisting of:

identifying existing tags associated with the highest ranked portion, each of the existing tags ascribing at least one of the characteristics; and

analyzing information context of the highest ranked portion to obtain the characteristics.

20 . The data processing system of claim 17 , wherein each of the context data groupings comprises a portion of the plurality of portions of the context data, and each portion of the plurality of portions of the context data is a member of only one of the context data groupings.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 17, 2025
From: EZRIELEV, OFIR; MAKLER, LEV; COHEN, YEHONATAN
To: DELL PRODUCTS L.P.
Reel/Frame 070232/0916 →
References Cited (41)
US 10664527B1 · Henderson et al. · 2020 [cited by applicant]
US 11347783B2 · Kraus et al. · 2022 [cited by applicant]
US 11405457B2 · Ding · 2022 [cited by applicant]
US 12019683B1 · Newman · 2024 [cited by applicant]
US 12106049B1 · Abi-Akl · 2024 [cited by applicant]
US 12254272B1 · Cetoli · 2025 [cited by applicant]
US 12353469B1 · Mahabadi · 2025 [cited by applicant]
US 20060085423A1 · Barsness · 2006 [cited by applicant]
US 20160203193A1 · Haverlock · 2016 [cited by applicant]
US 20160321617A1 · Shastri · 2016 [cited by applicant]
US 20210034657A1 · Kale · 2021 [cited by applicant]
US 20210081613A1 · Begun · 2021 [cited by applicant]
US 20210295822A1 · Tomkins · 2021 [cited by applicant]
US 20210406977A1 · Ramachandran · 2021 [cited by applicant]
US 20230082381A1 · Gnanasambandam · 2023 [cited by applicant]
US 20240086489A1 · Sachindran · 2024 [cited by applicant]
US 20240265041A1 · Rennie · 2024 [cited by applicant]
US 20240289863A1 · Smith Lewis · 2024 [cited by applicant]
US 20240320476A1 · Chandrasekaran · 2024 [cited by applicant]
US 20240403341A1 · Berglund · 2024 [cited by applicant]
US 20250029171A1 · Unnikrishnan · 2025 [cited by examiner]
US 20250094707A1 · Portisch · 2025 [cited by applicant]
US 20250181321A1 · Gormley · 2025 [cited by examiner]
US 20250200090A1 · Beringer · 2025 [cited by applicant]
US 20250265276A1 · Yadav · 2025 [cited by applicant]
US 20250363142A1 · Madisetti · 2025 [cited by applicant]
Nguyen et al. (Sep. 5, 2024). “An Ontology-based-RAG System using Graph for accurate analytics—a dynamic way to combine information from documents with structured data to drive insights using AGE”. Medium. Max.AI Tech B… [cited by applicant]
Toro et al. (Dec. 18, 2023). “Dynamic Retrieval Augmented Generation of Ontologies using Artificial Intelligence (DRAGON-AI)”. arXiv:2312.10904. Retrieved from <https://arxiv.org/abs/2312.10904> on Jan. 28, 2025 (31 pag… [cited by applicant]
Kommineni et al. (Mar. 13, 2024). “From human experts to machines: An LLM supported approach to ontology and knowledge graph construction”. arXiv:2403.08345v1. Retrieved from <https://arxiv.org/pdf/2403.08345v1> on Jan.… [cited by applicant]
Barron et al. (Oct. 3, 2024). “Domain-Specific Retrieval-Augmented Generation Using Vector Stores, Knowledge Graphs, and Tensor Factorization”. arXiv:2410.02721. Retrieved from <https://arxiv.org/pdf/2410.02721> on Jan.… [cited by applicant]
Palantir. (n.d.) “Ontology building/Ontology Manager/Overview”. Retrieved from <https://www.palantir.com/docs/foundry/ontology-manager/overview> on Jan. 28, 2025 (10 pages). [cited by applicant]
Mousavi et al. (Oct. 2, 2024). “DyKnow: Dynamically Verifying Time-Sensitive Factual Knowledge in LLMs”. arXiv:2404.08700. Retrieved from <https://arxiv.org/pdf/2404.08700> on Jan. 28, 2025 (16 pages). [cited by applicant]
Huang et al. (Nov. 30, 2023). “VTimeLLM: Empower LLM to Grasp Video Moments”. arXiv:2311.18445. Retrieved from <https://arxiv.org/pdf/2311.18445> on Jan. 28, 2025 (14 pages). [cited by applicant]
Steve Tueno. (Sep. 23, 2024). “Natural Language Query Engine for Relational Databases using Generative AI”. arXiv:2410.07144v1. Retrieved from <https://arxiv.org/pdf/2410.07144> on Jan. 28, 2025 (18 pages). [cited by applicant]
Jaime Hernández. (Aug. 15, 2024). “Enhancing SQL Query Generation with Large Language Models (LLMs): My Learning Journey”. Medium. Retrieved from <https://devjaime.medium.com/enhancing-sql-query-generation-with-large-la… [cited by applicant]
Michiardi et al. (May 22, 2018). “Cache-based Multi-query Optimization for Data-intensive Scalable Computing Frameworks”. arXiv:1805.08650. Retrieved from <https://arxiv.org/pdf/1805.08650> on Jan. 28, 2025 (14 pages). [cited by applicant]
Khodak et al. (May 2, 2024). “Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances”. arXiv:2310.02246. Retrieved from <https://arxiv.org/pdf/2310.02246> on Jan. 28, 2025 (33 pages). [cited by applicant]
Niels de Jong (Jul. 13, 2023). “NeoDash 2.3—Create Graph Dashboards With LLM-Powered Natural Language Queries”. Medium. Neo4j Developer Blog. Retrieved from <https://medium.com/neo4j/neodash-2-3-create-graph-dashboards-… [cited by applicant]
Li et al. (Feb. 1, 2024). “PAP-REC: Personalized Automatic Prompt for Recommendation Language Model”. arXiv:2402.00284v1. Retrieved from <https://arxiv.org/pdf/2402.00284> on Jan. 28, 2025 (24 pages). [cited by applicant]
Malak et al. (May 14, 2024). “Multi-Server Multi-Function Distributed Computation”. arXiv:2405.08732. Retrieved from <https://arxiv.org/pdf/2405.08732> on Jan. 28, 2025 (28 pages). [cited by applicant]
Informatica. (Apr. 2021). “Creating an Automatic Relational Database Subscription”. Retrieved from <https://docs.informatica.com/data-integration/data-integration-hub/10-5/getting-started/creating-subscriptions/creating… [cited by applicant]