PATENT CLAIM ANALYSIS

Application Number: 15891607
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-08
Patent Classification: ["702", "019000"]

Abstract:
A visualization system comprising a persistent memory, storing a dataset, and a non-persistent memory implements a pattern visualizing method. The dataset contains discrete attribute values for each first entity in a plurality of first entities for each second entity in a plurality of second entities. The dataset is compressed by blocked compression and represents discrete attribute values in both compressed sparse row and column formats. The discrete attribute values are clustered to assign each second entity to a cluster in a plurality of clusters. Differences in the discrete attribute values for the first entity across the second entities of a given cluster relative to the discrete attribute value for the same first entity across the other clusters are computed thereby deriving differential values. A heat map of these differential values for each first entity for each cluster is displayed to reveal the pattern in the dataset.

Claim (Index 18):
The visualization system of  claim 1 , wherein\n the clustering the discrete attribute value dataset comprises application of a Louvain modularity algorithm to a map, the map comprising a plurality of nodes and a plurality of edges, each node in the plurality of nodes represents a second entity in the plurality of second entities, wherein the coordinates in N-dimensional space of a respective node in the plurality of nodes are a set of principal components of the corresponding second entity in the plurality of second entities, wherein the set of principal components is derived from the corresponding discrete attribute values of the plurality of first entities for the corresponding second entity, wherein N is the number of principal components in each set of principal components, and an edge exists in the plurality of edges between a first node and a second node in the plurality of nodes when the first node is among the k nearest neighboring nodes of the second node in the first plurality of node, wherein the k nearest neighboring nodes to the second node is determined by computing a distance in the N-dimensional space between each node in the plurality of nodes, other than the second node, and the second node.

Metadata:
- Claim Count in Document: 22.0
- Percentile: 88.0
- Lexical Diversity: 2.36923
- Patent Class: 702.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13716910', '12761315', '12868631', '13149132', '13363688']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1782655924788026
- 35 USC 102 Novelty (BERT): 0.509142272525689
- Combined Prediction Score: 0.2113532604834913
- Mean Citation Score: 244.001136
- Max Citation Score: 265.97464
- Similarity Product: 185.7381773725509

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

Dataset: test