IP Library › Granted Patent US 12,253,991
Granted Patent B2
US 12,253,991 · App. 18/280,828 · Granted Mar 18, 2025

System, method, and computer program product for feature analysis using an embedding tree

Inventors: Yan Zheng (Los Gatos, CA); Wei Zhang (Fremont, CA); Michael Yeh (Newark, CA); Liang Wang (San Jose, CA); Junpeng Wang (Santa Clara, CA); Shubham Jain (Mountain View, CA); Zhongfang Zhuang (San Jose, CA)
Assignee: Visa International Service Association
G06F16/2246
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,253,991
App. No.
18/280,828
Granted
Mar 18, 2025
Kind
B2
Abstract

Provided is a system for analyzing features associated with entities using an embedding tree, the system including at least one processor programmed or configured to receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for a plurality of entities. The processor may be programmed or configured to generate at least two embeddings based on the dataset and determine split criteria for partitioning an embedding space of at least one embedding tree associated with the dataset based on feature data associated with an entity and embedding data associated with the at least two embeddings. The processor may be programmed or configured to generate at least one embedding tree having a plurality of nodes based on the split criteria. Methods and computer program products are also provided.

Claims (62)

1. A system for analyzing features associated with entities using an embedding tree, the system comprising:

at least one processor programmed or configured to:

receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for the plurality of entities, wherein each data instance of the plurality of data instances comprises feature data associated with an entity of the plurality of entities, and wherein the feature data comprises a plurality of feature values of a plurality of features for the entity;

generate at least two embeddings based on the dataset associated with the plurality of entities, wherein the at least two embeddings comprise embedding data associated with the at least two embeddings, and wherein the embedding data comprises values of embedding vectors of the at least two embeddings;

determine split criteria that partitions an embedding space of at least one embedding tree associated with the dataset based on the feature data associated with an entity and the embedding data associated with the at least two embeddings; and

generate the at least one embedding tree having a plurality of nodes by splitting the embedding space based on the split criteria.

2. The system of claim 1 , wherein the at least one processor is further programmed or configured to:

perform an anomaly detection process based on the embedding tree.

3. The system of claim 1 , wherein the at least one processor is further programmed or configured to:

generate an embedding for a first entity based on the at least one embedding tree.

4. The system of claim 1 , wherein, when determining the split criteria that partitions the embedding space of the at least one embedding tree associated with the dataset, the at least one processor is programmed or configured to:

determine a Bayesian Information Criterion (BIC) score for a feature associated with a Gaussian mixture model under the embedding data.

5. The system of claim 4 , wherein, when determining the BIC score for the feature associated with the Gaussian mixture model under the embedding data, the at least one processor is programmed or configured to:

for each feature of the plurality of features for the entity:

assign each feature having a value equal to 1 to a first group and assign each feature having a value equal to 0 to a second group;

determine a measure of a prior probability distribution, a measure of a mean, and a measure of a standard deviation for each of the first group and the second group using a maximum likelihood estimation (MLE) function; and

determine the BIC score based on the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the first group and the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the second group.

6. The system of claim 1 , wherein the at least one processor is further programmed or configured to:

display a graphical representation of the at least one embedding tree, wherein the graphical representation comprises a plurality of graphical user interface (GUI) elements associated with the plurality of nodes of the at least one embedding tree, and wherein each node of the at least one embedding tree comprises a GUI element.

7. The system of claim 5 , wherein the split criteria comprises a feature of the plurality of features, and wherein, when determining the split criteria that partitions the embedding space of the at least one embedding tree associated with the dataset, the at least one processor is programmed or configured to:

determine the feature of the plurality of features that partitions the embedding space of the at least one embedding tree associated with the dataset.

8. A method for analyzing features associated with entities using an embedding tree, the method comprising:

receiving, by at least one processor, a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for the plurality of entities, wherein each data instance of the plurality of data instances comprises feature data associated with an entity of the plurality of entities, and wherein the feature data comprises a plurality of feature values of a plurality of features for the entity;

generating, by the at least one processor, at least two embeddings based on the dataset associated with the plurality of entities, wherein the at least two embeddings comprise embedding data associated with the at least two embeddings, and wherein the embedding data comprises values of embedding vectors of the at least two embeddings;

determining, by the at least one processor, split criteria that partitions an embedding space of at least one embedding tree associated with the dataset based on the feature data associated with the entity and the embedding data associated with the at least two embeddings; and

