IP Library Granted Patent US 12,339,904
Granted Patent B2
US 12,339,904 · App. 17/015,065 · Granted Jun 24, 2025

Dimensional reduction of categorized directed graphs

Inventor: Edward Hunter (Gaithersburg, MD)
Assignee: Digital Asset Capital, Inc
G06F16/9024G06F16/245G06F16/289G06F16/951H04L9/3263H04L67/133
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,339,904
App. No.
17/015,065
Granted
Jun 24, 2025
Kind
B2
Abstract

A method includes determining a set of features associated with a set of vertices of a directed graph, obtaining a set of feature values associated with the set of vertices, where each respective vertex of set of vertices is associated with a respective subset of feature values. The method includes determining updatable features based on the set of features, selecting a first subset of features based on the set of updatable features. Selecting the first subset of features includes determining candidate subsets of features, determining feature subset scores associated with the candidate subsets of features based on a category label, and selecting the first subset of features based on the feature subset scores. The method includes performing a first operation to determine extracted feature values by determining feature extraction input values.

Claims (62)

1. A tangible, non-transitory, machine-readable medium storing instructions that, when executed by a computing system, effectuate operations comprising:

determining, with a computer system, a set of features associated in memory of the computer system with a set of vertices of a first directed graph, wherein a feature of the set of features is associated in memory of the computer system with a category type comprising a set of mutually exclusive categories;

obtaining, with the computer system, a set of feature values associated with the set of vertices, wherein each respective vertex of set of vertices is associated with a respective subset of feature values, wherein:

each feature value is associated with a feature of the set of features, and

the respective subset of feature values comprise a respective category of the set of mutually exclusive categories;

selecting, with the computer system, a first subset of features based on the set of feature values, wherein the selecting comprises:

determining a plurality of candidate subsets of features;

determining a plurality of feature subset scores associated with the plurality of candidate subsets of features based on a category label selected from the set of mutually exclusive categories and the set of feature values; and

selecting the first subset of features based on the plurality of feature subset scores;

performing, with the computer system, a first operation to determine a set of extracted feature values, the first operation comprising:

determining a set of input values by increasing a set of feature values associated with the first subset of features with a set of weights; and

determining the set of extracted feature values based on the set of input values, wherein the set of extracted feature values comprises a first multidimensional vector associated with the first directed graph;

determining, with the computer system, a metric based on a distance between the first multidimensional vector and a second multidimensional vector of a second directed graph;

determining, with the computer system, whether the metric satisfies a first threshold; and

storing, with the computer system, the metric in persistent storage.

2. The medium of claim 1 , wherein determining the plurality of feature subset scores associated with the plurality of candidate subsets comprises:

determining a first candidate subset of features, wherein the plurality of candidate subsets comprises the first candidate subset of features;

determining a first feature subset score based on the first candidate subset of features using a neural network or decision tree; and

selecting the first candidate subset of features as the first subset of features based on the first feature subset score being a maximum or minimum of the plurality of feature subset scores.

3. The medium of claim 1 , the operations further comprising:

obtaining a set of eigenvectors; and

computing the first multidimensional vector based on a first set of feature values for a first vertex and the set of eigenvectors, wherein a sum of the set of eigenvectors when weighted by the first multidimensional vector satisfies a second threshold associated with the first set of feature values.

4. The medium of claim 1 , wherein determining an extracted feature score comprises using a neural network that comprises a set of input layers and a set of output layers, wherein a count of the set of input layers is equal to a count of the set of output layers.

5. The medium of claim 1 , wherein determining the metric comprises determining a Minkowski distance between the first multidimensional vector and a second multidimensional vector.

6. The medium of claim 1 , the operations further comprising determining a first subset of vertices of the set of vertices based on the first subset of features and the set of extracted feature values satisfying a third threshold.

7. The medium of claim 6 , wherein determining the first subset of vertices comprises obtaining a set of prioritization parameters comprising the third threshold via a user interface element.

