System and a method of generating a training set of data for training a machine-learning algorithm
US-2024232709-A1 · Jul 11, 2024 · US
US2025307883A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2025307883-A1 |
| Application number | US-202418619032-A |
| Country | US |
| Kind code | A1 |
| Filing date | Mar 27, 2024 |
| Priority date | Mar 27, 2024 |
| Publication date | Oct 2, 2025 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for generating a story path includes receiving, from a source user, a source story. The method additionally includes matching the source story to a topic in a set of topics. The method also includes identifying a set of stories associated with the topic, each story of the set of stories being provided by one or more other users. The method further includes presenting, to the source user based on identifying the set of stories, a subset of stories of the set of stories in a sequence from most similar, in an embedding space, to the source story to least similar, in the embedding space, to the source story. A final story in the sequence is a target story.
Opening claim text (preview).
What is claimed is: 1 . A method for generating a story path, comprising: receiving, from a source user, a source story; matching the source story to a topic in a set of topics; identifying a set of stories associated with the topic, each story of the set of stories being provided by one or more other users; and presenting, to the source user based on identifying the set of stories, a subset of stories of the set of stories in a sequence from most similar, in an embedding space, to the source story to least similar, in the embedding space, to the source story, a final story in the sequence being a target story. 2 . The method of claim 1 , further comprising: clustering the set of stories in the embedding space; and generating, for the source story, a first embedding in the embedding space, wherein: each topic of the set of topics is associated with a cluster in the embedding space; and the source story is matched to the topic based on a distance to the cluster associated with the topic. 3 . The method of claim 2 , wherein the source story and each one of the set of stories includes a respective narrative on the topic. 4 . The method of claim 3 , wherein the set of stories is identified based on a set of second embedding associated with the topic. 5 . The method of claim 4 , further comprising: concatenating the first embedding with a third embedding associated with one or more attributes of the source user; and concatenating each one of the set of second embeddings with a respective fourth embedding associated with one or more attributes of a target user. 6 . The method of claim 1 , further comprising: generating, via a generative model, a new story based on the subset of stories; and adding the new story to the subset of stories. 7 . The method of claim 1 , further comprising selecting the subset of stories from the set of stories based on a distance in a graph between each story of the set of stories, wherein the distance between each story of the set of stories is inversely associated with a similarity between each story of the set of stories. 8 . An apparatus for generating a story path, comprising: one or more processors; and one or more memories coupled with the one or more processors and storing processor-executable code that, when executed by the one or more processors, is configured to cause the apparatus to: receive, from a source user, a source story; match the source story to a topic in a set of topics; identify a set of stories associated with the topic, each story of the set of stories being provided by one or more other users; and present, to the source user based on identifying the set of stories, a subset of stories of the set of stories in a sequence from most similar, in an embedding space, to the source story to least similar, in the embedding space, to the source story, a final story in the sequence being a target story. 9 . The apparatus of claim 8 , wherein: execution of the processor-executable code further causes the apparatus to: cluster the set of stories in the embedding space, and generate, for the source story, a first embedding in the embedding space; each topic of the set of topics is associated with a cluster in the embedding space; and the source story is matched to the topic based on a distance to the cluster associated with the topic cluster the set of stories in the embedding space. 10 . The apparatus of claim 9 , wherein the source story and each one of the set of stories includes a respective narrative on the topic. 11 . The apparatus of claim 10 , wherein the set of stories is identified based on a set of second embedding associated with the topic. 12 . The apparatus of claim 11 , wherein execution of the processor-executable code further causes the apparatus to: concatenate the first embedding with a third embedding associated with one or more attributes of the source user; and concatenate each one of the set of second embeddings with a respective fourth embedding associated with one or more attributes of a target user. 13 . The apparatus of claim 8 , wherein execution of the processor-executable code further causes the apparatus to: generate, via a generative model, a new story based on the subset of stories; and add the new story to the subset of stories. 14 . The apparatus of claim 8 , wherein execution of the processor-executable code further causes the apparatus to select the subset of stories from the set of stories based on a distance in a graph between each story of the set of stories, wherein the distance between each story of the set of stories is inversely associated with a similarity between each story of the set of stories. 15 . A non-transitory computer-readable medium having program code recorded thereon for generating a story path, the program code executed by a processor and comprising: program code to receive, from a source user, a source story; program code to match the source story to a topic in a set of topics; program code to identify a set of stories associated with the topic, each story of the set of stories being provided by one or more other users; and program code to present, to the source user based on identifying the set of stories, a subset of stories of the set of stories in a sequence from most similar, in an embedding space, to the source story to least similar, in the embedding space, to the source story, a final story in the sequence being a target story. 16 . The non-transitory computer-readable medium of claim 15 , wherein: the program code further includes: program code to cluster the set of stories in the embedding space, and program code to generate, for the source story, a first embedding in the embedding space; each topic of the set of topics is associated with a cluster in the embedding space; and the source story is matched to the topic based on a distance to the cluster associated with the topic cluster the set of stories in the embedding space. 17 . The non-transitory computer-readable medium of claim 16 , wherein the source story and each one of the set of stories includes a respective narrative on the topic. 18 . The non-transitory computer-readable medium of claim 17 , wherein the set of stories is identified based on a set of second embedding associated with the topic. 19 . The non-transitory computer-readable medium of claim 18 , wherein the program code further comprises: program code to concatenate the first embedding with a third embedding associated with one or more attributes of the source user; and program code to concatenate each one of the set of second embeddings with a respective fourth embedding associated with one or more attributes of a target user. 20 . The non-transitory computer-readable medium of claim 15 , wherein the program code further comprises: program code to select the subset of stories from the set of stories based on a distance in a graph between each story of the set of stories, wherein the distance between each story of the set of stories is inversely associated with a similarity between each story of the set of stories; program code to generate, via a generative model, a new story based on the subset of stories; and program code to add the new story to the subset of stories.
Rating or review of business operators or products · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.