Apparatus and methods for generating an instruction set for a user
US-2024419673-A1 · Dec 19, 2024 · US
US2023004581A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2023004581-A1 |
| Application number | US-202217734153-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 2, 2022 |
| Priority date | Jun 29, 2021 |
| Publication date | Jan 5, 2023 |
| 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.
There is disclosed a method for using a computer to enable correction of misclassified labels in a database. The computer initially applies a dataset (including labels pointing respectively to categories) to a first classifier, which includes a first loss function. Pursuant to the initial application, the computer determines that one or more labels have been misclassified. Responsive to such determination, the computer changes the first loss function to a second loss function to form a second classifier including the second loss function. The computer then applies the dataset to the second classifier for enabling correction of the one or more misclassified labels.
Opening claim text (preview).
What is claimed is: 1 . A method implemented with one or more processors for improving classification of labels and categories of a database stored in memory that includes a set of labels and a set of categories where (1) each label in the set of labels points to at least one of the categories in the set of categories, and (2) each label in the set of labels is associated with a hierarchical category path, comprising: the one or more processors applying both a subset of the set of labels and a subset of the set of categories of the database stored in the memory to a first classifier for classifying the subset of labels with respect to the subset of categories, the first classifier including a first loss function; the one or more processors determining, based on said applying both the subset of labels and the subset of categories to the first classifier, whether at least one label in the subset of labels of the database stored in the memory has been misclassified; and in response to said determining that at least one label in the subset of labels of the database stored in the memory has been misclassified based on said applying both the subset of labels and the subset of categories to the first classifier: the one or more processors changing the first loss function of the first classifier to a second loss function to form a second classifier including the second loss function; and the one or more processors applying both the subset of labels and the subset of categories to the second classifier for classifying the subset of labels with respect to the subset of categories of the database stored in the memory for improving its classification of labels and categories. 2 . The method of claim 1 , wherein the first loss function comprises a global categorical cross-entropy loss function, and wherein said changing the first loss function to the second loss function comprises changing the global categorical cross-entropy loss function to a weighted-by-sample categorical cross entropy loss function. 3 . The method of claim 2 , wherein the weighted-by-sample categorical cross entropy loss function comprises: ℒ G ′ = 1 N ∑ i = 1 N a y ^ i , y i ℒ G , i where: G,i is the global catigorical cross-entory loss for sample i and a y ^ i , y i = { a shorter , if t ^ . prefix_path _of ( t i ′ ) a longer , if t i ′ . prefix_path _of ( t ^ i ) 1 , otherwise . {circumflex over (t)} i is the path corresponding to the Ŷ i prediction; t i ′ is the observed path corresponding to y i ; a shorter denotes the cost of predicting a shorter path than an observed one; and a longer denotes the cost of predicting a longer path than the observed one. 4 . The method of claim 3 , wherein the cost assigned to a shorter is greater than the cost assigned to a longer . 5 . The method of claim 1 , wherein each one of the first classifier and second classifier comprises a hybrid hierarchical classifier with the hybrid hierarchical classifier including a global classifier and at least one local classifier. 6 . The method of claim 5 , wherein the global classifier includes a loss, and wherein said changing the first loss function in the first classifier to the second loss function in the second classifier includes introducing a weight to the global classifier's
Clustering or classification · CPC title
Knowledge engineering; Knowledge acquisition · CPC title
Combinations of networks · CPC title
characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU] · CPC title
modifying the architecture, e.g. adding, deleting or silencing nodes or connections · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.