generating, by the at least one processor, the at least one embedding tree having a plurality of nodes by splitting the embedding space based on the split criteria.

9. The method of claim 8 , further comprising:

performing, by the at least one processor, an anomaly detection process based on the embedding tree.

10. The method of claim 8 , further comprising:

generating, by the at least one processor, an embedding for a first entity based on the at least one embedding tree.

11. The method of claim 8 , wherein determining the split criteria that partitions the embedding space of the at least one embedding tree associated with the dataset comprises:

determining a Bayesian Information Criterion (BIC) score for a feature associated with a Gaussian mixture model under the embedding data.

12. The method of claim 11 , wherein determining the BIC score for the feature associated with the Gaussian mixture model under the embedding data comprises:

for each feature of the plurality of features for the entity:

assigning each feature having a value equal to 1 to a first group and assigning each feature having a value equal to 0 to a second group;

determining a measure of a prior probability distribution, a measure of a mean, and a measure of a standard deviation for each of the first group and the second group using a maximum likelihood estimation (MLE) function; and

determining the BIC score based on the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the first group and the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the second group.

13. The method of claim 8 , further comprising:

displaying, by the at least one processor, a graphical representation of the at least one embedding tree, wherein the graphical representation comprises a plurality of graphical user interface (GUI) elements associated with the plurality of nodes of the at least one embedding tree, and wherein each node of the at least one embedding tree comprises a GUI element.

14. The method of claim 12 , wherein the split criteria comprises a feature of the plurality of features, and wherein determining the split criteria that partitions the embedding space of the at least one embedding tree associated with the dataset comprises:

determining the feature of the plurality of features that partitions the embedding space of the at least one embedding tree associated with the dataset.

15. A computer program product for analyzing features associated with entities using an embedding tree, the computer program product comprising at least one non-transitory computer-readable medium including one or more instructions that, when executed by at least one processor, cause the at least one processor to:

receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for the plurality of entities, wherein each data instance of the plurality of data instances comprises feature data associated with an entity of the plurality of entities, and wherein the feature data comprises a plurality of feature values of a plurality of features for the entity of the plurality of entities;

generate at least two embeddings based on the dataset associated with the plurality of entities, wherein the at least two embeddings comprise embedding data associated with the at least two embeddings, and wherein the embedding data comprises values of embedding vectors of the at least two embeddings;

determine split criteria that partitions an embedding space of at least one embedding tree associated with the dataset based on the feature data associated with the entity and the embedding data associated with the at least two embeddings; and

generate the at least one embedding tree having a plurality of nodes by splitting the embedding space based on the split criteria.

16. The computer program product of claim 15 , wherein the one or more instructions cause the at least one processor to:

perform an anomaly detection process based on the embedding tree.

17. The computer program product of claim 15 , wherein the one or more instructions cause the at least one processor to:

generate an embedding for a first entity based on the at least one embedding tree.

18. The computer program product of claim 15 ,

wherein, when determining the split criteria that partitions the embedding space of the at least one embedding tree associated with the dataset, the one or more instructions cause the at least one processor to:

determine a Bayesian Information Criterion (BIC) score for a feature associated with a Gaussian mixture model under the embedding data.

19. The computer program product of claim 18 , wherein, when determining the BIC score for the feature associated with the Gaussian mixture model under the embedding data, the one or more instructions cause the at least one processor to:

for each feature of the plurality of features for the entity:

assign each feature having a value equal to 1 to a first group and assign each feature having a value equal to 0 to a second group;

determine a measure of a prior probability distribution, a measure of a mean, and a measure of a standard deviation for each of the first group and the second group using a maximum likelihood estimation (MLE) function; and

determine the BIC score based on the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the first group and the prior probability distribution, the measure of a mean, and the measure of a standard deviation for the second group;

wherein the split criteria comprises a feature of the plurality of features, and wherein, when determining the split criteria for partitioning the embedding space of the at least one embedding tree associated with the dataset, the one or more instructions cause the at least one processor to:

determine the feature of the plurality of features for partitioning the embedding space of the at least one embedding tree associated with the dataset.

20. The computer program product of claim 15 , wherein the one or more instructions further cause the at least one processor to:

display a graphical representation of the at least one embedding tree, wherein the graphical representation comprises a plurality of graphical user interface (GUI) elements associated with the plurality of nodes of the at least one embedding tree, and wherein each node of the at least one embedding tree comprises a GUI element.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 7, 2023
From: ZHENG, YAN; ZHANG, WEI; YEH, MICHAEL; WANG, LIANG; WANG, JUNPENG; JAIN, SHUBHAM; ZHUANG, ZHONGFANG
To: VISA INTERNATIONAL SERVICE ASSOCIATION
Reel/Frame 064831/0323 →
Continuity (2)
Provisional Application 63209113 · Jun 10, 2021
Related Publication 20240152499A1 · May 9, 2024
References Cited (29)
US 10719666B1 · Walters · 2020 [cited by examiner]
US 20070094060A1 · Apps et al. · 2007 [cited by applicant]
US 20140108324A1 · Chen · 2014 [cited by examiner]
US 20200067969A1 · Abbaszadeh · 2020 [cited by examiner]
US 20200250234A1 · Teofili · 2020 [cited by examiner]
US 20210103925A1 · Dev et al. · 2021 [cited by applicant]
US 20210303638A1 · Zhong · 2021 [cited by examiner]
US 20220383145A1 · Sen · 2022 [cited by examiner]
CN 112233798B · 2021 [cited by applicant]
WO 2021046551A1 · 2021 [cited by applicant]
WO 2021077585A1 · 2021 [cited by applicant]
Camacho-Collados et al., “From Word to Sense Embeddings: A Survey on Vector Representations of Meaning”, Journal of Artificial Intelligence Research 63, 2018, pp. 743-788. [cited by applicant]
Du et al., “Pcard: Personalized Restaurants Recommendation from Card Payment Transaction Records”, International World Web Conference Committee, 2019, pp. 2687-2693. [cited by applicant]
Grbovic et al., “E-Commerce in Your Inbox: Product Recommendations at Scale”, ACM, International Conference on Knowledge Discovery and Data Mining, 2016, pp. 1-10. [cited by applicant]
Harris, “Distributional Structure”, Word, 1954, pp. 146-162, vol. 10, No. 2-3. [cited by applicant]
Levy et al., “Neural Word Embedding as Implicit Matrix Factorization”, Advances in Neural Information Processing Systems 27, 2014, pp. 1-9. [cited by applicant]
Liu et al., “An Embedded Feature Selection Method for Imbalanced Data Classification”, IEEE, CAA Journal of Automatic Sinica, 2019, pp. 1-13. [cited by applicant]
Mikolov et al., “Distributed Representations of Words and Phrases and their Compositionality”, Advances in Neural Information Processing Systems, 2013, pp. 1-9. [cited by applicant]
Mikilov et al., “Efficient Estimation of Word Representations in Vector Space”, 2013, pp. 1-12. [cited by applicant]
Pennington et al., “GloVe: Global Vectors for Word Representations”, Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), 2014, pp. 1532-1543. [cited by applicant]
Perozzi et al., “DeepWalk: Online Learning of Social Representations”, KDD'14, Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, pp. 1-10. [cited by applicant]
Qui et al., “Network Embedding as Matrix Factorization: Unifying DeepWalk, Line, PTE, and node2vec”, WSDM'18, 2018, pp. 1-9. [cited by applicant]
Shi et al., “Unsupervised Learning with Random Forest Predictors”, Journal of Computational and Graphical Statistics, 2005, pp. 1-38. [cited by applicant]
Turrin et al., “30Music Listening and Playlists Dataset”, RecSys 2015 Poster Proceedings, 2015, pp. 1-2. [cited by applicant]
Vasile et al., “Meta-Prod2Vec—Product Embeddings Using Side-Information for Recommendation”, RecSys'16, 2016, pp. 1-8. [cited by applicant]
Wang et al., “Community Preserving Network Embedding”, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 2017, pp. 203-209. [cited by applicant]
Wei et al., “Cross View Link Prediction by Learning Noise-Resilient Representation Consensus”, International World Wide Web Conference Committee (IW3C2), 2017, pp. 1611-1619. [cited by applicant]
Yeh et al., “Towards a Flexible Embedding Learning Framework”, 2020, pp. 1-10. [cited by applicant]
Zhou et al., “Scalable Graph Embedding for Asymmetric Proximity”, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), pp. 2942-2948. [cited by applicant]