IP Library Granted Patent US 12,443,621
Granted Patent B1
US 12,443,621 · App. 18/668,888 · Granted Oct 14, 2025

Using reinforcement learning to recommend data visualizations

Inventors: Vibhor Porwal (Bidhuna, IN); Subrata Mitra (Bangalore, IN); Shubham Agarwal (West Bengal, IN); Ryan A Rossi (Santa Clara, CA); Ghazi Shazan Ahmad (West Bengal, IN); Manav Ketan Doshi (Maharashtra, IN); Syam Manoj Kumar Paila (Andhra Pradesh, IN)
Assignee: ADOBE INC.
G06F16/26
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,443,621
App. No.
18/668,888
Granted
Oct 14, 2025
Kind
B1
Abstract

Methods and systems are provided for using reinforcement learning to recommend data visualizations. In embodiments described herein, statistical features for each sample of corresponding samples of a dataset are determined by applying each sample of the dataset to a data visualization recommendation model. The computational cost of each of the statistical features for each of the samples is determined based via a regression model. Recommended statistical features are determined by sequentially applying each sample to a reinforcement learning model with a computational budget and with the corresponding computational costs of the statistical features of each sample. A data visualization is then displayed that is generated by applying the dataset and the recommended statistical features to the data visualization recommendation model.

Claims (54)

1. One or more non-transitory computer-readable media having a plurality of executable instructions embodied thereon, which, when executed by one or more processors, cause the one or more processors to perform a method comprising:

determining, based on applying a sample of a dataset to a data visualization recommendation model, statistical features of the sample for generating data visualizations of the sample;

determining, based on applying the statistical features and the dataset to a regression model, corresponding computational costs of the statistical features when applying the statistical features to the dataset;

determining, based on applying a computational budget, the sample of the dataset and the corresponding computational costs to a reinforcement learning model, recommended statistical features by causing the reinforcement learning model to:

select corresponding statistical features from the statistical features of the sample to add to the recommended statistical features until the computational budget is met by determining, based on a reward function, whether to explore a statistical feature from the statistical features of the sample or exploit a previously explored statistical feature from the statistical features of the sample; and

minimize a loss function between the recommended statistical features and the statistical features of the sample until the loss function is within a threshold value; and

causing display, based on applying the dataset and the recommended statistical features to the data visualization recommendation model, of a recommended data visualization.

2. The one or more non-transitory computer-readable media of claim 1 , the method further comprising:

training the regression model to compute the corresponding computational costs of the statistical features for different dataset sizes, wherein the corresponding computational costs of the statistical features of the sample correspond to a size of the dataset.

3. The one or more non-transitory computer-readable media of claim 1 , the method further comprising:

sequentially applying different samples of the dataset to the reinforcement learning model to minimize the loss function based on a combined score of the recommended statistical features.

4. The one or more non-transitory computer-readable media of claim 1 , the method further comprising:

minimizing the loss function between a combined score of the recommended statistical features and a corresponding combined score of the statistical features of the sample within the threshold value.

5. The one or more non-transitory computer-readable media of claim 1 , the method further comprising:

determining the reward function based on a change in a score of the recommended statistical features when adding a corresponding statistical feature to the recommended statistical features with respect to a corresponding computational cost of the statistical feature.

6. The one or more non-transitory computer-readable media of claim 1 , wherein determining the statistical features of the sample further comprises applying statistical functions of the data visualization recommendation model to the sample of the dataset.

7. The one or more non-transitory computer-readable media of claim 1 , wherein the computational budget is an amount of time and the corresponding computational costs of the statistical features correspond to an estimated amount of time to compute a corresponding statistical feature of the statistical features based on a size of the dataset.

8. A computer-implemented method comprising:

determining, based on applying samples of a dataset to a data visualization recommendation model, statistical features of each sample of the samples for generating data visualizations of each sample;

