# US 2014/0195536 A1 · Creating dimension/topic term subgraphs

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

- Number: US 2014/0195536 A1
- Document ID: US20140195536A1
- Status: Published application
- Kind: A1
- Application number: 13/967,662
- Filed: 2013-08-15
- Published: 2014-07-10
- Earliest claimed: 2013-01-08
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Judah M. Diament; Aliza R. Heching; Peter K. Malkin
- Web page: https://patentgrep.com/patent/US20140195536A1

## CPC

- G06F 16/35: Clustering; Classification
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A term graph for a group (G), where G is defined by a given set of values d for a set of dimensions (D) relative to a topic (X) may be created by retrieving a graph (H) comprising terms related to an entity and associated with topic X; identifying a node (N) that represents topic X in graph H; identifying resources (R) associated with topic X in group G (used or accessed by, or otherwise associated with values d in group (G); compiling a list (L) of terms used in the identified resources (R); and creating, starting from node N, a connected subgraph S representing the term graph, wherein each node in subgraph S represents one of the terms from list L and has a path to node N.

## Claims

### Claim 1

A computer readable storage medium storing a program of instructions executable by a machine to perform a method of providing a term graph for a group G, where G is defined by a given set of values d for a set of dimensions D relative to a topic X, comprising:
retrieving an ontology graph H comprising terms related to a given entity and associated with the topic X;
identifying a node N that represents the topic X in the graph H;
identifying resources R associated with the topic X and associated with one or more values d of the group G;
compiling a list L of terms used in the identified resources R; and
creating, starting from the node N, a connected subgraph S representing the term graph, wherein each node in S represents one of the terms from the list L and has a path to the node N.

### Claim 2 (depends on 1)

The computer readable storage medium of claim 1, wherein the retrieving comprises creating the graph H.

### Claim 3 (depends on 1)

The computer readable storage medium of claim 1, wherein the resources R comprise one or more of documents, graphics, audio, communications material, or combinations thereof.

### Claim 4 (depends on 1)

The computer readable storage medium of claim 1, further comprising persistently storing the given set of values d, the set of dimensions D, the topic X, the graph H, the resources R, the list L, and the connected subgraph S in a database.

### Claim 5 (depends on 1)

The computer readable storage medium of claim 1, wherein the dimensions D comprises one or more of particular user, specification of a role, or specification of a time range, or combinations thereof.

### Claim 6 (depends on 1)

The computer readable storage medium of claim 1, further comprising obtaining importance measure associated with each of the resources R.

### Claim 7 (depends on 1)

The computer readable storage medium of claim 1, wherein two or more term graphs are provided respectively associated with two or more groups G, wherein a node representing a term commonly included in the two or more groups G serves as a connection between the two or more groups G, to create a shared-term term graph.

### Claim 8

A system for providing a term graph for a group G, where G is defined by a given set of values d for a set of dimensions D relative to a topic X, comprising:
a processor; and
a graph creation module operable to execute on the processor and further operable to retrieve a graph H comprising terms related to a given entity and associated with the topic X, identify a node N that represents the topic X in graph H, identify resources R associated with the topic X and associated with the values d of the group G, compile a list L of terms used in the resources R, and create, starting from the node N, a connected subgraph S representing the term graph, wherein each node in the subgraph S represents one of the terms from the list L and has a path to the node N.

### Claim 9 (depends on 8)

The system of claim 8, further comprising a database module operable to store the given set of values d, the set of dimensions D, the topic X, the graph H, the resources R, the list L, and the connected subgraph S in a database.

### Claim 10 (depends on 8)

The system of claim 8, wherein the graph creation module is further operable to create a shared-term term graph comprising two or more term graphs respectively associated with two or more groups G, wherein a node representing a term commonly included in the two or more groups G serves as a connection between the two or more groups G.