DETAILED ACTION
Status of Application
This action is a Final Rejection. This action is in response to the amendment and response filed on September 16, 2026.
Claims 1 and 16 have been amended.
Claims 11 and 15 have been canceled.
Claims 1-10, 12-14, and 16 are pending and rejected.
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
Response to Arguments
Regarding the rejection under 35 U.S.C. 101, and specifically step 2A, prong one, Applicant argues that “the claims as now amended are not properly characterized as merely reciting mental processes.” Remarks at 1. In light of Applicant’s amendments, the rejection no longer states that the claims recite mental processes. However, the claims still recite certain methods of organizing human activity. Applicant argues that “[t]he amended claim does not merely recite the objective of identifying a high-risk transaction and pausing it. It recites a specific computerized sequence for transforming news and transaction-alert information into mapped transaction-alert related data points, iteratively clustering those data points, assigning priorities based on the resulting clusters and transaction-related risk, and then causing the automated transaction action.” Id. at 2. However, these features, except for the use of a computer to implement them, are part of the abstract idea. For example these claim features are part of the process of identifying and forwarding transaction alerts that may indicate suspicious activity so that high risk transactions may be paused.
Regarding step 2A, prong two, Applicant points out that “[t]he amended claims specify how the claimed trade-surveillance system structures and processes the particular transaction-alert data used by the system.” Remarks at 2-3. Applicant asserts that the amended claims “do not merely instruct a generic computer to ‘analyze transaction risk.’ The claimed system creates and operates on a defined mapped transaction-alert data, derived from both transaction-alert information and news information and performs a defined iterative clustering operation on that representation before the downstream priority determination and automatic transaction action.” Id. at 3. However, only a programmed general purpose computing device is needed to implement these features, which are part of the abstract idea.
Applicant further argues that “[t]his claimed processing directly addresses the technical problem identified in the application: conventional trade-surveillance systems may generate an overflow of transaction alerts based on trading activity without effectively correlating those alerts with company-event news. The claimed solution introduces news-derived information into the transaction-alert processing path, maps the resulting alert data using alert severity together with news relevance and novelty, and computationally clusters those data points before priority is assigned.” Remarks at 3. However, Applicant is describing a business problem and not a technological problem. Although technology is used as a tool to solve this problem, the technology is not being improved.
Applicant further argues that “the amended claims need not improve the API itself. The API/database operation is one portion of the claimed data-processing architecture. The claims as a whole specify how matching transaction-alert records are retrieved, represented using attributes derived from both transaction-alert data and news data, iteratively clustered, prioritized, and used to control an automated transaction action.” Remarks at 3. However, the claims as a whole are using existing technology to implement the abstract idea.
Regarding step 2B, Applicant argues that “[t]he significance of the claimed combination does not arise merely from the use of an API, a clustering algorithm, or an automated-action module individually. Rather, the claimed system connects these operations so that the news-derived information changes the representation and processing of transaction-alert data before the automated action is selected.” Remarks at 5. However, when claim 1 is viewed as a whole, existing technology is being used for generating transaction alerts and pausing high risk transactions. Connecting the operations and processing data before an automated action is selected are part of the abstract idea.
Applicant further argues that “the Office Action does not establish that the claimed ordered combination—rather than its individual components considered in isolation—was well-understood, routine, and conventional.” Remarks at 5. However, per MPEP 2106.05(d), whether additional elements are well-understood, routine, or conventional is one consideration. MPEP 2106.05 lists several considerations but does not require evaluation of all considerations. The instant rejection does not allege that the additional elements are well-understood, routine, or conventional.
As such, the rejection is maintained.
Claim Rejections - 35 USC § 101
35 U.S.C. § 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-10, 12-14, and 16 are rejected under 35 U.S.C. § 101 as being directed to non-statutory subject matter because the claimed invention is directed to an abstract idea without significantly more.
Step 1: Does the Claim Fall within a Statutory Category? (see MPEP 2106.03)
Yes, with respect to claims 1-10 and 12-14, which recite a method and, therefore, are directed to the statutory class of process.
Yes, with respect to claim 16, which recites a system and, therefore, is directed to the statutory class of machine or manufacture.
Step 2A, Prong One: Is a Judicial Exception Recited? (see MPEP 2106.04(a))
The following claims (Claims 1-10 and 12-14 are representative) identify the limitations that recite the abstract idea in regular text and that recite additional elements in bold:
1. A computerized-method for reducing false-positive transaction-alerts in a trade-surveillance system, said computerized-method comprising:
selecting raw input stock-news which are received from a platform of a source based on preconfigured one or more criteria by operating a raw-news-filtering module to yield filtered stock-news, wherein the raw input stock-news comprises one or more events which are related to stock market and wherein each event in the one or more events has associated news-metadata;
evaluating transaction-alerts received in a preconfigured date-range, by operating an alert-discovery module,
wherein the evaluation is based on the filtered stock-news,
wherein the evaluation yields one or more transaction-alert related data points, and
wherein the alert-discovery module evaluates the transaction-alerts by operating a set of Application Programming Interfaces (APIs) which fetch transaction-alerts that have matching news metadata as in the filtered stock-news, from a database,
mapping the transaction-alert related data points as a function of alert severity and an average of news relevance and novelty;
collecting the transaction-alert related data points and forming one or more clusters of the transaction-alert related data points, by operating K-means-clustering module wherein each cluster of the one or more clusters is associated with a category, wherein forming the one or more clusters comprises, for each transaction-alert related data point, searching for a centroid that is nearest to the transaction-alert related data point, assigning the transaction-alert related data point to the nearest centroid, moving each centroid to an average of the transaction-alert related data points assigned to the centroid, and repeating centroid assignment and clustering until there are no more changes;
assigning a priority to each transaction-alert related data point of the transaction-alert related data points, based on the associated category of the cluster of the transaction-alert related data point and a transaction-related risk, by operating a prioritization module; and
forwarding each transaction-alert related data point that is assigned a priority above a preconfigured threshold-to a compliance officer; and
automatically pausing a transaction that the transaction-alert related data point that is assigned to the priority above the preconfigured threshold related to, for each transaction-alert related data point that is assigned the priority above the preconfigured threshold, by operating an automated-actions module.
2. The computerized-method of claim 1, wherein the one or more criteria are selected from at least one of: (i) symbol; (ii) market; (iii) source; (iv) relevance-score; and (v) novelty.
3. The computerized-method of claim 1, wherein the platform of the source is a platform of a news provider.
4. The computerized-method of claim 1, wherein said news-metadata comprises at least one of: (i) stock symbol; (ii) Market Identifier Code (MIC); (iii) company information.
5. The computerized-method of claim 1, wherein said K-means-clustering module is matching transaction-alerts and news-metadata of the one or more events to assign transaction-alert data points to a cluster by using a regular expressions language.
6. The computerized-method of claim 5, wherein the assigning of each transaction-alert data point to a cluster is by finding centroid assignment.
7. The computerized method of claim 6, wherein the finding of the centroid assignment is by calculating Euclidean distance, said Euclidean distance is calculated by formula I:
PNG
media_image1.png
94
305
media_image1.png
Greyscale
whereby: p,q are two random data points in an Euclidean n-space,
qi, pi are Euclidean vectors, starting from an origin of the space, and
n=n-space.
8. The computerized-method of claim 1, wherein the preconfigured one or more criteria are selected in real-time.
9. The computerized-method of claim 1, wherein the category is one of: (i) low; (ii) medium; and (iii) high.
10. The computerized-method of claim 1, wherein a notification is sent as to each transaction-alert related data point that is assigned a priority above the preconfigured threshold to a compliance officer for investigation.
12. The computerized-method of claim 1, wherein for each transaction-alert related data point that is assigned the priority above the preconfigured threshold putting at least one of: (i) financial institution; (ii) trader; (iii) account, that a transaction that is related to the transaction-alert related data point that is assigned the priority above the preconfigured threshold has been conducted through, under a watchlist.
13. The computerized-method of claim 1, wherein each transaction-alert related data point that is assigned the priority above the preconfigured threshold is presented via a display unit with related details.
14. The computerized-method of claim 1, wherein the transaction-alerts are generated by analytics modules which comprise a set of detection algorithms.
Yes. But for the recited additional elements as shown above in bold, the remaining limitations of the claims recite certain methods of organizing human activity. The claims are directed to identifying and forwarding transaction alerts that may indicate suspicious activity like insider trading and pausing transactions that may be high risk. This type of method of organizing human activity is a fundamental economic practice because it includes mitigating risk and a commercial interaction such as legal obligations, sales activities or behaviors, and business relations. Thus, the claims recite an abstract idea.
Step 2A, Prong Two: Is the Abstract Idea Integrated into a Practical Application? (see MPEP 2106.04(d))
No. The claims as a whole merely use a computer as a tool to perform the abstract idea. The computing components (i.e., additional elements that are in bold above) are recited at a high level of generality and are merely invoked as a tool to implement the steps. For example, only a programmed general purpose computing device is needed to implement the claimed process. Simply implementing the abstract idea on a generic computer is not a practical application of the abstract idea. Additionally, there is no improvement to the functioning of a computer or technology. Therefore, the abstract idea is not integrated into a practical application.
Step 2B: Does the Claim Provide an Inventive Concept? (see MPEP 2106.05)
No. As discussed with respect to Step 2A, Prong 2, the additional elements in the claims, both individually and in combination, amount to no more than tools to perform the abstract idea. Merely performing the abstract idea using a computer cannot provide an inventive concept. Therefore, the claims do not provide an inventive concept.
As such, the claims are not patent eligible.
Relevant Prior Art
The following references are relevant to Applicant’s invention:
Butvinik, U.S. Patent Application Publication Number 2021/0256538 A1. This reference teaches clustering of financial data.
Katzenelson et al., U.S. Patent Application Publication Number 2021/0241072 A1. This reference teaches a clustering module. See paragraph 0036.
Soceanu et al., U.S. Patent Application Publication Number 2018/0329977 A1. This reference teaches K-means clustering (see paragraph 0066) and clustering data to identify a level of volatility indicating insider trading (see paragraph 0026).
Smith, U.S. Patent Application Publication Number 2016/0048914 A1. This reference teaches trade surveillance and monitoring.
Conclusion
THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to ELIZABETH H ROSEN whose telephone number is (571) 270-1850 and email address is elizabeth.rosen@uspto.gov. The examiner can normally be reached Monday - Friday, 10 AM ET - 7 PM ET.
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, Michael Anderson, can be reached at 571-270-0508. 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.
/ELIZABETH H ROSEN/Primary Examiner, 3693