# US 2018/0025092 A1 · Modular memoization, tracking and train-data management of feature extraction

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0025092 A1
- Document ID: US20180025092A1
- Status: Published application
- Kind: A1
- Application number: 15/215,588
- Filed: 2016-07-21
- Published: 2018-01-25
- Earliest claimed: 2016-07-21
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Ranit Aharonov; Yaara Goldschmidt; Michal Ozery-Flato; Chen Yanover
- Web page: https://patentgrep.com/patent/US20180025092A1

## CPC

- G06N 20/00: Machine learning
- G06F 16/81: Indexing, e.g. XML tags; Data structures therefor; Storage structures
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

There is provided, in accordance with some embodiments, a method for receiving electronic documents representing a dependency graph comprising feature extractors at each graph node and directed edges corresponding to computational dependencies of the feature extractors. For at least some feature extractors, extractor defining data, comprising extractor data and computational dependencies of the graph node in the dependency graph are determined, and a node lookup key based on the extractor defining data is computed. When the node lookup key is associated with a stored set of output feature values, the stored set is assigned as output values of the feature extractor. When node lookup key is not associated with a stored set of output feature values, a new set of output feature values is computed, stored, and associated the node lookup key. The one set of output feature values are sent as an output feature set.

## Claims

### Claim 1

A method comprising using at least one hardware processor for:
receiving at least one electronic document representing a dependency graph comprising feature extractors at each graph node and directed edges corresponding to computational dependencies of the feature extractors;
for at least some feature extractors:
i) determining extractor defining data, comprising extractor data and computational dependencies of said graph node in said dependency graph,
ii) computing a node lookup key based on said extractor defining data,
iii) when said node lookup key is associated with stored data, said stored data may be retrieved, wherein a non-transitory computer-readable storage medium has stored therein previously-computed node lookup keys and associated previously-computed data, and
iv) when node lookup key is not associated with stored data, computing new data, storing said new data on the non-transitory computer-readable storage medium, and associating said node lookup key with said new data; and
sending some of said stored data as an output set of said dependency graph.

### Claim 2 (depends on 1)

The method of claim 1, wherein said stored data is one member from the group consisting of feature data, train data, and analysis results.

### Claim 3 (depends on 1)

The method of claim 1, further comprising receiving a node lookup key and retrieving a dependency graph for said node lookup key.

### Claim 4 (depends on 1)

The method of claim 1, further comprising when said node lookup key is associated with stored data, computing said new data.

### Claim 5 (depends on 1)

The method of claim 1, wherein said extractor defining data comprises at least one child node lookup key.

### Claim 6 (depends on 1)

The method of claim 1, wherein said output feature values comprise at least one member from a group consisting of metadata names, metadata types, and metadata descriptions.

### Claim 7 (depends on 1)

The method of claim 1, wherein said extractor data comprises at least one member from a group consisting of an extractor class, extractor parameters, a cohort class, cohort parameters, and a cohort index-list.

### Claim 8

A computer program product comprising a non-transitory computer-readable storage medium having program code embodied therewith, the program code being executable by at least one hardware processor to:
receive at least one electronic document representing a dependency graph comprising feature extractors at each graph node and directed edges corresponding to computational dependencies of the feature extractors;
for at least some feature extractors:
i) determine extractor defining data, comprising extractor data and computational dependencies of said graph node in said dependency graph,
ii) compute a node lookup key based on said extractor defining data,
iii) when said node lookup key is associated with stored data, said stored data may be retrieved, wherein a non-transitory computer-readable storage medium has stored therein previously-computed node lookup keys and associated previously-computed data, and
iv) when node lookup key is not associated with stored data, compute new data, store said new data on the non-transitory computer-readable storage medium, and associate said node lookup key with said new data; and
send some of said stored data as an output set of said dependency graph.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein said stored data is one member from the group consisting of feature data, train data, and analysis results.

### Claim 10 (depends on 8)

The computer program product of claim 8, further comprising receiving a node lookup key and retrieving a dependency graph for said node lookup key.

### Claim 11 (depends on 8)

The computer program product of claim 8, further comprising when said node lookup key is associated with stored data, computing said new data.

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein said extractor data comprises at least one child node extractor lookup key.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein said output feature values comprise at least one member from a group consisting of metadata names, metadata types, and metadata descriptions.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein said extractor data comprises at least one member from a group consisting of an extractor class, extractor parameters, a cohort class, cohort parameters, and a cohort index-list.

### Claim 15

A computerized system, comprising:
(a) a non-transitory computer-readable storage medium having stored thereon program code for:
receiving at least one electronic document representing a dependency graph comprising feature extractors at each graph node and directed edges corresponding to computational dependencies of the feature extractors;
for at least some feature extractors:
(1) determining extractor defining data, comprising extractor data and computational dependencies of said graph node in said dependency graph,
(2) computing a node lookup key based on said extractor defining data,
(3) when said node lookup key is associated with stored data, said stored data may be retrieved, wherein a non-transitory computer-readable storage medium has stored therein previously-computed node lookup keys and associated previously-computed data, and
(4) when node lookup key is not associated with stored data, computing new data, storing said new data on the non-transitory computer-readable storage medium, and associating said node lookup key with said new data;
sending stored data as an output set of said dependency graph, and
(b) at least one hardware processor configured to execute said program code.

### Claim 16 (depends on 15)

The computerized system of claim 15, wherein said stored data is one member from the group consisting of feature data, train data, and analysis results.

### Claim 17 (depends on 15)

The computerized system of claim 15, further comprising receiving a node lookup key and retrieving a dependency graph for said node lookup key.

### Claim 18 (depends on 15)

The computerized system of claim 15, further comprising when said node lookup key is associated with stored data, computing said new data.

### Claim 19 (depends on 15)

The computerized system of claim 15, wherein said extractor defining data comprises at least one child node extractor identification value.

### Claim 20 (depends on 15)

The computerized system of claim 15, wherein said output feature values comprise at least one member from a group consisting of metadata names, metadata types, and metadata descriptions.

### Claim 21 (depends on 15)

The computerized system of claim 15, wherein said extractor data comprises at least one member from a group consisting of an extractor class, extractor parameters, a cohort class, cohort parameters, and a cohort index-list.
