Nektar’s graph inference models identify relationships (“edges”) in the Nektar Graph that ****probably should exist, but don't. This is basically our “one weird trick”: we found a way to reduce all your data problems into missing edges, so edge inference is (very nearly) all we need.

What it does

How it works

There are many different kinds of edges, so there are many different edge inference models. The ones we get asked about the most are about the “Activity-Opportunity”, “Person-Opportunity” and “Person-Account” pairs. They all follow a common approach:

  1. First, Nektar identifies candidate object pairs that might have an edge between them, but do not at present. It does this by exploring the neighborhood of each object by “hopping” along existing edges. Depending on the model, it may search up to 3 or 4 hops away from each object.

  2. Nektar then uses a model to get the likelihood of each candidate edge. Inputs to this model include features of the objects themselves (such as timestamps and common text text keywords), the number of paths between them, and the number and type of the objects and edges along those paths.

    Markitecture-Graph inference.png

  3. Based on the specific edge type, it creates edges: either for all candidates where the likelihood exceeds a threshold or only for the highest likelihood candidates.

Why it works

We mentioned how nearly all your data problems are modeled as missing edges. Here’s a couple of examples:

Nektar comes with edge inference models to solve a whole host of other data issues.