IP Library Granted Patent US 12,536,205
Granted Patent B2
US 12,536,205 · App. 18/526,540 · Granted Jan 27, 2026

Systems and methods for visualization of data analysis

Inventors: Gunnar Carlsson (Stanford, CA); Harlan Sexton (Palo Alto, CA); Gurjeet Singh (Palo Alto, CA)
Assignee: Symphony AI Sensa LLC
G06F16/287G06F3/0484G06F3/04842G06F16/288
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,536,205
App. No.
18/526,540
Granted
Jan 27, 2026
Kind
B2
Abstract

Exemplary systems and methods for visualization of data analysis are provided. In various embodiments, a method comprises accessing a database, analyzing the database to identify clusters of data, generating an interactive visualization comprising a plurality of nodes and a plurality of edges wherein a first node of the plurality of nodes represents a cluster and an edge of the plurality of edges represents an intersection of nodes of the plurality of nodes, selecting and dragging the first node in response to a user action, and reorienting the interactive visualization in response to the user action of selecting and dragging the first node.

Claims (36)

1 . A method comprising:

receiving data points, each data point including two or more features;

mapping each of the data points to a mathematical reference space;

generating a cover of open sets in the mathematical reference space, each data point in the mathematical reference space being in at least one of the open sets;

performing at least one similarity function on at least one data point based on data associated with at least one of the open sets of the cover in the mathematical reference space to determine one or more nodes of a plurality of nodes, each of the one or more nodes of the plurality of nodes comprising members representative of at least one subset of the data points; and

generating a visualization comprising the plurality of nodes and a plurality of edges wherein each of the edges of the plurality of edges connects nodes with shared members.

2 . The method of claim 1 , further comprising receiving a selection of a first node of the plurality of nodes.

3 . The method of claim 2 , further comprising displaying information associated with at least one feature of at least one data point that is a member of the first node.

4 . The method of claim 3 , further comprising displaying statistical information in the visualization, the statistical information being based on features of data points that are members of the first node.

5 . The method of claim 1 , further comprising receiving a selection of data identifiers, each data identifier of the selection of data identifiers identifying different data points, the data points being received from at least one data structure, each of the data identifiers identifying different data points in the at least one data structure.

6 . The method of claim 5 , further comprising displaying a highlight of at least one node in the visualization, the highlighted at least one node being identified by a data identifier of the selection of data identifiers.

7 . The method of claim 1 , further comprising receiving a selection of a first function, wherein a first node and a second node of the plurality of nodes are colored differently in the visualization based on an application of the first function on any number of features of the data points.

8 . The method of claim 1 , further comprising receiving an interval value and an overlap percentage of the cover, re-analyzing the data points based on the interval value and the overlap percentage, and regenerating the visualization based on the re-analysis.

9 . The method of claim 1 , wherein mapping the data to the mathematical reference space utilizes a geometric function as a filter function.

10 . A non-transitory computer readable medium comprising instructions, the instructions being executable by a processor to perform a method, the method comprising:

receiving data points, each data point including two or more features;

mapping each of the data points to a mathematical reference space;

generating a cover of open sets in the mathematical reference space, each data point in the mathematical reference space being in at least one of the open sets;

performing at least one similarity function on at least one data point based on data associated with at least one of the open sets of the cover in the mathematical reference space to determine one or more nodes of a plurality of nodes, each of the one or more nodes of the plurality of nodes comprising members representative of at least one subset of the data points; and

generating a visualization comprising the plurality of nodes and a plurality of edges wherein each of the edges of the plurality of edges connects nodes with shared members.

11 . The non-transitory computer readable medium of claim 10 , the method further comprising receiving a selection of a first node of the plurality of nodes.

12 . The non-transitory computer readable medium of claim 11 , the method further comprising displaying information associated with at least one feature of at least one data point that is a member of the first node.

13 . The non-transitory computer readable medium of claim 12 , the method further comprising displaying statistical information in the visualization, the statistical information being based on features of data points that are members of the first node.

14 . The non-transitory computer readable medium of claim 10 , the method further comprising receiving a selection of data identifiers, each data identifier of the selection of data identifiers identifying different data points, the data points being received from at least one data structure, each of the data identifiers identifying different data points in the at least one data structure.

