Visa International Service Association

Yanhong Wu

Hao Yang

Yuhang Wu

Wei Zhang

Aravind Sankar

Sunpreet Singh Arora

Liang Gou

Yu-San Lin

Hossein Hamooni

A method includes extracting, by an analysis computer, a plurality of first datasets from a plurality of graph snapshots using a structural self-attention module. The analysis computer can then extract at least a second dataset from the plurality of first datasets using a temporal self-attention module across the plurality of graph snapshots. The analysis computer can then perform graph context prediction with at least the second dataset.

Dynamic graph representation learning via attention networks

Provided are systems for determining adversarial examples that include at least one processor to determine a first additional input from a plurality of additional inputs based on a proximity of the first additional input to an initial input, determine a second additional input from the plurality of additional inputs based on a proximity of the second additional input to the first additional input, generate a first vector embedding, a second vector embedding and a third vector embedding based on the second additional input, generate a first relational embedding, a second relational embedding, and a third relational embedding based on the third vector embedding and the first vector embedding, concatenate the first relational embedding, the second relational embedding, and the third relational embedding to provide a concatenated version, and determine whether the first input is an adversarial example based on the concatenated version. Methods and computer program products are also provided.

System, method, and computer program product for determining adversarial examples

Methods for detecting insider threats are disclosed. A method includes collecting server access data and application access data, based on the server access data and the application access data, determining nearest neighbors of an employee, and based on the nearest neighbors of the employee, determining a peer group of the employee, determining an average rank distance (ARD) of the nearest neighbors based on a ranking of the nearest neighbors in a plurality of time periods, identifying ARD gaps between the nearest neighbors, and generating scores corresponding to the ARD gaps between the nearest neighbors. One or more employees are identified that represent an internal threat to an organization based on the scores corresponding to the ARD gaps.

Methods and systems for peer grouping in insider threat detection

A computer-implemented method is disclosed for training neural networks of a group recommender to provide item recommendations for ephemeral groups having group interaction sparsity. A preference encoder and aggregator generate user and group preference embeddings from user-item interactions, wherein the preference embeddings form a latent user-group latent embedding space. The neural preference encoder and the aggregator are trained by regularizing the latent user-group embedding space to overcome the group interaction sparsity by: i) maximizing user-group mutual information (MI) between the group embeddings and the user embeddings so that the group embeddings encode shared group member preferences, while regularizing the user embeddings to capture user social associations, and ii) contextually identifying informative group members and regularizing the corresponding group embeddings using a contextually weighted user loss value to contextually weight users' personal preferences in proportion to their user-group MI to reflect personal preferences of the identified informative group members.

Growing community of inventors

San Francisco, CA, United States of America

Yanhong Wu