IP Library Granted Patent US 12,711,152
Granted Patent B1
US 12,711,152 · App. 18/495,243 · Granted Aug 18, 2026

Systems and methods for processing information

Inventors: Wendi Backler (Vancouver, CA); Nicole Quenneville (Vancouver, CA); Harsh Kaushik (Gurgaon, IN); Ruchika Mendiratta (Gurgaon, IN); Michael Ringel (Boston, MA); Joe Brillando (San Francisco, CA); Alex Aboshiha (Los Angeles, CA); Chris Yellick (Chicago, IL); Carl Reed Jessen (Seattle, WA)
Assignee: The Boston Consulting Group, Inc.
G06F16/285
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,711,152
App. No.
18/495,243
Filed
Oct 26, 2023
Granted
Aug 18, 2026
Kind
B1
Art Unit
3692
USPC
707/740
Abstract

Systems and methods can be provided for processing information. Multiple categories of ties for multiple types of assets can be identified, where a tie can comprise a relationship between assets. A relative importance for each tie category can be determined. A category weight for each tie category can be assigned using a determined relative importance for each tie category. A tie value can be combined with a tie category weight to create a weighted tie value for each tie. All tie weighted values can be combined into a meta tie value.

Claims (42)

1 . A method for processing information, comprising:

receiving, by a processor, a data set comprising information from multiple sources including patents, scientific articles, company data, and financial data, wherein the data is associated with a company;

extracting, by the processor utilizing natural language processing, attributes from the information, wherein the extracting comprises removing stopwords, performing stemming, and generating word frequency distributions of the data set, wherein the natural language processing comprises tokenizing the data set;

generating, by the processor, a graph database with nodes corresponding to the information and ties corresponding to the attributes, wherein a value of the tie corresponds to at least one of a co-occurrence, structural equivalents, or relationship between the attributes, wherein the value is calculated using a similarity algorithm selected from cosine similarity, Euclidean distance, Manhattan distance, Minkowski distance, and Jaccard similarity, wherein generating the graph database further comprises:

identifying, by the processor in the graph database, multiple tie categories for multiple types of information that can be categorized, a tie comprising a relationship between information;

determining, by the processor, a relative definition for each tie category based on at least one of centrality, eigenvector centrality, and betweenness centrality of nodes in the graph database;

assigning, by the processor, a category weight for each tie category using the determined relative definition for each tie category, wherein the category weight represents a probability of information transfer between nodes;

combining, by the processor, the value of the tie with the tie category weight to create a weighted tie value for each tie, wherein the weighted tie value represents a cumulative strength of connection between nodes; and

combining, by the processor, all weighted tie values into a meta tie value to identify clusters of similar nodes and to rank nodes based on their importance and influence within the graph database, wherein the meta tie value is further configured to identify bridges comprising nodes that connect otherwise unconnected clusters of nodes in the graph database; and

predicting, by the processor using a machine learning model, a future outcome of success for the company based on an input comprising the weighted tie value for each tie and the meta tie value.

2 . The method of claim 1 , wherein the multiple sources further include social media data and news articles.

3 . The method of claim 1 , wherein the attributes extracted from the information include patent citations, scientific article citations, company financial metrics, and founder information.

4 . The method of claim 1 , wherein the relative definition for each tie category is determined based on a combination of centrality, eigenvector centrality, and betweenness centrality of nodes in the graph database.

5 . The method of claim 1 , further comprising filtering the nodes and ties in the graph database based on predefined criteria before combining the weighted tie values.

6 . The method of claim 1 , wherein the machine learning model comprises at least one of a gradient boosted classifier, a logistic regression classifier, a neural network classifier, and a support vector machine classifier.

7 . The method of claim 1 , further comprising visualizing the graph database using a network visualization tool to display relationships between nodes.

8 . The method of claim 1 , wherein the future outcome of success for the company is predicted for a specific time period.

