Paypal, Inc.

Haoran Zhang

Pengshan Zhang

Junshi Guo

Yu Zhang

Wei Zhang

Jun Zhang

Fei Li

Xiaohan Yun

Zhenyin Yang

Ying Yue

Quin Zuo

Xia Zhang

Jiaxin Fang

Chao B Zhang

Xin Li

Yang Yu

Ying Lin

Zhe Huang

Meng Zang

Chaoyi Chen

Vadim Kutsyy

Ke Zheng

Junsheng Tan

Xiaojun Luan

Lance Lian

Alon Wiener

Delin Liu

Zohar Li Marad

Changle Lian

Tingjie Jia

Mikhail Kourjanski

Siddarth Anand

Wenbing Zhu

Qinghai Fu

There are provided systems and methods for pairwise graph querying, merging, and computing for account linking. A service provider may provide an account graph system to identify pairwise similarities between different accounts based on shared data that may be identified through one or more linking characteristics. When providing pairwise graph similarities, a service provider may receive a query identifying two or more accounts and/or an account with a parameter for graph exploration and querying. The service provider may utilize connection, link, or relationship graphs, queried and generated using a graph database, to determine pairwise similarities between the designated seed account and one or more selected accounts. The graph may include vertices for different queried data points and edges connecting such queries, where directionality of the edges or other vectors may be used to identify links or hops between accounts for data querying and exploration.

Pair-wise graph querying, merging, and computing for account linking

Techniques are disclosed for detecting risk via a server system that receives, based on user activity at a device, an indication of a trigger event corresponding to a potential electronic communication. After receiving the trigger event indication and prior to receiving an indication of initiation of the electronic communication, the system executes a set of computations for the communication, including performing a multi-hop query to a graph database storing a graphical representation of a plurality of communications and storing results of the execution. In response to initiation of the electronic communication, the system retrieves, using information corresponding to entities involved in the electronic communication, one or more portions of the results of executing the set of computations the database. The system determines, based on the retrieved results, whether to approve the electronic communication. The disclosed techniques may advantageously decrease unsecure electronic communications relative to real-time risk detection techniques.

Graph computing for electronic communication risk detection

Methods and systems are presented for assisting a user to identify and evaluate features for use in a machine learning model configured to perform a task. Based on graph data associated with a graph data structure, a user interface is provided on a device. Based on user inputs received via the user interface, a feature candidate for the machine learning model is determined. The feature candidate is associated with a particular way of traversing the graph data structure to obtain attribute values associated with one or more vertices and/or one or more edges in the graph data structure. Based on the attribute values, a value corresponding to the feature candidate can be calculated. The value can be used to evaluate the effectiveness of the feature candidate in performing the task. The feature candidate can then be incorporated into the machine learning model as one of the input features.

Graph-based feature engineering for machine learning models

Techniques are disclosed for storing an arranging data in a database. A method includes a computer system storing, in a database, data indicative of a graph data structure having a plurality of nodes connected by a plurality of edges. The method further includes the computer system determining that a number of edges connected to a first node satisfies a threshold number. In response to the determining, the computer system may store an index in an index row associated with the first node. The index identifies a first row having first and second ranges of values stored in first and second rows, respectively. The values in the first and second rows correspond to edges connected to the first node. The values in the first and second ranges are usable to indicate properties of corresponding ones of the plurality of edges.

Graph storage in a database

Systems and methods that describe a graph database system with an online component and an offline component, are provided. Write events that modify a first graph in a real-time graph database included in the online component are received. Graph logs that include changes to the first graph in the real-time graph database caused by the write events are generated. The graph logs are transmitted to an offline component of the graph database system in a chronological order. A second graph in the offline component is modified using the graph logs. The first graph and the second graph are instantiated using a graph schema.

Graph database system

Growing community of inventors

Shanghai, China

Haoran Zhang