SEMANTICS GRAPHS FOR ENTERPRISE COMMUNICATION NETWORKS

• US 20140214858A1
• Filed: 01/31/2013
• Published: 07/31/2014
• Est. Priority Date: 01/31/2013
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Ozonat, Mehmet Kivanc, Bartolini, Claudio
• Granted Patent: US 8,914,416 B2
• Time in Patent Office: Days
• US Class Current: 707/748
• CPC Class Codes: G06F 16/36 Creation of semantic tools, e.g. ontology or thesauri
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/9027 Trees
• CPC Class Codes: G06F 16/95 Retrieval from the web
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

Building a semantics graph for an enterprise communication network can include calculating a distance metric between a first signifier and a second signifier associated with an enterprise communication network, wherein the distance metric includes a plurality of relationships defined based on a frequency of co-occurrences of the first signifier and the second signifier, and building a semantics graph for the enterprise communication network using the calculated distance metric.

Claims

1. A method for building a semantics graph for an enterprise communication network, comprising:

calculating a distance metric between a first signifier and a second signifier associated with the enterprise communication network, wherein the distance metric includes a plurality of relationships defined based on a frequency of co-occurrences of the first signifier and the second signifier using a computing device; and

building a semantics graph for the enterprise communication network using the calculated distance metric.

2. The method of claim 1, wherein calculating the distance metric includes calculating a weighted Euclidean distance including constructing an n-dimensional feature vector.

3. The method of claim 1, wherein building the semantics graph includes adding the first signifier and the second signifier as nodes on the semantics graph with an edge connecting the first signifier and the second signifier.

4. The method of claim 3, including weighting the edge with a score defined by the calculated distance metric.

5. The method of claim 1, including searching an enterprise network for a plurality of signifiers, including words, phrases, and/or acronyms using a search tool.

6. The method of claim 1, including calculating the distance metric based on a plurality of criteria.

7. A non-transitory computer-readable medium storing a set of instructions executable by a processing resource, wherein the set of instructions can be executed by the processing resource to:

calculate a ratio of co-related services associated with a first signifier and a second signifier associated with an enterprise communication network;

calculate a ratio of co-related phrases associated with the first signifier and the second signifier;

average a location of the first signifier and the second signifier on a enterprise network; and

build a semantics graph for the enterprise communication network using a distance metric between the first signifier and the second signifier, wherein the distance metric is defined using the ratio of co-related services, the ratio of co-related phrases, and the average location.

8. The medium of claim 7, wherein the instructions executable by the processing resource to define the distance metric include instructions to define a smaller distance metric between the first signifier and the second signifier than a distance metric between a third signifier and fourth signifier in response identifying the first signifier and the second signifier relate to a service.

9. The medium of claim 7, wherein the instructions executable by the processing resource to define the distance metric include instructions to define a smaller distance metric between the first signifier and the second signifier than a distance metric between a third signifier and fourth signifier in response to identifying the first signifier and the second signifier have co-related words.

10. The medium of claim 7, wherein the instructions executable by the processing resource to define the distance metric include instructions to define a smaller distance metric between the first signifier and the second signifier than a distance metric between a third signifier and fourth signifier in response to identifying the first signifier and the second signifier appear on linked domains.

11. The medium of claim 7, wherein the instructions executable by the processing resource to define the distance metric include instructions to define a smaller distance metric between the first signifier and the second signifier than a distance metric between a third signifier and fourth signifier in response to identifying the first signifier and the second signifier appear on an identical domain.

12. The medium of claim 7, wherein the instructions executable by the processing resource to define the distance metric include instructions to define a smaller distance metric between the first signifier and the second signifier than a distance metric for a third signifier and fourth signifier in response to identifying the first signifier and the second signifier appear on an identical sub-portion of a domain.

13. A system for building a semantics graph for an enterprise communication network comprising:

a processing resource; and

a memory resource communicatively coupled to the processing resource containing instructions executable by the processing resource to;

extract a plurality of signifiers from an enterprise network using an extraction tool;

define a distance metric between pairs of related signifiers among the plurality of signifiers, wherein defining a distance metric between each pair of related signifiers includes;

calculate a ratio of co-related services associated with both a first signifier and a second signifier and services related independently to the first signifier and services related independently to the second signifier;

calculate a ratio of co-related phrases associated with both the first signifier and the second signifier and phrases related independently to the first signifier and phrases related independently to the second signifier;

average a location of the first signifier and the second signifier on the enterprise network; and

define the distance metric as a sum of the ratio of co-related services, the ratio of co-related phrases, and the average location; and

build a semantics graph for the enterprise communication network using the defined distance metrics between pairs of related signifiers, including the defined distance metric of the first signifier and the second signifier.

14. The system of claim 13, wherein the instructions executable to build the semantic graph includes instructions to:

add edges to the semantics graph, wherein the edges include a set of proximities of the plurality of signifiers as defined by distance metrics between pairs related signifiers.

15. The system of claim 13, wherein the instructions executable to calculate the ratio of co-related services includes instructions to calculate a monotonically decreasing function divided by a monotonically increasing function.