IP Library › Granted Patent US 12,518,231
Granted Patent B2
US 12,518,231 · App. 18/162,373 · Granted Jan 6, 2026

Metadata-based learning curriculum generation

Inventors: Stephen James Todd (North Andover, MA); Eloy Francisco Macha (Crowley, TX); David Edward Frattura (Stamford, CT); Robert Anthony Lincourt, Jr. (Franklin, MA)
Assignee: Dell Products L.P.
G06Q10/0637G06F16/337G06F16/9024G06F16/9035
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,518,231
App. No.
18/162,373
Granted
Jan 6, 2026
Kind
B2
Abstract

A method and system for metadata-based learning curriculum generation. A learning curriculum may generally refer to an ordered (or sequenced) manifest of learning materials and/or content that may progressively advance user proficiency in at least a learning topic of interest. Existing systems or solutions offering learning curriculums today rely on the availability of static assets supported by static metadata descriptive thereof. As an improvement over said existing systems/solutions, embodiments disclosed herein enable newly introduced and ingested information, from across various data sources, to dynamically update the metadata and, therefore, dynamically update any learning curriculum(s) contingent on said metadata. Moreover, accessibility or inaccessibility to any given asset (e.g., learning material and/or content) may depend on the access authority granted to the user(s) seeking said given asset.

Claims (88)

1 . A method for creating learning curriculums, the method comprising:

receiving a learning query comprising a learning topic;

obtaining a metadata graph representative of an asset catalog;

filtering, based on the learning topic, the metadata graph to identify a node subset;

generating a k-partite metadata graph using the node subset; and

creating a learning curriculum based on the k-partite metadata graph, wherein creating the learning curriculum based on the k-partite metadata graph, comprises:

identifying a super node in the k-partite metadata graph;

determining, based on the super node, a learning path traversing at least a portion of the k-partite metadata graph;

identifying a set of learning path nodes positioned along the learning path;

creating the learning curriculum comprising a manifest of assets listing a set of assets corresponding, respectively, to the set of learning path nodes;

prior to determining the learning path:

identifying a metadata subgraph within the k-partite metadata graph;

identifying a most connected node of the metadata subgraph, wherein the learning path is determined further based on the most connected node of the metadata subgraph; and

identifying, in the k-partite metadata graph, another node that satisfies an identification criterion, wherein the learning path is determined further based on the other node.

2 . The method of claim 1 , wherein the identification criterion is one selected from a group of criterions comprising a first node positioned along a longest path traversing the k-partite metadata graph and a second node positioned along a shortest path traversing the k-partite metadata graph.

3 . The method of claim 1 , wherein creating the learning curriculum based on the k-partite metadata graph, further comprises:

prior to determining the learning path:

adjusting an edge weight associated with at least one edge in the k-partite metadata graph to obtain at least one adjusted edge weight,

wherein the learning path is determined further based on the at least one adjusted edge weight.

4 . The method of claim 3 , the method further comprising:

prior to obtaining the metadata graph:

obtaining a user profile for an organization user,

wherein the learning query originates from the organization user and the user profile comprises user talent information and user learning preferences both associated with the organization user, and

wherein the edge weight is adjusted based on at least one selected from a group of user profile components comprising the user talent information and the user learning preferences.

5 . The method of claim 4 , the method further comprising:

after creating the learning curriculum:

providing, in response to the learning query, the learning curriculum to the organization user;

receiving, from the organization user, learning curriculum feedback concerning the learning curriculum; and

adjusting learning curriculum generation based on the learning curriculum feedback.

6 . The method of claim 1 , wherein creating the learning curriculum based on the k-partite metadata graph, further comprises:

prior to creating the learning curriculum:

for each learning path node in the set of learning path nodes, and to obtain the set of assets and a set of asset availabilities respective to the set of assets:

extracting asset metadata from an asset catalog entry of the asset catalog,

wherein the asset metadata describes an asset in the set of assets and the asset catalog entry corresponds to the learning path node; and

determining, for the asset, an asset availability in the set of asset availabilities; and

producing availability remarks comprising the set of asset availabilities, wherein the learning curriculum further comprises the availability remarks.

7 . The method of claim 6 , the method further comprising:

prior to obtaining the metadata graph:

obtaining a user profile for an organization user,

wherein the learning query originates from the organization user and the user profile comprises user access permissions associated with the organization user, and

wherein creating the learning curriculum based on the k-partite metadata graph, further comprises:

prior to creating the learning curriculum:

for each learning path node in the set of learning path nodes, and to complete a set of assessments respective to the set of assets:

performing an assessment, in the set of assessments, of the user access permissions against compliance information associated with the asset,

 wherein the asset metadata comprises the compliance information; and

producing access remarks based on the set of assessments,

wherein the learning curriculum further comprises the access remarks.

8 . The method of claim 7 , wherein one assessment, in the set of assessments, results in one asset being deemed inaccessible to the organization user, wherein the asset metadata further comprises stewardship information associated with the one asset, and wherein the access remarks at least concerning the one asset comprises an accessibility statement indicating that the one asset is inaccessible to the organization user, at least one reason supporting the accessibility statement, and the stewardship information.