determining, based on applying the statistical features of each sample to a regression model, corresponding computational costs of the statistical features of each sample when applying the statistical features of each sample to the dataset;

determining, based on sequentially applying each sample to a reinforcement learning model with a computational budget and with the corresponding computational costs of the statistical features of each sample, recommended statistical features by causing the reinforcement learning model to:

for each sample, select corresponding statistical features from the statistical features of the sample to add to corresponding recommended statistical features for the sample until the computational budget is met by determining, based on a reward function, whether to explore a statistical feature from the statistical features of each of the samples or exploit a previously explored statistical feature from the statistical features of each of the samples;

for each sample, minimize a loss function between the corresponding recommended statistical features for the sample and the statistical features of the sample; and

sequentially apply each sample to the reinforcement learning model until the loss function is within a threshold value to determine the recommended statistical features; and

causing display of a data visualization based on applying the dataset and the recommended statistical features to the data visualization recommendation model.

9. The computer-implemented method of claim 8 , further comprising:

training the regression model to compute the corresponding computational costs of the statistical features for different dataset sizes, wherein the corresponding computational costs of the statistical features of each sample correspond to a size of the dataset.

10. The computer-implemented method of claim 8 , further comprising:

minimizing the loss function based on a combined score of the corresponding recommended statistical features.

11. The computer-implemented method of claim 8 , further comprising:

minimizing the loss function between a corresponding combined score of the corresponding recommended statistical features and a combined score of the statistical features within the threshold value.

12. The computer-implemented method of claim 8 , further comprising:

determining the reward function based on a change in a score of the recommended statistical features when adding a corresponding statistical feature to the corresponding recommended statistical features for the sample with respect to a corresponding computational cost of the statistical feature.

13. The computer-implemented method of claim 8 , wherein each of the samples is randomly sampled and each sample size of each of the samples increases in size when sequentially applying each sample to the reinforcement learning model.

14. The computer-implemented method of claim 8 , wherein determining the statistical features of each sample further comprises applying statistical functions of the data visualization recommendation model to each sample.

15. A computing system comprising:

a processor; and

a non-transitory computer-readable medium having stored thereon instructions that when executed by the processor, cause the processor to perform operations including:

determining, based on applying samples of a dataset to a data visualization recommendation model, statistical features of each sample of the samples for generating data visualizations of each sample;

causing a regression model to determine, based on the statistical features of each sample, corresponding computational costs of the statistical features of each sample when applying the statistical features of each sample to the dataset;

causing a reinforcement learning model to determine, based on sequentially applying each sample to the reinforcement learning model with a computational budget and with the corresponding computational costs of the statistical features of each sample, recommended statistical features by causing the reinforcement learning model to:

for each sample, select corresponding statistical features from the statistical features of the sample to add to corresponding recommended statistical features for the sample until the computational budget is met by determining, based on a reward function, whether to explore a statistical feature from the statistical features of each of the samples or exploit a previously explored statistical feature from the statistical features of each of the samples; and

for each sample, minimize a loss function between the corresponding recommended statistical features for the sample and the statistical features of the sample; and

sequentially apply each sample to the reinforcement learning model until the loss function is within a threshold value to determine the recommended statistical features; and

causing display, based on applying the dataset and the recommended statistical features to the data visualization recommendation model, of a data visualization.

16. The computing system of claim 15 , the operations further including:

training the regression model to compute the corresponding computational costs of the statistical features for different dataset sizes, wherein the corresponding computational costs of the statistical features of each sample correspond to a size of the dataset.

17. The computing system of claim 15 , the operations further including:

minimizing the loss function based on a combined score of the corresponding recommended statistical features.

18. The computing system of claim 15 , the operations further including:

minimizing the loss function between a corresponding combined score of the corresponding recommended statistical features and a combined score of the statistical features within the threshold value.

19. The computing system of claim 15 , the operations further including:

determining the reward function based on a change in a score of the recommended statistical features when adding a corresponding statistical feature to the corresponding recommended statistical features for the sample with respect to a corresponding computational cost of the statistical feature.