9 . The method of claim 1 , further comprising adjusting the prediction based on a stage of maturity of the company.

10 . The method of claim 1 , further comprising determining potential sources of innovation comprising at least one of people, companies, technologies, concepts, or themes based on the meta tie value.

11 . A system for processing information, comprising:

a processor; and

a memory storing instructions that, when executed by the processor, cause the processor to:

receive a data set comprising information from multiple sources including patents, scientific articles, company data, and financial data, wherein the data is associated with a company;

extract, utilizing natural language processing, attributes from the information, wherein the extracting comprises removing stopwords, performing stemming, and generating word frequency distributions of the data set, wherein the natural language processing comprises tokenizing the data set;

generate a graph database with nodes corresponding to the information and ties corresponding to the attributes, wherein a value of the tie corresponds to at least one of a co-occurrence, structural equivalents, or relationship between the attributes, wherein the value is calculated using a similarity algorithm selected from cosine similarity, Euclidean distance, Manhattan distance, Minkowski distance, and Jaccard similarity, wherein the instructions that cause the processor to generate the graph database further cause the processor to:

identify, in the graph database, multiple tie categories for multiple types of information that can be categorized, a tie comprising a relationship between information;

determine a relative definition for each tie category based on at least one of centrality, eigenvector centrality, and betweenness centrality of nodes in the graph database;

assign a category weight for each tie category using the determined relative definition for each tie category, wherein the category weight represents a probability of information transfer between nodes;

combine the value of the tie with the tie category weight to create a weighted tie value for each tie, wherein the weighted tie value represents a cumulative strength of connection between nodes; and

combine all weighted tie values into a meta tie value to identify clusters of similar nodes and to rank nodes based on their importance and influence within the graph database, wherein the meta tie value is further configured to identify bridges comprising nodes that connect otherwise unconnected clusters of nodes in the graph database; and

predict, using a machine learning model, a future outcome of success for the company based on an input comprising the weighted tie value for each tie and the meta tie value.

12 . The system of claim 11 , wherein the multiple sources further include social media data and news articles.

13 . The system of claim 11 , wherein the attributes extracted from the information include patent citations, scientific article citations, company financial metrics, and founder information.

14 . The system of claim 11 , wherein the relative definition for each tie category is determined based on a combination of centrality, eigenvector centrality, and betweenness centrality of nodes in the graph database.

15 . The system of claim 11 , wherein the instructions further cause the processor to filter the nodes and ties in the graph database based on predefined criteria before combining the weighted tie values.

16 . The system of claim 11 , wherein the machine learning model comprises at least one of a gradient boosted classifier, a logistic regression classifier, a neural network classifier, and a support vector machine classifier.

17 . The system of claim 11 , wherein the instructions further cause the processor to visualize the graph database using a network visualization tool to display relationships between nodes.

18 . The system of claim 11 , wherein the future outcome of success for the company is predicted for a specific time period.

19 . The system of claim 11 , wherein the instructions further cause the processor to adjust the prediction based on a stage of maturity of the company.

20 . The system of claim 11 , wherein the instructions further cause the processor to determine potential sources of innovation comprising at least one of people, companies, technologies, concepts, or themes based on the meta tie value.

21 . The method of claim 1 , wherein the bridges are identified using at least one of betweenness centrality, Katz centrality metric, Freeman metric, or Burt's constraint metric to determine nodes positioned at intersections of previously disconnected networks.