9 . The method of claim 1 , wherein each asset in the set of assets is a learning material with relevance to gaining proficiency in the learning topic.

10 . The method of claim 1 , wherein the learning query further comprises at least one learning context.

11 . The method of claim 10 , the method further comprising:

prior to generating the k-partite metadata graph:

filtering, based on the at least one learning context, the metadata graph to identify at least one second node subset,

wherein generation of the k-partite metadata graph further uses the at least one second node subset.

12 . A non-transitory computer readable medium (CRM) comprising computer readable program code, which when executed by a computer processor, enables the computer processor to perform a method for creating learning curriculums, the method comprising:

receiving a learning query comprising a learning topic;

obtaining a metadata graph representative of an asset catalog;

filtering, based on the learning topic, the metadata graph to identify a node subset;

generating a k-partite metadata graph using the node subset; and

creating a learning curriculum based on the k-partite metadata graph, wherein creating the learning curriculum based on the k-partite metadata graph, comprises:

identifying a super node in the k-partite metadata graph;

determining, based on the super node, a learning path traversing at least a portion of the k-partite metadata graph;

identifying a set of learning path nodes positioned along the learning path;

creating the learning curriculum comprising a manifest of assets listing a set of assets corresponding, respectively, to the set of learning path nodes;

prior to determining the learning path:

identifying a metadata subgraph within the k-partite metadata graph;

identifying a most connected node of the metadata subgraph, wherein the learning path is determined further based on the most connected node of the metadata subgraph; and

identifying, in the k-partite metadata graph, another node that satisfies an identification criterion, wherein the learning path is determined further based on the other node.

13 . The non-transitory CRM of claim 12 , wherein creating the learning curriculum based on the k-partite metadata graph, further comprises:

prior to determining the learning path:

adjusting an edge weight associated with at least one edge in the k-partite metadata graph to obtain at least one adjusted edge weight,

wherein the learning path is determined further based on the at least one adjusted edge weight.

14 . A system, the system comprising:

a client device; and

an insight service operatively connected to the client device, and comprising a computer processor configured to perform a method for creating learning curriculums, the method comprising:

receiving, from the client device, a learning query comprising a learning topic;

obtaining a metadata graph representative of an asset catalog;

filtering, based on the learning topic, the metadata graph to identify a node subset;

generating a k-partite metadata graph using the node subset; and

creating a learning curriculum based on the k-partite metadata graph, wherein creating the learning curriculum based on the k-partite metadata graph, comprises:

identifying a super node in the k-partite metadata graph;

determining, based on the super node, a learning path traversing at least a portion of the k-partite metadata graph;

identifying a set of learning path nodes positioned along the learning path;

creating the learning curriculum comprising a manifest of assets listing a set of assets corresponding, respectively, to the set of learning path nodes;

prior to determining the learning path:

identifying a metadata subgraph within the k-partite metadata graph;

identifying a most connected node of the metadata subgraph, wherein the learning path is determined further based on the most connected node of the metadata subgraph; and

identifying, in the k-partite metadata graph, another node that satisfies an identification criterion, wherein the learning path is determined further based on the other node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2023
From: TODD, STEPHEN JAMES; MACHA, ELOY FRANCISCO; FRATTURA, DAVID EDWARD; LINCOURT, ROBERT ANTHONY, JR
To: DELL PRODUCTS L.P.
Reel/Frame 062557/0817 →
Continuity (1)
Related Publication 20240257015A1 · Aug 1, 2024
References Cited (19)
US 7512612B1 · Akella et al. · 2009 [cited by applicant]
US 7805440B2 · Farrell et al. · 2010 [cited by applicant]
US 11947598B2 · Zhou et al. · 2024 [cited by applicant]
US 20120096002A1 · Sheehan et al. · 2012 [cited by applicant]
US 20140223467A1 · Hayton et al. · 2014 [cited by applicant]
US 20150356431A1 · Saxena et al. · 2015 [cited by applicant]
US 20160269328A1 · Pola · 2016 [cited by applicant]
US 20170316098A1 · Meyerzon et al. · 2017 [cited by applicant]
US 20170371881A1 · Reynolds et al. · 2017 [cited by applicant]
US 20180324976A1 · Gao et al. · 2018 [cited by applicant]
US 20190050874A1 · Matlick et al. · 2019 [cited by applicant]
US 20200382586A1 · Badawy · 2020 [cited by examiner]
US 20210304044A1 · Nagarajan et al. · 2021 [cited by applicant]
US 20220188698A1 · Halecky et al. · 2022 [cited by applicant]
US 20220361376A1 · Gao · 2022 [cited by applicant]
US 20230353651A1 · Maurer et al. · 2023 [cited by applicant]
US 20230376496A1 · Jacob et al. · 2023 [cited by applicant]
US 20240138106A1 · Duncan et al. · 2024 [cited by applicant]
Totet, Matthieu, K-partite and Bipartite Graph (Multimode Networks Transformations), K-partite and Bipartite Graph (Multimode Networks Transformations), Unknown, pp. 1-8, 2021. [cited by applicant]