20. The computing system of claim 15 , wherein each of the samples is randomly sampled and each sample size of each of the samples increases in size when sequentially applying each sample to the reinforcement learning model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2024
From: PORWAL, VIBHOR; MITRA, SUBRATA; AGARWAL, SHUBHAM; ROSSI, RYAN A.; AHMAD, GHAZI SHAZAN; DOSHI, MANAV KETAN; KUMAR PAILA, SYAM MANOJ
To: ADOBE INC.
Reel/Frame 067468/0543 →
References Cited (136)
US 7685377B1 · Milligan · 2010 [cited by applicant]
US 8621422B1 · Hsu et al. · 2013 [cited by applicant]
US 9866392B1 · Campagna et al. · 2018 [cited by applicant]
US 10013497B1 · Boodman · 2018 [cited by applicant]
US 10620790B2 · Ellis et al. · 2020 [cited by applicant]
US 10664362B2 · Larson et al. · 2020 [cited by applicant]
US 10970053B2 · Kandogan et al. · 2021 [cited by applicant]
US 11182748B1 · Neckermann et al. · 2021 [cited by applicant]
US 11256710B2 · Gulwani et al. · 2022 [cited by applicant]
US 11500882B2 · Anand et al. · 2022 [cited by applicant]
US 11714807B2 · Amulu et al. · 2023 [cited by applicant]
US 11720550B2 · Budovski et al. · 2023 [cited by applicant]
US 11782576B2 · Harris et al. · 2023 [cited by applicant]
US 11816436B2 · Panuganty et al. · 2023 [cited by applicant]
US 20020052910A1 · Bennett et al. · 2002 [cited by applicant]
US 20030033554A1 · Bomfim et al. · 2003 [cited by applicant]
US 20030133505A1 · Koyanagi · 2003 [cited by examiner]
US 20080154905A1 · Paalasmaa et al. · 2008 [cited by applicant]
US 20080320225A1 · Panzer et al. · 2008 [cited by applicant]
US 20090322755A1 · Holm-Peterson et al. · 2009 [cited by applicant]
US 20100070535A1 · Irun-Briz et al. · 2010 [cited by applicant]
US 20120272240A1 · Starks et al. · 2012 [cited by applicant]
US 20130263019A1 · Castellanos et al. · 2013 [cited by applicant]
US 20130329557A1 · Petry et al. · 2013 [cited by applicant]
US 20130332862A1 · Mirra et al. · 2013 [cited by applicant]
US 20140282184A1 · Dewan et al. · 2014 [cited by applicant]
US 20140306964A1 · Reddish et al. · 2014 [cited by applicant]
US 20140310619A1 · Fickenwirth et al. · 2014 [cited by applicant]
US 20150039537A1 · Peev et al. · 2015 [cited by applicant]
US 20160110167A1 · Broadbent et al. · 2016 [cited by applicant]
US 20160232151A1 · Blackmon · 2016 [cited by applicant]
US 20170090910A1 · Deluca et al. · 2017 [cited by applicant]
US 20180113873A1 · Gulwani et al. · 2018 [cited by applicant]
US 20180129372A1 · Ellis et al. · 2018 [cited by applicant]
US 20180189294A1 · Anand et al. · 2018 [cited by applicant]
US 20180189691A1 · Oehrle et al. · 2018 [cited by applicant]
US 20190042212A1 · Kandogan et al. · 2019 [cited by applicant]
US 20190102703A1 · Belyaev et al. · 2019 [cited by applicant]
US 20190138912A1 · Modarresi et al. · 2019 [cited by applicant]
US 20190361720A1 · Balachandran · 2019 [cited by applicant]
US 20200034481A1 · Asplund et al. · 2020 [cited by applicant]
US 20200058012A1 · Chandorkar · 2020 [cited by examiner]
US 20200065772A1 · Whitehead et al. · 2020 [cited by applicant]
US 20200134074A1 · Mankovskii et al. · 2020 [cited by applicant]
US 20200151217A1 · Kothe et al. · 2020 [cited by applicant]
US 20200293933A1 · Ghosh et al. · 2020 [cited by applicant]
US 20200334607A1 · Fadel et al. · 2020 [cited by applicant]
US 20200349589A1 · Southall et al. · 2020 [cited by applicant]
US 20200387810A1 · Hodgson et al. · 2020 [cited by applicant]
US 20210097062A1 · Mishra et al. · 2021 [cited by applicant]
US 20210240702A1 · Mei et al. · 2021 [cited by applicant]
US 20210272029A1 · Karlberg et al. · 2021 [cited by applicant]
US 20210350068A1 · Sanossian · 2021 [cited by applicant]
US 20210374770A1 · Banerjee et al. · 2021 [cited by applicant]
US 20220300836A1 · Rossi et al. · 2022 [cited by applicant]
US 20220358405A1 · Every et al. · 2022 [cited by applicant]
US 20220405314A1 · Du et al. · 2022 [cited by applicant]
US 20230048938A1 · Vertsel et al. · 2023 [cited by applicant]
US 20230063424A1 · Zeghlache · 2023 [cited by applicant]
US 20230079109A1 · Anand et al. · 2023 [cited by applicant]
US 20230169671A1 · Jung · 2023 [cited by examiner]
US 20230385141A1 · Xu · 2023 [cited by examiner]
US 20240333615A1 · Ford · 2024 [cited by examiner]
US 20250061506A1 · Sankararaman · 2025 [cited by examiner]
AU 2012372150A1 · 2013 [cited by applicant]
CA 2731979A1 · 2010 [cited by applicant]
CN 113011400A · 2021 [cited by applicant]
CN 115438210A · 2022 [cited by applicant]
WO 0362993A2 · 2003 [cited by applicant]
WO 2013170289A1 · 2013 [cited by applicant]
WO 2021231040A1 · 2021 [cited by applicant]
“Ai2html”, archietse, Retrieved from Internet URL: http://ai2html.org/, accessed on May 16, 2022, pp. 1-13 (2011). [cited by applicant]
“Cascade and Inheritance”, MON, Retrieved from Internet URL : https://developer.mozilla.org/en-US/docs/Learn/CSS/Building_blocks/Cascade_and_inheritance, accessed on Jul. 4, 2022, pp. 1-26. [cited by applicant]
“DataWrapper”, Retrieved from Internet URL: https://www.datawrapper.de/, accessed on May 12, 2022, pp. 9. [cited by applicant]
“Documentation-Vega”, Retrieved from Internet URL: https://vega.github.io/vega/docs/, accessed on May 13, 2022, pp. 2. [cited by applicant]
“Power BI”, Microsoft, Retrieved from Internet URL: https://powerplalform.microsofl.com/en-us/, accessed on Jul. 5, 2022, pp. 9. [cited by applicant]
“Tableau Software”, Retrieved from Internet URL: https://www.tableau.com/, accessed on Jul. 5, 2022, pp. 13 2003). [cited by applicant]
“Using Google Charts”, Google Developers, Retrieved from Internet URL: https://developers-dot-devsite-v2-prod.ppspol.com/chart/interactive/docs, accessed on May 13, 2022, pp. 2 (2019). [cited by applicant]
“Using Media Queries”, MON, Retrieved from Internet URL : https://developer.mozilla.org/en-US/docs/Web/CSS/Media_Queries/Using_media_queries, accessed on Jul. 4, 2022, pp. 1-8. [cited by applicant]
“ZingSofl”, ZingChart, Retrieved from Internet URL :https://www.zingchart.com/, accessed on Jun. 29, 2022, p. 1. [cited by applicant]
“CRM Analytics”, Salesforce Analytics Software and Tools I Tableau CRM-Salesforce.com, Retrieved from Internet URL : https://www.salesforce.com/products/crm-analytics/overview/, accessed on Dec. 7, 2022, pp. 14. [cited by applicant]
“Lexio—Data stories speak louder than dashboards”, Lexio | The Future of Data + Analytics, Narrative Science, A Salesforce Company, Retrieved from Internet URL : Wayback Machine—https://web.archive.org/web/2022052013030… [cited by applicant]
“Natural Language Technology for Every Use Case—Arria NLG”, Arria NLG Technology Suite, Retrieved from Internet URL : https://www.arria.com/technology-suite/, accessed on Dec. 7, 2022, pp. 1. [cited by applicant]
“Visa Chart Components”, Visa Developer Center, Retrieved from Internet URL : https://developer.visa.com/pages/chart-components, accessed on Dec. 7, 2022, pp. 9. [cited by applicant]
“Wordsmith I Automated Insights”, Retrieved from Internet URL : https://automatedinsights.com/wordsmith/, accessed on Dec. 7, 2022, pp. 4. [cited by applicant]
A Declarative Language for Integrating Machine Learning in Visual Analytics by Jianping et. al (https://arxiv.org/pdf/2009.01399.pdf) (Year: 2020). [cited by applicant]
Ahmad et al., “ScaleViz: Scaling Visualization Recommendation Models on Large Data”, In Pacific-Asia Conference on Knowledge Discovery and Data Mining, Apr. 25, 2024. [cited by applicant]
Andrews, K., “Responsive Visualisation”, In MobileVis '18 Workshop at CHI, ACM, pp. 1-6 {Apr. 2018). [cited by applicant]
Bentley, E., “The Web as Medium for Data Visualization”, In The Data Journalism Handbook: Towards a Critical Data Practice, pp. 182-192 (2021). [cited by applicant]
Bostock, M., “d3-format”, Retrieved from Internet URL: hllps://web.archive.org/web/20220421224649/hllps://github.com/d3/d3-formal/, accessed on May 12, 2022, pp. 1-11. [cited by applicant]
Bostock, M., et al., “D3 Data-Driven Documents”, IEEE Transactions on Visualization and Computer Graphics, vol. 17, No. 12, pp. 2301-2309 (Dec. 2011). [cited by applicant]
Brewka, G., et al., “Answer Set Programming at a Glance”, Retrieved from Internet URL : https://doi.org/10.1145/2043174.2043195, ACM, vol. 54, No. 12, pp. 93-103 (Dec. 2011). [cited by applicant]
Bryant, J., and Jones, M., “Responsive Web Design”, Chapter 4, pp. 37-49 (2012). [cited by applicant]
Cui, Z., et al., “DataSite: Proactive visual data exploration with computation of insight-based recommendations”, Information Visualization, Retrieved from Internet URL: https://doi.org/10.1177/1473871618806555, vol. 18… [cited by applicant]
Ding et al., “QuickInsights: Quick and Automatic Discovery of Insights from Multi-Dimensional Data”, SIGMOD'19, Jun. 30-Jul. 5, 2019, 15 pages. [cited by applicant]
Gal, R., “Responsive visualizations coming to Power BI”, Retrived from Internet URL: https://powerbi.microsofl.com/in-us/blog/responsive-visualizations-coming-to-power-bi/, accessed on May 13, 2022, pp. 1-11. [cited by applicant]
Gebser, M., et al., “Clingo = ASP + Control: Preliminary Report”, Retrieved from Internet URL : https://doi.org/10.48550/arXiv.1405.3694, pp. 1-9 (May 2014). [cited by applicant]
Gebser, M., et al., “Potassco: The Potsdam Answer Set Solving Collection”, AI Communications, IOS Press, https://doi.org/10.3233/AIC-2011-0491, pp. 107-124 (2011). [cited by applicant]
Giacomo, E., D., et al., “Network Visualization Retargeting”, 6th International Conference on Information, Intelligence, Systems and Applications (IISA), IEEE, pp. 1-6 (2015). [cited by applicant]
Hoffswell, J., et al., “SetCoLa: High-Level Constraints for Graph Layout”, Eurographics Conference on Visualization (EuroVis), vol. 37, No. 3, pp. 1-12 (2018). [cited by applicant]
Hoffswell, J., et al., “Techniques for Flexible Responsive Visualization Design”, CHI, ACM, pp. 1-13 (2020). [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2022/027539, mailed on Jul. 28, 2022, 12 pages. [cited by applicant]
Jakobsen, M., R., and Hornbjek, K., “Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale”, IEEE Transactions on Visualization and Computer Graphics, vo… [cited by applicant]
Kachuee et al., “Opportunistic Learning: Budgeted Cost-Sensitive Learning From Data Streams”, Published as a conference paper at ICLR 2019, Available at : <arXiv:1901.00243v2 [cs.LG] Feb. 18, 2019>, Feb. 18, 2019, pp. 1… [cited by applicant]
Kim, D. H, et al., “Towards Understanding How Readers Integrate Charts and Captions: A Case Study with Line Charts”, In Proceedings of the CHI Conference on Human Factors in Computing Systems, pp. 1-11 (May 8-13, 2021). [cited by applicant]
Kim, H., et al., “An Automated Approach to Reasoning About Task-Oriented Insights in Responsive Visualization”, IEEE Transactions on Visualization and Computer Graphics, pp. 1-11 {Jul. 2021). [cited by applicant]
Kim, H., et al., “Design Patterns and Trade-Offs in Responsive Visualization for Communication”, Eurographics Conference on Visualization, vol. 40, No. 3, pp. 1-12 {Apr. 2021). [cited by applicant]
Kim, Y., and Heer, J., “Gemini: A Grammar and Recommender System for Animated Transitions in Statistical Graphics”, IEEE, arXiv:2009.01429v1, pp. 1-10 {Sep. 2020). [cited by applicant]
Kim, Y., et al., “GraphScape: A Model for Automated Reasoning about Visualization Similarity and Sequencing”, CHI, ACM, pp. 2628-2638 {May 2017). [cited by applicant]
Law, P-M., et al., “Characterizing Automated Data Insights”, In IEEE Visualization Conference (VIS), arXiv:2008.13060v2, pp. 1-5 (Sep. 4, 2020). [cited by applicant]
Leclaire, J., and Tabard, A., “R3S.js—Towards Responsive Visualizations”, In Workshop on Data Exploration for nteractive Surfaces DEXIS, ACM ITS, pp. 16-19 (2015). [cited by applicant]
Li et al., “Feature Selection: A Data Perspective”, ACM Comput. Surv. vol. 50, No. 6, Article 94, Dec. 2017, 45 pages. [cited by applicant]
Lin, H., et al., “Dziban: Balancing Agency & Automation in Visualization Design via Anchored Recommendations”, CHI, ACM, pp. 1-12 (2020). [cited by applicant]
Ma, R., et al., “LADV: Deep Learning Assisted Authoring of Dashboard Visualizations from Images and Sketches”, IEEE Transactions on Visualization and Computer Graphics, pp. 1-15 (2020). [cited by applicant]
MacKinlay, J., D., et al., “Show Me: Automatic Presentation for Visual Analysis”, IEEE Transactions on Visualization nd Computer Graphics, pp. 1-8 (2007). [cited by applicant]
Mendez, G., G., et al., “Bottom-up vs. Top-down: Trade—0ffs in Efficiency, Understanding, Freedom and Creativity with InfoVis Tools”, CHI, ACM, pp. 1-12 (2017). [cited by applicant]
Mohorovicic, S., “Implementing Responsive Web Design for Enhanced Web Presence”, 36th International Convention on Information and Communication Technology, Electronics and Microelectronics {MIPRO), pp. 1206-1210 2013). [cited by applicant]
Moritz, D., “Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco”, IEEE Trans. Visualization & Comp. Graphics, pp. 1-11 (2018). [cited by applicant]
Muth, L., C., “Create better, more responsive text annotations {yes, also on maps)”, Retrieved from Internet URL: https://blog.datawrapper.de/beller-more-responsive-annotationsin-datawrapper-data-visualizations/, access… [cited by applicant]
Muth, L., C., and Aisch, G., “Our new Tables: responsive, with sparklines, bar charts and sticky rows”, Retrieved ram Internet URL : https://blog.datawrapper.de/new-tabletool-barcharts-fixed-rows-responsive-2/, accessed… [cited by applicant]
Notice of Allowance received for U.S. Appl. No. 18/484,674, mailed on Aug. 23, 2024, 14 pages. [cited by applicant]
Qian et al., “Learning to Recommend Visualizations from Data”, KDD '21, Aug. 14-18, 2021, 11 pages. [cited by applicant]
Sam, C., “Ai2html and Its Impact on the News Graphics Industry”, In MobileVis '18 Workshop at CHI, pp. 1-6 (2018). [cited by applicant]
Satyanarayan, A., and Heer, J., “Lyra: An Interactive Visualization Design Environment”, Eurographics Conference on Visualization, vol. 33, No. 3, pp. 1-10 (2014). [cited by applicant]
Satyanarayan, A., et al., “Reactive Vega: A Streaming Dataflow Architecture for Declarative Interactive Visualization”, In IEEE Trans. Visualization & Comp. Graphics, pp. 1-10 (2015). [cited by applicant]
Satyanarayan, A., et al., “Vega-Lite: A Grammar of Interactive Graphics”, IEEE Trans. Visualization & Comp. Graphics, pp. 1-10 (2016). [cited by applicant]
Shi, D., et al., “Calliope: Automatic visual data story generation from a spreadsheet”, IEEE Transactions on Visualization and Computer Graphics, arXiv:2010.09975v1, vol. 27, No. 2, pp. 1-11 (Oct. 20, 2020). [cited by applicant]
Srinivasan, A., et al., “Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication”, IEEE Transactions on Visualization and Computer Graphics, vol. 25, No. 1, pp. 672-681 {Janu… [cited by applicant]
Wickham, H., et al., “A Layered Grammar of Graphics”, Journal of Computational and Graphical Statistics, vol. 19, No. 1, pp. 3-28 (2010). [cited by applicant]
Wongsuphasawat, K., et al., “Voyager 2: Augmenting Visual Analysis with Partial View Specifications”, Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, ACM, pp. 2648-2659 (2017). [cited by applicant]
Wongsuphasawat, K., et al., “Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations”, IEEE Transactions on Visualization and Computer Graphics, pp. 1-10 (2015). [cited by applicant]
Wu, A., et al., “Learning to Automate Chart Layout Configurations Using Crowdsourced Paired Comparison”, Association for Computing Machinery, ACM, ISBN, pp. 1-12 (2021). [cited by applicant]
Wu, A., et al., “MobileVisFixer: Tailoring Web Visualizations for Mobile Phones Leveraging an Explainable Reinforcement Learning Framework”, IEEE Transactions on Visualization and Computer Graphics, pp. 1-11 {Aug. 2020). [cited by applicant]
Wu, Y., et al., “ViSizer: A Visualization Resizing Framework”, IEEE Transactions on Visualization and Computer Graphics, pp. 1-14 (2012). [cited by applicant]
Xiong, C., et al., Visual Arrangements of Bar Charts Influence Comparisons in Viewer Takeaways, IEEE Trans. Visualization & Comp. Graphics, pp. 1-11 {Aug. 2021). [cited by applicant]
Unpublished U.S. Appl. No. 18/409,240, Title : Training and Utilizing Language Machine Learning Models to Create Structured Outputs for Building Digital Visualizations From Analytics. [cited by applicant]