22 . The system of claim 11 , wherein the bridges are identified using at least one of betweenness centrality, Katz centrality metric, Freeman metric, or Burt's constraint metric to determine nodes positioned at intersections of previously disconnected networks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 12, 2024
From: BACKLER, WENDI; QUENNEVILLE, NICOLE; KAUSHIK, HARSH; MENDIRATTA, RUCHIKA; RINGEL, MICHAEL; BRILANDO, JOSEPH; ABOSHIHA, ALEXANDER; YELLICK, CHRISTOPHER; JESSEN, CARL REED
To: THE BOSTON CONSULTING GROUP, INC.
Reel/Frame 066723/0620 →
Continuity (3)
Continuation In Part 16691341 · Nov 21, 2019
Continuation In Part 16668835 · Oct 30, 2019
Provisional Application 62770455 · Nov 21, 2018
References Cited (70)
US 6266649B1 · Linden · 2001 [cited by examiner]
US 8805845B1 · Li et al. · 2014 [cited by applicant]
US 8990149B2 · Danciu et al. · 2015 [cited by applicant]
US 9286391B1 · Dykstra et al. · 2016 [cited by applicant]
US 9715495B1 · Tacchi et al. · 2017 [cited by applicant]
US 9836183B1 · Love et al. · 2017 [cited by applicant]
US 9852231B1 · Ravi et al. · 2017 [cited by applicant]
US 9911211B1 · Damaraju et al. · 2018 [cited by applicant]
US 10311087B1 · Kayyoor et al. · 2019 [cited by applicant]
US 10554665B1 · Badawy et al. · 2020 [cited by applicant]
US 11100523B2 · Treiser · 2021 [cited by applicant]
US 11484800B2 · Ng · 2022 [cited by applicant]
US 12265461B2 · Kozhaya et al. · 2025 [cited by applicant]
US 20020127529A1 · Cassuto et al. · 2002 [cited by applicant]
US 20050149401A1 · Ratcliffe et al. · 2005 [cited by applicant]
US 20050246350A1 · Canaran · 2005 [cited by applicant]
US 20070087756A1 · Hoffberg · 2007 [cited by applicant]
US 20090012971A1 · Hunt · 2009 [cited by examiner]
US 20100250597A1 · Yang et al. · 2010 [cited by applicant]
US 20110169835A1 · Cardno et al. · 2011 [cited by applicant]
US 20130013603A1 · Parker et al. · 2013 [cited by applicant]
US 20130018900A1 · Cheng et al. · 2013 [cited by applicant]
US 20130326325A1 · De et al. · 2013 [cited by applicant]
US 20140053309A1 · Medina · 2014 [cited by applicant]
US 20140075004A1 · Van Dusen et al. · 2014 [cited by applicant]
US 20140280224A1 · Feinberg et al. · 2014 [cited by applicant]
US 20140297837A1 · Agarwal et al. · 2014 [cited by applicant]
US 20150127565A1 · Chevalier et al. · 2015 [cited by applicant]
US 20150154263A1 · Boddhu et al. · 2015 [cited by applicant]
US 20150242486A1 · Chari et al. · 2015 [cited by applicant]
US 20150269691A1 · Bar Yacov et al. · 2015 [cited by applicant]
US 20150317589A1 · Anderson et al. · 2015 [cited by applicant]
US 20160155067A1 · Dubnov et al. · 2016 [cited by applicant]
US 20160314184A1 · Bendersky et al. · 2016 [cited by applicant]
US 20160350886A1 · Jessen et al. · 2016 [cited by applicant]
US 20160378847A1 · Byrnes et al. · 2016 [cited by applicant]
US 20170053309A1 · Malaviya et al. · 2017 [cited by applicant]
US 20170083608A1 · Ye et al. · 2017 [cited by applicant]
US 20170091304A1 · Hanis et al. · 2017 [cited by applicant]
US 20170185601A1 · Qin et al. · 2017 [cited by applicant]
US 20170213280A1 · Kaznady · 2017 [cited by applicant]
US 20170236081A1 · Grady Smith et al. · 2017 [cited by applicant]
US 20180082172A1 · Patel et al. · 2018 [cited by applicant]
US 20180150864A1 · Kolb et al. · 2018 [cited by applicant]
US 20180174160A1 · Gupta et al. · 2018 [cited by applicant]
US 20180225372A1 · Lecue et al. · 2018 [cited by applicant]
US 20180285595A1 · Jessen · 2018 [cited by applicant]
US 20190347282A1 · Cai et al. · 2019 [cited by applicant]
US 20200004820A1 · Chhaya et al. · 2020 [cited by applicant]
US 20230289276A1 · Kozhaya et al. · 2023 [cited by applicant]
US 20240248963A1 · Parham et al. · 2024 [cited by applicant]
US 20250086737A1 · Walters et al. · 2025 [cited by applicant]
US 20250209544A1 · Kong et al. · 2025 [cited by applicant]
WO 2024134556A1 · 2024 [cited by applicant]
Alcacer J., et al., “Applicant and Examiner Citations in U.S. Patents: An Overview and Analysis,” Research Policy, 2009, pp. 415-427, 43 Pages. [cited by applicant]
Bessen J., “The Value of U.S. Patents by Owner and Patent Characteristics,” Research Policy, 2008, vol. 37, pp. 932-945. [cited by applicant]
Blei D.M., et al., “Latent Dirichlet Allocation,” Journal of Machine Learning Research, 2003, vol. 3, pp. 993-1022. [cited by applicant]
Chen H., et al., “A Fuzzy Approach for Measuring Development of Topics in Patents Using Latent Dirichlet Allocation,” IEEE International, 2015, 7 Pages, Printed from URL: http://ieeexplore.ieee.org. [cited by applicant]
Datascience: “A Zero-Math Introduction to Markov Chain Monte Carlo Methods,” Dec. 22, 2017, 16 Pages, [Retrieved on Sep. 1, 2021] Retrieved from URL: https://towardsdatascience.com/a-Zero-matt-introduction-tomarkov-chai… [cited by applicant]
U.S. Appl. No. 16/668,835. [cited by applicant]
U.S. Appl. No. 16/691,341. [cited by applicant]
Kutty S., et al., “HCX: An Efficient Hybrid Clustering Approach for XML Documents,” Proceedings of the 9th ACM Symposium on Document Engineering, Sep. 16-18, 2009, 4 Pages, URL: dl.acm.org. [cited by applicant]
Nemet G.F., et al., “Do Important Inventions Benefit from Knowledge Originating in Other Technological Domains?,” Research Policy, 2012, vol. 41, pp. 190-200. [cited by applicant]
Pritchard J.K., et al., “Inference of Population Structure Using Multilocus Genotype Data,” Genetics, Jun. 2000, vol. 155, pp. 945-959, Printed from URL: academic.oup.com. [cited by applicant]
SpaCy: “SpaCy 101: Everything You Need to Know,” 2021, 34 Pages, [Retrieved on Sep. 1, 2021] Retrieved from URL: https://spacy.io/usage/spacy-101. [cited by applicant]
Towne W.B., et al., “Measuring Similarity Similarly: LDA and Human Perception,” ACM Transactions on Intelligent Systems and Technology, Jan. 2016, vol. 7, No. 2, Article. 25, 29 Pages, Printed From URL: http://dl.acm.or… [cited by applicant]
Wikipedia: “Latent Dirichlet Allocation,” 2021, 14 Pages, [Retrieved on May 3, 2021] Retrieved from URL: https://en.wikipedia.org/wiki/Latent_Dirichlet_allocation. [cited by applicant]
Zhang L., et al., “PatentDom: Analyzing Patent Relationships on Multi-View Patent Graphs,” Proceedings of the 23rd ACM International, Nov. 3, 2014, 10 Pages, Retrieved from URL: http://dl.acm.org. [cited by applicant]
Zhang L., et al., “Patentline: Analyzing Technology Evolution on Multi-View Patent Graphs,” Proceedings of the 37th International ACM, Jul. 2014, 4 Pages, Retrieved from URL: http://dl.acm.org. [cited by applicant]
U.S. Appl. No. 19/288,722, capture Apr. 28, 2026. [cited by applicant]