PATENT CLAIM ANALYSIS

Application Number: 15951064
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["345", "440000"]

Abstract:
A computer-implemented method, according to one embodiment, includes: generating two or more sample graphs by sampling edges of a current snapshot of a dynamic graph, generating two or more partial results by executing an algorithm on the two or more sample graphs, combining the partial results into a final result, and incrementally maintaining the sample graphs. Edges included in the current snapshot of a dynamic graph and which were added to the dynamic graph in a most recent update thereto are included in each of the generated two or more sample graphs. Moreover, incrementally maintaining the sample graphs includes: subsampling each of the edges of each of the sample graphs at a given time by applying a Bernoulli trial, and combining a result of the subsampling with new edges received in a batch corresponding to the given time to form new sample graphs.

Claim (Index 4):
The computer-implemented method of  claim 1 , comprising:\n using, by the computer, a hash function to generate one or more integers corresponding to one or more of the edges in one or more of the sample graphs, wherein the one or more integers corresponds to a life span of the respective one or more of the edges; and converting, by the computer, each of the one or more integers into a pseudorandom sample using a geometric distribution of a life span of the respective one or more of the edges, wherein each of the edges in the current snapshot has a timestamp associated therewith, wherein sampling the edges of the current snapshot of the dynamic graph includes sampling the edges according to a decay function, such that sampling probability is non-increasing over time.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 91.0
- Lexical Diversity: 2.31343
- Patent Class: 345.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14922095', '15624246', '12408317', '15631848', '14039941']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6382449652017728
- 35 USC 102 Novelty (BERT): 0.5474043402726284
- Combined Prediction Score: 0.6291609027088583
- Mean Citation Score: 225.703656
- Max Citation Score: 402.83276
- Similarity Product: 340.75687962724214

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test