8. The medium of claim 1 , the operations further comprising:

determining whether a graph portion of the first directed graph matches a graph portion template, the graph portion template indicating a first vertex template, a second vertex template, and a directed edge template;

generate an indicator associated with the graph portion; and

visually indicating the graph portion associated with the graph portion based on the indicator.

9. The medium of claim 1 , the operations further comprising increasing a feature value associated with a first feature in response to a determination that a first vertex is associated with a first category label and that a first conditional statement associated with the first vertex is satisfied.

10. The medium of claim 1 , the operations further comprising visually indicating a natural language text section associated with a vertex of the first directed graph.

11. The medium of claim 10 , wherein determining the set of feature values comprises:

determining a set of embedding values based on the natural language text section using a neural network; and

determining a topic score based on the set of embedding scores, wherein the set of feature values comprises the topic score.

12. The medium of claim 1 , the operations further comprising visually indicating a first vertex of the first directed graph with a shape, color, pattern, or animation that is different from a shape, color, pattern, or animation of a second vertex of the first directed graph in a visual display of the first directed graph.

13. The medium of claim 1 , the operations further comprising providing a user interface, the user interface comprising a set of shapes representing vertices and a set of lines connecting the set of shapes, wherein each line is associated with an edge.

14. The medium of claim 13 , the operations further comprising providing a user interface (UI), the UI indicating a first subset of vertices in a different color than a second subset of vertices of the first directed graph.

15. The medium of claim 1 , wherein determining the set of extracted feature values comprises:

determining a set of adjacency values associated with a first vertex; and

determining a matrix multiplication product based on the set of adjacency values and one or more feature values of the set of feature values.

16. The medium of claim 1 , the operations further comprising providing a user interface (UI), the UI comprising:

a set of identifiers associated with the first subset of features; and

a set of UI elements that, after manipulation, causes an update to a feature value of a vertex of the first directed graph.

17. The medium of claim 16 , the operations further comprising determining a limit associated with a first feature of the first subset of features, wherein the UI causes a display of the limit.

18. The medium of claim 1 , the operations further comprising steps for determining the metric between the first directed graph and the second directed graph.

19. The medium of claim 1 , the operations further comprising steps for determining the first subset of features.

20. A method comprising:

determining, with a computer system, a set of features associated in memory of the computer system with a set of vertices of a first directed graph, wherein a feature of the set of features is associated in memory of the computer system with a category type comprising a set of mutually exclusive categories;

obtaining, with the computer system, a set of feature values associated with the set of vertices, wherein each respective vertex of set of vertices is associated with a respective subset of feature values, wherein:

each feature value is associated with a feature of the set of features, and

the respective subset of feature values comprise a respective category of the set of mutually exclusive categories;

selecting, with the computer system, a first subset of features based on the set of feature values, wherein the selecting comprises:

determining a plurality of candidate subsets of features;

determining a plurality of feature subset scores associated with the plurality of candidate subsets of features based on a category label selected from the set of mutually exclusive categories and the set of feature values; and

selecting the first subset of features based on the plurality of feature subset scores;

performing, with the computer system, a first operation to determine a set of extracted feature values, the first operation comprising:

determining a set of input values by increasing a set of feature values associated with the first subset of features with a set of weights; and

determining the set of extracted feature values based on the set of input values, wherein the set of extracted feature values comprises a first multidimensional vector associated with the first directed graph;

determining, with the computer system, a metric based on a distance between the first multidimensional vector and a second multidimensional vector of a second directed graph;

determining, with the computer system, whether the metric satisfies a first threshold; and

