The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 02, 2025

Filed:

Jun. 29, 2023
Applicant:

Tata Consultancy Services Limited, Mumbai, IN;

Inventors:

Rajat Kumar, Bangalore, IN;

Gautam Shroff, Noida, IN;

Mayur Patidar, Noida, IN;

Lovekesh Vig, Noida, IN;

Vaibhav Varshney, Noida, IN;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 40/35 (2020.01); G06F 18/213 (2023.01); G06F 18/23 (2023.01); G06F 18/24 (2023.01); G06F 40/20 (2020.01); G06F 40/30 (2020.01); G06N 3/08 (2023.01); G06N 3/0895 (2023.01); G06N 20/00 (2019.01); G06N 20/20 (2019.01); G10L 15/065 (2013.01); G10L 15/18 (2013.01); G06N 3/045 (2023.01);
U.S. Cl.
CPC ...
G06F 40/35 (2020.01); G06F 18/24 (2023.01); G06F 40/30 (2020.01); G06N 3/08 (2013.01); G06N 3/0895 (2023.01); G10L 15/065 (2013.01); G10L 15/1822 (2013.01); G06F 18/213 (2023.01); G06F 18/23 (2023.01); G06F 40/20 (2020.01); G06N 3/045 (2023.01); G06N 20/00 (2019.01); G06N 20/20 (2019.01);
Abstract

Existing semi-supervised and unsupervised approaches for intent discovery require an estimate of the number of new intents present in the user logs. The present disclosure receives labeled utterances from known intents and update parameters of a pre-trained language model (PLM). Representation learning and clustering is performed iteratively using labeled and unlabeled utterances from known intents and unlabeled utterances from unknown intents to fine-tune PLM and a plurality of clusters is generated. Cluster merger algorithm is executed iteratively on generated plurality of clusters. A query cluster is obtained by randomly selecting one cluster from the plurality of clusters and by obtaining a corresponding plurality of nearest neighbors based on a cosine-similarity. A response for merging the query cluster and corresponding plurality of nearest neighbors is obtained, and a new cluster is created. The corresponding cluster representation is recalculated and each of the new cluster is interpreted as an intent.


Find Patent Forward Citations

Loading…