15 . The non-transitory computer readable medium of claim 14 , the method further comprising displaying a highlight of at least one node in the visualization, the highlighted at least one node being identified by a data identifier of the selection of data identifiers.

16 . The non-transitory computer readable medium of claim 10 , the method further comprising receiving a selection of a first function, wherein a first node and a second node of the plurality of nodes are colored differently in the visualization based on an application of the first function on any number of features of the data points.

17 . The non-transitory computer readable medium of claim 10 , the method further comprising receiving an interval value and an overlap percentage of the cover, re-analyzing the data points based on the interval value and the overlap percentage, and regenerating the visualization based on the re-analysis.

18 . The non-transitory computer readable medium of claim 10 , wherein mapping the data to the mathematical reference space utilizes a geometric function as a filter function.

19 . A system comprising:

a processor;

memory including instructions being executable by the processor to control the processor to:

receive data points, each data point including two or more features;

map each of the data points to a mathematical reference space;

generate a cover of open sets in the mathematical reference space, each data point in the mathematical reference space being in at least one of the open sets;

perform at least one similarity function on at least one data point based on data associated with at least one of the open sets of the cover in the mathematical reference space to determine one or more nodes of a plurality of nodes, each of the one or more nodes of the plurality of nodes comprising members representative of at least one subset of the data points; and

generate a visualization comprising the plurality of nodes and a plurality of edges wherein each of the edges of the plurality of edges connects nodes with shared members.