storing, with the computer system, the metric in persistent storage.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 24, 2020
From: HUNTER, EDWARD
To: DIGITAL ASSET CAPITAL, INC.
Reel/Frame 053869/0784 →
Continuity (16)
Continuation 16893295 · Jun 4, 2020
Continuation 16893299 · Jun 4, 2020
Continuation 16893318 · Jun 4, 2020
Continuation 16893290 · Jun 4, 2020
Provisional Application 63056984 · Jul 27, 2020
Provisional Application 63055783 · Jul 23, 2020
Provisional Application 63053217 · Jul 17, 2020
Provisional Application 63052329 · Jul 15, 2020
Provisional Application 63034255 · Jun 3, 2020
Provisional Application 63033063 · Jun 1, 2020
Provisional Application 63020808 · May 6, 2020
Provisional Application 62959418 · Jan 10, 2020
Provisional Application 62959377 · Jan 10, 2020
Provisional Application 62959481 · Jan 10, 2020
Provisional Application 62897240 · Sep 6, 2019
Related Publication 20210073287A1 · Mar 11, 2021
References Cited (201)
US 7512588B2 · Chou · 2009 [cited by applicant]
US 7634778B2 · Mosier · 2009 [cited by applicant]
US 8108241B2 · Shukoor · 2012 [cited by applicant]
US 8156134B2 · Sun · 2012 [cited by applicant]
US 8312049B2 · Chayes · 2012 [cited by examiner]
US 8387000B2 · Avadhanula · 2013 [cited by applicant]
US 8533182B1 · Charboneau · 2013 [cited by applicant]
US 8614703B1 · Fong · 2013 [cited by applicant]
US 8732685B2 · Moler · 2014 [cited by applicant]
US 9547728B2 · Bornhoevd · 2017 [cited by applicant]
US 9836183B1 · Love · 2017 [cited by examiner]
US 10169454B2 · Ait-Mokhtar · 2019 [cited by applicant]
US 10320891B2 · Agarwal · 2019 [cited by applicant]
US 10424399B2 · Clark · 2019 [cited by applicant]
US 10496752B1 · Crossley · 2019 [cited by applicant]
US 10509844B1 · Mcintyre · 2019 [cited by examiner]
US 10509863B1 · Arfa · 2019 [cited by applicant]
US 10515000B2 · Moretto · 2019 [cited by applicant]
US 10529137B1 · Black · 2020 [cited by applicant]
US 10558759B1 · Arfa · 2020 [cited by applicant]
US 10558933B2 · Bhowan · 2020 [cited by examiner]
US 10700852B2 · Xie · 2020 [cited by applicant]
US 10705939B2 · McChord · 2020 [cited by applicant]
US 10810193B1 · Subramanya et al. · 2020 [cited by applicant]
US 10810210B2 · Choudhury · 2020 [cited by applicant]
US 11106458B2 · Adams · 2021 [cited by applicant]
US 11265171B2 · Struttmann et al. · 2022 [cited by applicant]
US 11271717B2 · Shi · 2022 [cited by applicant]
US 20020087275A1 · Kim · 2002 [cited by applicant]
US 20020095276A1 · Rong · 2002 [cited by examiner]
US 20040019601A1 · Gates · 2004 [cited by applicant]
US 20040181361A1 · Ikeda · 2004 [cited by applicant]
US 20050036615A1 · Jakobsson · 2005 [cited by applicant]
US 20050038533A1 · Farrell · 2005 [cited by applicant]
US 20050065955A1 · Babikov · 2005 [cited by examiner]
US 20060045027A1 · Galou · 2006 [cited by applicant]
US 20060161560A1 · Khandelwal · 2006 [cited by examiner]
US 20060195747A1 · Pramanick · 2006 [cited by applicant]
US 20070239694A1 · Singh · 2007 [cited by examiner]
US 20080033777A1 · Shukoor · 2008 [cited by applicant]
US 20080052692A1 · Chockler · 2008 [cited by applicant]
US 20080079724A1 · Isard · 2008 [cited by applicant]
US 20080098375A1 · Isard · 2008 [cited by applicant]
US 20080120292A1 · Sundaresan · 2008 [cited by applicant]
US 20080126450A1 · O'Neill · 2008 [cited by applicant]
US 20090083262A1 · Chang · 2009 [cited by applicant]
US 20100153152A1 · Kind · 2010 [cited by applicant]
US 20100312545A1 · Sites · 2010 [cited by applicant]
US 20110137919A1 · Ryu · 2011 [cited by examiner]
US 20110153662A1 · Stanfill · 2011 [cited by applicant]
US 20110238409A1 · Larcheveque et al. · 2011 [cited by applicant]
US 20120054255A1 · Buxbaum et al. · 2012 [cited by applicant]
US 20120143808A1 · Karins · 2012 [cited by applicant]
US 20120253793A1 · Ghannam et al. · 2012 [cited by applicant]
US 20120303358A1 · Ducatel et al. · 2012 [cited by applicant]
US 20130055302A1 · De · 2013 [cited by applicant]
US 20130138699A1 · Schacher · 2013 [cited by applicant]
US 20140006394A1 · Kritt · 2014 [cited by applicant]
US 20140189651A1 · Gounares · 2014 [cited by applicant]
US 20140236965A1 · Yarmus · 2014 [cited by applicant]
US 20150067644A1 · Chakraborty · 2015 [cited by applicant]
US 20160012149A1 · Muchinsky · 2016 [cited by applicant]
US 20160105322A1 · Pullo · 2016 [cited by applicant]
US 20160203242A1 · Henrickson · 2016 [cited by applicant]
US 20160239753A1 · Loehlein et al. · 2016 [cited by applicant]
US 20160350662A1 · Jin · 2016 [cited by examiner]
US 20170154123A1 · Yurchenko · 2017 [cited by applicant]
US 20170161121A1 · Feng · 2017 [cited by applicant]
US 20170193390A1 · Weston et al. · 2017 [cited by applicant]
US 20170212781A1 · Dillenberger · 2017 [cited by applicant]
US 20170230791A1 · Jones · 2017 [cited by applicant]
US 20170270100A1 · Audhkhasi et al. · 2017 [cited by applicant]
US 20170329868A1 · Lindsley · 2017 [cited by applicant]
US 20170364534A1 · Zhang · 2017 [cited by applicant]
US 20180075030A1 · Gilder · 2018 [cited by applicant]
US 20180129957A1 · Saxena · 2018 [cited by applicant]
US 20180189294A1 · Anand · 2018 [cited by examiner]
US 20180205552A1 · Struttmann · 2018 [cited by applicant]
US 20180267958A1 · Danielyan · 2018 [cited by applicant]
US 20180293486A1 · Bajic et al. · 2018 [cited by applicant]
US 20190050854A1 · Yang et al. · 2019 [cited by applicant]
US 20190095909A1 · Wright et al. · 2019 [cited by applicant]
US 20190116047A1 · Struttmann · 2019 [cited by applicant]
US 20190129893A1 · Baird, III · 2019 [cited by applicant]
US 20190147553A1 · Reber · 2019 [cited by applicant]
US 20190164087A1 · Ghibril · 2019 [cited by applicant]
US 20190164342A1 · Krs · 2019 [cited by applicant]
US 20190166162A1 · Anand · 2019 [cited by applicant]
US 20190180386A1 · Gandhi · 2019 [cited by applicant]
US 20190188285A1 · Scheau · 2019 [cited by applicant]
US 20190197357A1 · Anderson · 2019 [cited by applicant]
US 20190220496A1 · Ito · 2019 [cited by applicant]
US 20190222597A1 · Crabtree · 2019 [cited by applicant]
US 20190230092A1 · Patel · 2019 [cited by applicant]
US 20190303579A1 · Reddy · 2019 [cited by applicant]
US 20190354582A1 · Schafer · 2019 [cited by applicant]
US 20200005117A1 · Yuan · 2020 [cited by applicant]
US 20200069134A1 · Ebrahimi Afrouzi · 2020 [cited by applicant]
US 20200082016A1 · Lassoued et al. · 2020 [cited by applicant]
US 20200089769A1 · Crossley · 2020 [cited by applicant]
US 20200110619A1 · Rajaram · 2020 [cited by applicant]
US 20200110882A1 · Ripolles Mateu · 2020 [cited by applicant]
US 20200193286A1 · Byrnes · 2020 [cited by applicant]
US 20200210467A1 · Ravindran · 2020 [cited by applicant]
US 20200249998A1 · Che · 2020 [cited by applicant]
US 20200334545A1 · Sinha · 2020 [cited by applicant]
US 20200401931A1 · Duan · 2020 [cited by applicant]
US 20210049700A1 · Nguyen · 2021 [cited by applicant]
US 20210383070A1 · Hunter · 2021 [cited by applicant]
US 20220027496A1 · Struttmann · 2022 [cited by applicant]
US 20220171984A1 · Takahashi · 2022 [cited by applicant]
JP 2004220227A · 2004 [cited by applicant]
KR 1020080021444A · 2008 [cited by applicant]
KR 1020090130854A · 2009 [cited by applicant]
KR 101565715B1 · 2015 [cited by applicant]
KR 1020180120570A · 2018 [cited by applicant]
KR 1020190092564A · 2019 [cited by applicant]
WO 2004104817A2 · 2004 [cited by applicant]
WO 2005022403A1 · 2005 [cited by applicant]
WO WO2007002658A2 · 2007 [cited by examiner]
WO 2009014898A2 · 2009 [cited by applicant]
WO WO2009081212 · 2009 [cited by examiner]
WO 2011115679A1 · 2011 [cited by applicant]
WO 2013040386A2 · 2013 [cited by applicant]
WO 2013044170A1 · 2013 [cited by applicant]
WO 2013112628A1 · 2013 [cited by applicant]
WO 2015168251A1 · 2015 [cited by applicant]
WO 2017011601A1 · 2017 [cited by applicant]
WO 2017014744A1 · 2017 [cited by applicant]
WO 2017191525A2 · 2017 [cited by applicant]
WO 2017218986A1 · 2017 [cited by applicant]
WO 2018098037A1 · 2018 [cited by applicant]
WO 2019060468A1 · 2019 [cited by applicant]
WO 2020092900A2 · 2020 [cited by applicant]
WO 2021046551A1 · 2021 [cited by applicant]
John T. Rickard et al., “Hypercube Graph Representations and Fuzzy Measures of Graph Properties”, IEEE Transactions on Fuzzy Systems ( vol. 15, Issue: 6, Dec. 2007), pp. 1278-1293. [cited by examiner]
Notice of Allowance in related U.S. Appl. No. 16/893,290 dated Aug. 11, 2021. [cited by applicant]
Notice of Allowance in related U.S. Appl. No. 17/337,239 dated Sep. 9, 2021. [cited by applicant]
International Search Report and Written Opinion in related international application PCT/US2021/035516. [cited by applicant]
International Preliminary Report on Patentability in related international application PCT/US2020/049776 mailed Mar. 17, 2022, pp. 1-6. [cited by applicant]
International Preliminary Report on Patentability in related international application PCT/US2020/049777 mailed Mar. 17, 2022, pp. 1-6. [cited by applicant]
International Preliminary Report on Patentability in related international application PCT/US2020/049755 mailed Mar. 17, 2022, pp. 1-5. [cited by applicant]
International Preliminary Report on Patentability in related international application PCT/US2020/049757 mailed Mar. 17, 2022, pp. 1-6. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,069 dated May 12, 2022, pp. 1-26. [cited by applicant]
Phetsouvanh et al., “EGRET: Extortion Graph Exploration Techniques in the Bitcoin Network,” 2018 IEEE International Conference on Data Mining Workshops (ICDMW), Nov. 2018, pp. 244-251. [cited by applicant]
Masood et al., “An Overview of Distributed Ledger Technology and its Applications,” International Journal of Computer Sciences and Engineering, vol. 6, Issue 10, Oct. 2018, pp. 422-427. [cited by applicant]
Notice of Allowance in related U.S. Appl. No. 16/893,299 dated Feb. 11, 2021. [cited by applicant]
Shen, Yelong, et al. “M-walk: Learning to walk over graphs using monte carlo tree search.” Advances in Neural Information Processing Systems. 2018. (Year: 2018). [cited by applicant]
Chan, Wren, and Aspen Olmsted. “Ethereum transaction graph analysis.” 2017 12th International Conference for Internet Technology and Secured Transactions (ICITST). IEEE, 2017. (Year: 2017). [cited by applicant]
Zinkevich, Martin, et al. “Regret minimization in games with incomplete information.” Advances in neural information processing systems. 2008. (Year: 2008). [cited by applicant]
Silver, David, et al. “Mastering chess and shogi by self-play with a general reinforcement learning algorithm.” arXiv preprint arXiv: 1712.01815 (2017). (Year: 2017). [cited by applicant]
Gordon, Thomas F., Guido Governatori, and Antonino Rotolo. “Rules and norms: Requirements for rule interchange languages in the legal domain.” International Workshop on Rules and Rule Markup Languages for the Semantic W… [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 16/893,290 dated Mar. 24, 2021. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 16/893,299 issued Oct. 21, 2020 (106 pages). [cited by applicant]
Final Office Action in related U.S. Appl. No. 16/893,290 issued Nov. 13, 2020 (28 pages). [cited by applicant]
Allowance issued in related U.S. Appl. No. 16/893,318 dated Nov. 20, 2020 (20 pages). [cited by applicant]
International Search Report and Written Opinion in related international application PCT/US2020/049776 dated Dec. 3, 2020 (10 pages). [cited by applicant]
Julien M. Hendrickx, Graphs and Networks for the Analysis of Autonomous Agent Systems, Feb. 29, 2008. [cited by applicant]
International Search Report and Written Opinion in related international application PCT/US2020/049777 dated Dec. 8, 2020 (10 pages). [cited by applicant]
International Search Report and Written Opinion in related international application PCT/US2020/049755 dated Dec. 15, 2020 (9 pages). [cited by applicant]
International Search Report and Written Opinion in related international application PCT/US2020/049757 dated Dec. 15, 2020 (10 pages). [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,028 dated Jun. 30, 2022, pp. 1-47. [cited by applicant]
D.R. Bull et al., “The optimisation of multiplier-free directed graphs: an approach using genetic algorithms,” 1994 IEEE International Symposium on Circuits and Systems (ISCAS), Jun. 1994, pp. 197-200. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,038 dated Jul. 11, 2022, pp. 1-46. [cited by applicant]
Corinna Vehlow et al., “Visualizing edge-edge relations in graphs,” 2013 IEEE Pacific Visualization Symposium (PacificVis), Mar. 2013, pp. 1-8. [cited by applicant]
Notice of Allowance in related U.S. Appl. No. 17/121,915 dated Jul. 27, 2022, pp. 1-10. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,069 dated Sep. 2, 2022, pp. 1-32. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,042 dated Jul. 22, 2022, pp. 1-59. [cited by applicant]
Ali Shahaab et al., “Applicability and Appropriateness of Distributed Ledgers Consensus Protocols in Public and Private Sectors: A Systematic Review,” IEEE access, vol. 7, Mar. 2019, pp. 1-15. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,071 dated Jul. 28, 2022, pp. 1-64. [cited by applicant]
Christian Mayer et al., “ADWISE: Adaptive Window-Based Streaming Edge Partitioning for High-Speed Graph Processing,” 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 685-695. [cited by applicant]
JungHyunKim et al., “Personalized Page Rankin Uncertain Grapsh with Mutually Exclusive Edges,” SIGIR'17, Aug. 7-11, 2017, Shinjuku, Tokyo, Japan, pp. 525-534. [cited by applicant]
Federico Matteo Bencic et al., “Distributed Ledger Technology: Blockchain Compared to Directed Acyclic Graph,” 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), Jul. 2018, pp. 1569-1570. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,073 dated Aug. 5, 2022, pp. 1-65. [cited by applicant]
Wei Wang et al., “A Novel Subgraph Querying Method on Directed Weighted Graphs,” 2018 14th International Conference on Computational Intelligence and Security (CIS) 2018, pp. 150-154. [cited by applicant]
Ren Liu et al., “Decentralized state estimation and remedial control action for minimum wind curtailment using distributed computing platform,” 2016 IEEE Industry Applications Society Annual Meeting, Oct. 2016, pp. 1-9. [cited by applicant]
Non-Final Office Action in related U.S. Appl. No. 17/015,074 dated Aug. 18, 2022, pp. 1-67. [cited by applicant]
PavelExner et al., “Quantum graphs with vertices of a preferred orientation,” Physics Letters A, vol. 382, Issue 5, Feb. 6, 2018, pp. 283-287. [cited by applicant]
Moussa Amrani et al., “SAR-Oriented Visual Saliency Model and Directed Acyclic Graph Suport Vector Metric Based Target Classification,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, v… [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,071, dated Dec. 1, 2022, pp. 1-13. [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,028, dated Dec. 2, 2022, pp. 1-31. [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,073, dated Dec. 9, 2022, pp. 1-73. [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,038, dated Dec. 9, 2022, pp. 1-51. [cited by applicant]
International Preliminary Report on Patentability issued in related International Patent Application PCT/US2021/035516, dated Dec. 15, 2022, pp. 1-8. [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,042, dated Dec. 16, 2022, pp. 1-66. [cited by applicant]
Final Rejection issued in related U.S. Appl. No. 17/015,074, dated Dec. 14, 2022, pp. 1-27. [cited by applicant]
Non-Final Office Action for related U.S. Appl. No. 17/015,069 issued on Mar. 14, 2023, 52 pages. [cited by applicant]
Achille Souili et al., “Natural Language Processing (NLP)—A solution for knowledge extraction from patent unstructured data”, World Conference: Triz Future, TF 2011-2014, Procedia Engineering 131 (2015) 635-643. [cited by applicant]
Extended European Search Report for EP application No. 20861163.8 dated Aug. 25, 2023. [cited by applicant]
Extended European Search Report for EP application No. 20861551.8 dated Aug. 28, 2023. [cited by applicant]
Extended European Search Report for EP application No. 20861278.8 rec'd Aug. 29, 2023. [cited by applicant]
Office Action for CA application No. 3150253 dated Nov. 14, 2023. [cited by applicant]
Office Action for CA application No. 3150262 dated Nov. 21, 2023. [cited by applicant]
Office Action for CA application No. 3150320 dated Nov. 22, 2023. [cited by applicant]
Office Action for CA application No. 3150324 dated Dec. 5, 2023. [cited by applicant]
Office Action for CA application No. 3150262 dated Aug. 26, 2024. [cited by applicant]
Office Action for CA application No. 3150320 rec'd Aug. 26, 2024. [cited by applicant]
US Notice of Allowance for U.S. Appl. No. 17/015,028 dated Aug. 22, 2024. [cited by applicant]
US Notice of Allowance for U.S. Appl. No. 17/015,071 dated Oct. 23, 2024. [cited by applicant]
Christian Cachin et al: “The Transaction Graph for Modeling Blockchain Semantics”, IACR, International Association for Cryptologic Research, vol. 20171110:151455, Nov. 3, 2017 (Nov. 3, 2017), pp. 1-27, XP061034744, Retr… [cited by applicant]
US Notice of Allowance for U.S. Appl. No. 17/015,028 dated Jan. 10, 2025. [cited by applicant]
Cited By (2)
US 12,572,688 US 12,682,207