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 § 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.
Claim 1 is rejected under 35 U.S.C. 101 because:
At step 1:
Claim 1 is directed to a “System and method for Data Structuring for Artificial Intelligence and a User Interface for Presenting the Same” and thus directed to a statutory category.
At step 2A, Prong One:
The claim recites the following limitation directed to an abstract ideas:
“receiving, at a computing system, information regarding entities for which predictions are to be generated by a machine learning model, wherein the information regarding the entities comprises an indication of a primary key for accessing unique identifiers of the entities, and an indication of a table which contains the primary key” recites a mental process as receiving information regarding entities for which predictions are to be generated by a machine learning model, wherein the information regarding the entities comprises an indication of a primary key for accessing unique identifiers of the entities, and an indication of a table which contains the primary key.
“finding, by the computing system, in the indicated table, some or all foreign keys associated with the indicated primary key” recites a mental process as finding in the indicated table, some or all foreign keys associated with the indicated primary key.
“for each of one or more of said found foreign keys: following, by the computing system, the found foreign key to a respective table in which the found foreign key is a non-foreign key” recites the mental process for each of one or more of said found foreign keys: following the found foreign key to a respective table in which the found foreign key is a non-foreign key.
“finding, by the computing system, in the respective table, some or all keys associated in the respective table with the found foreign key” recites a mental process as finding in the respective table, some or all keys associated in the respective table with the found foreign key.
“suggesting, by the computing system, as attributes for the machine learning model, one or more of said keys found in the respective table, wherein the attributes correspond to features” recites a mental process as suggesting as attributes for the machine learning model, one or more of said keys found in the respective table, wherein the attributes correspond to features.
At step 2A, Prong Two:
The claims recite the following additional elements:
That the content management system includes “computing system” which are high level recitation of generic computer component s and functions and represent mere instruction to apply to a computer as in MPEP 2106.05 (f) which does not provide integration into a practical application.
At step 2B
The conclusions for the mere implementation using a generic computer and mere field of use are carried over and to not provide significantly more.
Claim Rejections - 35 USC § 102
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claim(s) 1 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Gupta et al. (U.S. 10,467,550 B1).
With respect to claim 1, Gupta et al. discloses a computer-implemented method comprising:
receiving, at a computing system, information regarding entities for which predictions are to be generated by a machine learning model (i.e., “such as a processor located in a computer server (10) can be used to receive raw data properties pertaining to various real-world things and activities”(col. 12, line 44-48) or “As the raw data is received, it is analyzed at the server (10) using various software modules (200, see FIG. 5 for more detail) and is automatically stored in the server's system memory (12) as a series of process agnostic data store (PADS) objects (300a). The data pertaining to thing 1 and thing 2 (here represented by PADS objects (300b) and (300c) are linked to the transport activity object (300a) because they are both connected to the same transport activity” (col. 14, lines 58-67)), wherein the information regarding the entities comprises an indication of a primary key for accessing unique identifiers of the entities (i.e., “IG. 3 shows a more detailed view of the logical links and data fields of a PADS database (shown in FIG. 5, 300) schema in a standardized Entity-Relationship (ER) notation showing different database entities and conveying key relationships among them, including the components of each entity's primary keys (PK) shown in the upper half of each entity's diagram box”(col. 15, lines 62-67)), and an indication of a table which contains the primary key (i.e., “ The input is parsed into various PADS object table or fields such as the Object Header table or field (300.0), Attribute Data table or field (300.2) and various Identifier Data tables or fields (e.g. 300.1), and the resulting PADS database object is stored in the PADS database”(col. 8, lines 49-54) and “This process thus finds the IDENTIFIERS Table rows which have at least one specified Identifier-value pair in common with the Activity record being processed. The foreign key (FK) SERIAL NUMBER field in the IDENTIFIERS Table records can then be used to provide the requisite cross-linkage to identify the HEADER Table records in which the SERIAL NUMBER is the primary key (PK), thus achieving the proper linking.” (col. 17, lines 57-65));
finding, by the computing system, in the indicated table, some or all foreign keys associated with the indicated primary key “This process thus finds the IDENTIFIERS Table rows which have at least one specified Identifier-value pair in common with the Activity record being processed. The foreign key (FK) SERIAL NUMBER field in the IDENTIFIERS Table records can then be used to provide the requisite cross-linkage to identify the HEADER Table records in which the SERIAL NUMBER is the primary key (PK), thus achieving the proper linking.” (col. 17, lines 57-65)); and
for each of one or more of said found foreign keys “This process thus finds the IDENTIFIERS Table rows which have at least one specified Identifier-value pair in common with the Activity record being processed. The foreign key (FK) SERIAL NUMBER field in the IDENTIFIERS Table records can then be used to provide the requisite cross-linkage to identify the HEADER Table records in which the SERIAL NUMBER is the primary key (PK), thus achieving the proper linking.” (col. 17, lines 57-65));
: following, by the computing system, the found foreign key to a respective table in which the found foreign key is a non-foreign key (i.e., “one object in Header entity (300.0) may be associated with multiple objects in Identifiers entity (300.1). The “FK” Foreign Key) notation associated with a field in an entity indicates that value in this field may be used to locate the object, in this or more commonly another database entity, which contains the primary information about that particular object. This PADS database object scheme allows various business things and activities to be decomposed into values such as time and place (what-where), quantity, identifiers (useful for linking to other objects), and various attributes, and stored in computer memory. In a preferred embodiment, the system also stores exception data in the PADS database object at the time that the object is initially created”(col. 16, lines 5-20));
finding, by the computing system, in the respective table, some or all keys associated in the respective table with the found foreign key (i.e., “one object in Header entity (300.0) may be associated with multiple objects in Identifiers entity (300.1). The “FK” Foreign Key) notation associated with a field in an entity indicates that value in this field may be used to locate the object, in this or more commonly another database entity, which contains the primary information about that particular object. This PADS database object scheme allows various business things and activities to be decomposed into values such as time and place (what-where), quantity, identifiers (useful for linking to other objects), and various attributes, and stored in computer memory. In a preferred embodiment, the system also stores exception data in the PADS database object at the time that the object is initially created”(col. 16, lines 5-20)); and
suggesting, by the computing system, as attributes for the machine learning model, one or more of said keys found in the respective table, wherein the attributes correspond to features (i.e., “The machine self-learning system can then automatically project a business outcome, suggest most relevant attributes that can impact the said outcome, and suggest actions to change such outcome(s)”(abstract) and “A sequence of steps E107-E110 are now applied in a loop on this data series against each element of the set of data attributes as the predictor variable, so if there are N data attributes, there the loop iterates N times”(col. 39, lines 63-67) and claim 6).
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the "right to exclude" granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory obviousness-type double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Omum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the conflicting application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b).
.
Claim 1 is rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1 of Patent No. 11,853,911 B1. Although the conflicting are not patentably distinct from each other because since the claims of the Patent No. 11,853,911 B1 contains every element of the claims of the instant application, and as such, anticipate the claims of the instant application. (see table below).
Instant Application claim 1
Patent No. 11,853,911 B1 claim 1
A computer-implemented method comprising:
receiving, at a computing system, information regarding entities for which predictions are to be generated by a machine learning model, wherein the information regarding the entities comprises an indication of a primary key for accessing unique identifiers of the entities, and an indication of a table which contains the primary key;
finding, by the computing system, in the indicated table, some or all foreign keys associated with the indicated primary key; and
for each of one or more of said found foreign keys:
following, by the computing system, the found foreign key to a respective table in which the found foreign key is a non-foreign key;
finding, by the computing system, in the respective table, some or all keys associated in the respective table with the found foreign key; and
suggesting, by the computing system, as attributes for the machine learning model, one or more of said keys found in the respective table, wherein the attributes correspond to features.
A computer-implemented method comprising:
receiving, at a computing system, via a user interface, information regarding entities for which predictions are to be generated by a machine learning model, wherein the information regarding the entities comprises an indication of a first key for accessing unique identifiers of the entities, and an indication of a first table which contains the first key;
finding, by the computing system, in the first table, at least one second key associated with the first key; and
for each of the at least one second keys:
accessing, by the computing system, at least one second table;
determining, by the computing system, in the at least one second table, at least one third key to have a name similar but not identical to a name of the at least one second key;
finding, by the computing system, in the second table, some or all keys associated in the second table with the determined third key; and
suggesting, by the computing system, via the user interface, as attributes for the machine learning model, one or more of said keys found in the second table, wherein the attributes correspond to features.
Citation of Pertinent References
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
The patent to Kulkarai. discloses Ranking Enterprise search result based on relationship between users, U.S. Pub. No. 2020/0097560 A1.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to HUNG T VY whose telephone number is (571)272-1954. The examiner can normally be reached M-F 8-5.
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, Tony Mahmoudi can be reached on (571)272-4078. 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.
/HUNG T VY/Primary Examiner, Art Unit 2163 July 26, 2025