Assignments (5)
SECURITY INTEREST Recorded Jun 30, 2026
From: SYMPHONYAI SENSA LLC
To: OXFORD FINANCE LLC
Reel/Frame 075136/0001 →
SECURITY INTEREST Recorded Dec 13, 2024
From: SYMPHONYAI SENSA LLC; SYMPHONYAI NETREVEAL PATENT LIMITED; CABLE AUDIT ASSOCIATES, LLC
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 069579/0054 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: CARLSSON, GUNNAR; SEXTON, HARLAN; SINGH, GURJEET
To: AYASDI, INC.
Reel/Frame 065924/0608 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: AYASDI, INC.
To: AYASDI AI LLC
Reel/Frame 065925/0091 →
CHANGE OF NAME Recorded Dec 20, 2023
From: AYASDI AI LLC
To: SYMPHONYAI SENSA LLC
Reel/Frame 066123/0876 →
Continuity (6)
Continuation 17652632 · Feb 25, 2022
Continuation 15930343 · May 12, 2020
Continuation 14577649 · Dec 19, 2014
Continuation 12703165 · Feb 9, 2010
Provisional Application 61151488 · Feb 10, 2009
Related Publication 20240330326A1 · Oct 3, 2024
References Cited (71)
US 5910803A · Grau et al. · 1999 [cited by applicant]
US 6226408B1 · Sirosh · 2001 [cited by applicant]
US 6237006B1 · Weinberg et al. · 2001 [cited by applicant]
US 6304260B1 · Wills · 2001 [cited by applicant]
US 6750864B1 · Anwar · 2004 [cited by applicant]
US 6847897B1 · Bassett et al. · 2005 [cited by applicant]
US 6985898B1 · Ripley et al. · 2006 [cited by applicant]
US 7020561B1 · McLoughlin et al. · 2006 [cited by applicant]
US 7366719B2 · Shaw · 2008 [cited by applicant]
US 7428554B1 · Coberley et al. · 2008 [cited by applicant]
US 7809660B2 · Friedlander et al. · 2010 [cited by applicant]
US 7871769B2 · Baker et al. · 2011 [cited by applicant]
US 8131471B2 · Kincaid · 2012 [cited by applicant]
US 8447627B1 · Cruise · 2013 [cited by applicant]
US 8972899B2 · Carlsson · 2015 [cited by examiner]
US 9353415B2 · Nikolsky et al. · 2016 [cited by applicant]
US 9514213B2 · Wood et al. · 2016 [cited by applicant]
US 10650031B2 · Carlsson · 2020 [cited by examiner]
US 11263244B2 · Carlsson · 2022 [cited by examiner]
US 11868376B2 · Carlsson · 2024 [cited by examiner]
US 20020165934A1 · Conrad et al. · 2002 [cited by applicant]
US 20030061072A1 · Baker et al. · 2003 [cited by applicant]
US 20040005584A1 · Cohen et al. · 2004 [cited by applicant]
US 20040009489A1 · Golub et al. · 2004 [cited by applicant]
US 20040024532A1 · Kincaid · 2004 [cited by applicant]
US 20040193019A1 · Wei · 2004 [cited by applicant]
US 20040234995A1 · Musick et al. · 2004 [cited by applicant]
US 20050158736A1 · Shaw · 2005 [cited by applicant]
US 20050246314A1 · Eder · 2005 [cited by applicant]
US 20060106847A1 · Eckardt et al. · 2006 [cited by applicant]
US 20060290697A1 · Madden et al. · 2006 [cited by applicant]
US 20070005260A1 · Yokoyama et al. · 2007 [cited by applicant]
US 20070022000A1 · Bodart et al. · 2007 [cited by applicant]
US 20070026365A1 · Friedrich et al. · 2007 [cited by applicant]
US 20070027887A1 · Baldwin · 2007 [cited by applicant]
US 20070166707A1 · Schadt et al. · 2007 [cited by applicant]
US 20080001735A1 · Tran · 2008 [cited by applicant]
US 20080114564A1 · Ihara · 2008 [cited by applicant]
US 20090204582A1 · Grandhi et al. · 2009 [cited by applicant]
US 20090299645A1 · Colby et al. · 2009 [cited by applicant]
US 20100274577A1 · Firminger et al. · 2010 [cited by applicant]
US 20100313157A1 · Carlsson et al. · 2010 [cited by applicant]
US 20100332143A1 · Önell et al. · 2010 [cited by applicant]
US 20120041277A1 · Ebadollahi et al. · 2012 [cited by applicant]
US 20120158633A1 · Eder · 2012 [cited by applicant]
US 20120166208A1 · Gillam et al. · 2012 [cited by applicant]
US 20130041290A1 · Kording et al. · 2013 [cited by applicant]
US 20130054259A1 · Wojtusiak et al. · 2013 [cited by applicant]
US 20130144916A1 · Lum et al. · 2013 [cited by applicant]
US 20140297642A1 · Lum et al. · 2014 [cited by applicant]
US 20150154281A1 · Carlsson et al. · 2015 [cited by applicant]
US 20170164011A1 · Rimon et al. · 2017 [cited by applicant]
CN 103525917A · 2014 [cited by applicant]
WO 2001031579A2 · 2001 [cited by applicant]
WO 2001031580A2 · 2001 [cited by applicant]
WO 2005003308A2 · 2005 [cited by applicant]
WO 2006038108A2 · 2006 [cited by applicant]
WO 2011077353A2 · 2011 [cited by applicant]
WO 2013070984A1 · 2013 [cited by applicant]
Diaz, Fernando et al., “gene-CBR: A Case-Based Reasoning Tool for Cancer Diagnosis Using Microarray Data Sets,” Computational Intelligence, vol. 22, No. 3-4, pp. 254-268, Aug. 1, 2006. [cited by applicant]
European Patent Application No. 10741671.1, Examination Report dated Apr. 10, 2017. [cited by applicant]
European Patent Application No. 10741671.1, Examination Report dated Nov. 13, 2014. [cited by applicant]
European Patent Application No. 10741671.1, Search Report dated Feb. 28, 2013. [cited by applicant]
European Patent Application No. 12839511.8, Search Report dated Jun. 15, 2015. [cited by applicant]
European Patent Application No. 14769434.3, Examination Report dated Aug. 14, 2019. [cited by applicant]
European Patent Application No. 14769434.3, Search Report dated Nov. 7, 2016. [cited by applicant]
International Application No. PCT/US2010/023771, International Search Report and Written Opinion dated Apr. 2, 2010. [cited by applicant]
International Application No. PCT/US2012/059398, International Search Report and Written Opinion dated Jan. 8, 2013. [cited by applicant]
International Application No. PCT/US2014/031473, International Search Report and Written Opinion dated Nov. 5, 2014. [cited by applicant]
Singh, Gurjeet et al., “Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition,” Eurographics Symposium on Point-Based Graphics, 2007. [cited by applicant]
Wikimedia Foundation, Inc., “Filter (higher-order function),” Wikipedia online encyclopedia entry, Oct. 9, 2007 [retrieved online at https://en.wikipedia.org/w/index.php?title=Filter_(higher-order_function)&oldid=163279… [cited by applicant]