Prosecution Insights
Last updated: July 17, 2026
Application No. 18/937,111

EFFICIENT DATA CLASSIFICATION METHOD AND APPARATUS BASED ON DICTIONARY CONTRASTIVE LEARNING VIA ADAPTIVE LABEL EMBEDDING

Non-Final OA §103
Filed
Nov 05, 2024
Priority
Apr 25, 2024 — RE 10-2024-0055583
Examiner
HSIEH, PING Y
Art Unit
Tech Center
Assignee
Seoul National University R&DB Foundation
OA Round
1 (Non-Final)
79%
Grant Probability
Favorable
1-2
OA Rounds
1y 0m
Est. Remaining
94%
With Interview

Examiner Intelligence

Grants 79% — above average
79%
Career Allowance Rate
758 granted / 959 resolved
+19.0% vs TC avg
Strong +16% interview lift
Without
With
+15.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
28 currently pending
Career history
989
Total Applications
across all art units

Statute-Specific Performance

§101
1.5%
-38.5% vs TC avg
§103
81.3%
+41.3% vs TC avg
§102
8.6%
-31.4% vs TC avg
§112
0.5%
-39.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 959 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim(s) 1, 3-6, 9 and 10 is/are rejected under 35 U.S.C. 103 as being unpatentable over Liu (CN117611901B) in view of Li (U.S. PG-PUB NO. 2021/0374553). -Regarding claim 1, Liu discloses a data classification method, the data classification method being performed by a data classification apparatus (abstract), the data classification method comprising extracting features from input data through a learning network model (extracting image features by using the trained model in a testing stage, and finally classifying by using a K nearest neighbor algorithm, paragraph 8) and outputting prediction results based on the features (selecting the nearest category as a final prediction category, paragraph 43); wherein the learning network model compares local features derived through an individual layer other than a final layer of the learning network model (Local contrast learning takes the features before ResNet-12 last pooling layer, adds up to local features with the size of 5x 640, and performs supervised contrast learning on each 640-dimensional local feature vector, paragraph 56). Liu is silent to teaching that with label embedding vectors corresponding to a classification label. However, the claimed limitation is well known in the art as evidenced by Li. In the same field of endeavor, Li teaches with label embedding vectors corresponding to a classification label (embedding 135, paragraph 29). Therefore, it would have been obvious to one of ordinary skills in the art before the effective filing date of the claimed invention to combine the teaching of Liu with the teaching of Li in order to apply a known prototype-contrast technique to a similar contrastive classifier for predictable per-label discriminability (KSR: known technique applied to similar device). -Regarding claim 3, the combination further discloses the learning network model directly compares the label embedding vectors and the local features by using a label embedding dictionary which is connected to at least one layer of the learning network model and in which the label embedding vectors are mapped (Li, The normalized embeddings are output from the autoencoder 260 a to the prototype computation module 266, which computes a class prototype as the normalized mean embedding, paragraph 37; Liu, Using KNN to conduct prediction classification, calculating cosine distances between features and each category prototype of all samples in the query set, paragraph 83). -Regarding claim 4, the combination further discloses the label embedding vectors of the label embedding dictionary are adaptively and dynamically updated based on the error signals of the local features (Li, the class prototypes are calculated at the beginning of each epoch, paragraph 37). -Regarding claim 5, the combination further discloses at least one layer of the learning network model receives the error signals of the local features from a loss function set based on dictionary contrastive learning (Li, the prototypical contrastive loss, the consistency contrastive loss, the cross-entropy loss and the reconstruction loss may be combined to jointly train the neural network, paragraph 44). -Regarding claim 6, the combination further discloses parameters of the learning network model are updated in order to maximize similarity between label embedding vectors corresponding to the local features in the label embedding dictionary and the local features while minimizing similarity between label embedding vectors not corresponding to the local features in the label embedding dictionary and the local features (Li, push images that belong to the same class to the class prototype in the low-dimensional subspace, while pulling images that belong to different classes away from the class prototype, paragraph 29). -Regarding claim 9, the combination further discloses a non-transitory computer-readable storage medium having stored thereon a program that, when executed by a processor, causes the processor to execute the method set forth in claim 1 (Li, computing device 300, memory 320, FIG. 3; paragraph 50). -Regarding claim 10, the combination further discloses a computer program that is executed by a data classification apparatus and stored in a non-transitory computer-readable storage medium to perform the method set forth in claim 1 (Li, computing device 300, memory 320, FIG. 3; paragraph 50). Claim(s) 8 is/are rejected under 35 U.S.C. 103 as being unpatentable over Li (U.S. PG-PUB NO. 2021/0374553) in view of Liu (CN117611901B). -Regarding claim 8, Li discloses a data classification apparatus (computing device 300, FIG. 3), comprising: memory configured to store a learning network model having a plurality of layers (memory 320, FIG. 3; paragraph 50); and a controller configured to extract features from input data through the learning network model and output prediction results based on the features (a classifier 255 (e.g., a fully-connected layer followed by softmax) that receives vi as input and outputs class predictions, paragraph 33); with label embedding vectors corresponding to a classification label (embedding 135, paragraph 29). Li is silent to teaching that the learning network model compares local features derived through an individual layer other than a final layer of the learning network model. However, the claimed limitation is well known in the art as evidenced by Liu. In the same field of endeavor, Liu teaches the learning network model compares local features derived through an individual layer other than a final layer of the learning network model (Local contrast learning takes the features before ResNet-12 last pooling layer, adds up to local features with the size of 5x 640, and performs supervised contrast learning on each 640-dimensional local feature vector, paragraph 56). Therefore, it would have been obvious to one of ordinary skills in the art before the effective filing date of the claimed invention to combine the teaching of Li with the teaching of Liu in order to improve the generalization performance of the model. Allowable Subject Matter Claims 2 and 7 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to PING Y HSIEH whose telephone number is (571)270-3011. The examiner can normally be reached Monday-Friday, 9am-4pm. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Jennifer Mehmood can be reached at (571) 272-2976. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /PING Y HSIEH/ Primary Examiner, Art Unit 2664
Read full office action

Prosecution Timeline

Nov 05, 2024
Application Filed
Jun 22, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12683590
TUNING DEVICE, SYSTEM AND METHOD
2y 8m to grant Granted Jul 14, 2026
Patent 12671473
METHODS, DEVICES, AND SYSTEMS FOR BLIND ADAPTIVE BEAMFORMING OF NARROWBAND SIGNALS WITH AN UNCALIBRATED ANTENNA ARRAY USING MACHINE LEARNING
2y 10m to grant Granted Jun 30, 2026
Patent 12665682
CALIBRATION OF NON-CO-LOCATED POLARIZED ANTENNA ARRAYS
2y 12m to grant Granted Jun 23, 2026
Patent 12659053
OPTICAL PATH POINTING APPARATUS, OPTICAL PATH POINTING METHOD, AND OPTICAL PATH POINTING SYSTEM
2y 11m to grant Granted Jun 16, 2026
Patent 12658954
METHOD AND APPARATUS FOR INCREASING RFID READ RANGE IN DAISY CHAIN CONFIGURATION
2y 5m to grant Granted Jun 16, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
79%
Grant Probability
94%
With Interview (+15.5%)
2y 9m (~1y 0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 959 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month