Abstract
Disclosed herein is an improved mechanism for matching entities on multiple platforms using graph bijections. The mechanism can identify two trees (e.g., a first tree and a second tree) within a given directed graph, where each tree has a root node corresponding to a particular entity, such as a reporting entity for advertisement metrics (e.g., impressions, views, etc.) or any other suitable entity. The mechanism can then identify the leaves associated with each tree. For each identified leaf, the mechanism can determine if there is advertising traffic or other suitable activity that connects the leaf with a leaf of another tree. For example, for each identified leaf, the mechanism can determine if there is advertising traffic or other suitable activity that connects a leaf corresponding to a first root node of the first tree with a leaf corresponding to a second root node of the second tree. In response to determining that there is advertising traffic or other suitable activity that connects each of the identified leaves, the mechanism can determine that there is a match in the entities associated with the two root nodes of the two trees and can subsequently perform any suitable actions associated with the matched entities. Alternatively, in response to determining that there is no advertising traffic or other suitable activity that connects each of the identified leaves, the mechanism can determine that there is no match in the entities associated with the two root nodes of the two trees.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Nguyen, Long and Frazier, Zachary, "Matching Entities On Multiple Platforms Using Graph Bijections", Technical Disclosure Commons, (January 28, 2019)
https://www.tdcommons.org/dpubs_series/1918