IP Library › Granted Patent US 12,373,458
Granted Patent B2
US 12,373,458 · App. 17/166,894 · Granted Jul 29, 2025

Determining a collection of data visualizations

Inventors: T. Alan Keahey (Naperville, IL); Daniel J. Rope (Reston, VA); Graham J. Wills (Naperville, IL)
Assignee: International Business Machines Corporation
G06F16/26G06F16/248
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,373,458
App. No.
17/166,894
Granted
Jul 29, 2025
Kind
B2
Abstract

A set of transition characteristics can be identified. The set of transition characteristics can include continuities and discontinuities between data fields and data visualization channels among a plurality of data visualizations. A transition tuple for each of a plurality of pairs of the data visualizations can be determined and mapped to a matrix. The matrix can be transposed to generate vectors, each vector representing a type of transition characteristic, at least one of the vectors comprising a plurality of elements equaling a total number of the determined transition tuples. The distribution of the data fields and the data visualization channels across the data visualizations can be determined by performing statistical analysis on each of the vectors. A collection of the data visualizations can be determined based on the statistical analysis performed on each of the vectors, the collection of the data visualizations can include a subset of the data visualizations.

Claims (81)

1. A method comprising:

identifying a set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among a plurality of data visualizations by analyzing the plurality of data visualizations and identifying similarities and differences among the data fields and the data visualization channels;

determining, using a processor, a transition tuple for each of a plurality of pairs of the data visualizations, the transition tuples representing a distribution of the data fields and the data visualization channels across the plurality of data visualizations;

mapping the transition tuples to a matrix;

generating vectors by transposing the matrix, each vector representing a type of transition characteristic, wherein the generating the vectors comprises generating at least one vector indicating a degree of continuity between the plurality of data visualizations and comprising a plurality of elements equaling a total number of the determined transition tuples;

determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations by performing statistical analysis on each of the vectors;

determining a collection of the data visualizations based on the statistical analysis performed on each of the vectors, the collection of the data visualizations comprising at least a subset of the plurality of data visualizations; and

communicating the collection of the data visualizations to a client device, wherein the client device presents the collection of the data visualizations to a user via a user interface of the client device.

2. The method of claim 1 , further comprising:

responsive to the determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on statistical analysis performed on each of the vectors comprises selecting candidate data visualizations that have respective scores that exceed a threshold value.

3. The method of claim 2 , further comprising:

identifying the candidate data visualizations based on a specified level of continuity between the data visualizations.

4. The method of claim 2 , further comprising:

identifying the candidate data visualizations based on at least one type of transition characteristic selected from a group consisting of a specified level of major discontinuity between the data visualizations, and a specified level of minor or syntactic discontinuity between the data visualizations.

5. The method of claim 1 , further comprising:

responsive to determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on the distribution of the data fields and the data visualization channels across the plurality of data visualizations comprises selecting a specified number of the candidate data visualizations having highest scores.

6. The method of claim 1 , further comprising:

identifying at least one data visualization in the collection of the data visualizations that is flagged by a user as being of interest;

responsive to identifying the at least one data visualization in the collection of the data visualizations that is flagged by the user as being of interest, generating or selecting at least one additional data visualization;

identifying a second set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

determining a distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

responsive to determining the distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by a user as being of interest, assigning at least one respective score to the at least one additional data visualization; and

responsive to the at least one score at least equaling a threshold value, adding the at least one additional data visualization to the collection of the data visualizations.

7. The method of claim 1 , wherein the determining the collection of the data visualizations comprises:

implementing genetic algorithms to select the data visualizations that satisfy specified criteria, the genetic algorithms simulating a process of natural selection by representing a solution to a problem through a string of simulated genes.

8. A system, comprising:

at least one processor programmed to initiate executable operations comprising:

identifying a set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among a plurality of data visualizations by analyzing the plurality of data visualizations and identifying similarities and differences among the data fields and the data visualization channels;

determining a transition tuple for each of a plurality of pairs of the data visualizations, the transition tuples representing a distribution of the data fields and the data visualization channels across the plurality of data visualizations;

mapping the transition tuples to a matrix;

generating vectors by transposing the matrix, each vector representing a type of transition characteristic, wherein the generating the vectors comprises generating at least one vector indicating a degree of continuity between the plurality of data visualizations and comprising a plurality of elements equaling a total number of the determined transition tuples;

determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations by performing statistical analysis on each of the vectors;

determining a collection of the data visualizations based on the statistical analysis performed on each of the vectors, the collection of the data visualizations comprising at least a subset of the plurality of data visualizations; and

communicating the collection of the data visualizations to a client device, wherein the client device presents the collection of the data visualizations to a user via a user interface of the client device.

9. The system of claim 8 , the executable operations further comprising:

responsive to the determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on statistical analysis performed on each of the vectors comprises selecting candidate data visualizations that have respective scores that exceed a threshold value.

10. The system of claim 9 , the executable operations further comprising:

identifying the candidate data visualizations based on a specified level of continuity between the data visualizations.

11. The system of claim 9 , the executable operations further comprising:

identifying the candidate data visualizations based on at least one type of transition characteristic selected from a group consisting of a specified level of major discontinuity between the data visualizations and a specified level of minor or syntactic discontinuity between the data visualizations.

12. The system of claim 8 , the executable operations further comprising:

responsive to determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on the distribution of the data fields and the data visualization channels across the plurality of data visualizations comprises selecting a specified number of the candidate data visualizations having highest scores.

13. The system of claim 8 , the executable operations further comprising:

identifying at least one data visualization in the collection of the data visualizations that is flagged by a user as being of interest;

responsive to identifying the at least one data visualization in the collection of the data visualizations that is flagged by the user as being of interest, generating or selecting at least one additional data visualization;

identifying a second set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

determining a distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

responsive to determining the distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by a user as being of interest, assigning at least one respective score to the at least one additional data visualization; and

responsive to the at least one score at least equaling a threshold value, adding the at least one additional data visualization to the collection of the data visualizations.

14. The system of claim 8 , wherein the determining the collection of the data visualizations comprises:

implementing genetic algorithms to select the data visualizations that satisfy specified criteria, the genetic algorithms simulating a process of natural selection by representing a solution to a problem through a string of simulated genes.

15. A computer program product, comprising:

one or more computer readable storage mediums having program code stored thereon, the program code stored on the one or more computer readable storage mediums collectively executable by a data processing system to initiate operations including:

identifying a set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among a plurality of data visualizations by analyzing the plurality of data visualizations and identifying similarities and differences among the data fields and the data visualization channels;

determining a transition tuple for each of a plurality of pairs of the data visualizations, the transition tuples representing a distribution of the data fields and the data visualization channels across the plurality of data visualizations;

mapping the transition tuples to a matrix;

generating vectors by transposing the matrix, each vector representing a type of transition characteristic, wherein the generating the vectors comprises generating at least one vector indicating a degree of continuity between the plurality of data visualizations and comprising a plurality of elements equaling a total number of the determined transition tuples;

determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations by performing statistical analysis on each of the vectors;

determining a collection of the data visualizations based on the statistical analysis performed on each of the vectors, the collection of the data visualizations comprising at least a subset of the plurality of data visualizations; and

communicating the collection of the data visualizations to a client device, wherein the client device presents the collection of the data visualizations to a user via a user interface of the client device.

16. The computer program product of claim 15 , the operations further comprising:

responsive to the determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on statistical analysis performed on each of the vectors comprises selecting candidate data visualizations that have respective scores that exceed a threshold value.

17. The computer program product of claim 16 , the operations further comprising:

identifying the candidate data visualizations based on a specified level of continuity between the data visualizations.

18. The computer program product of claim 16 , the operations further comprising:

identifying the candidate data visualizations based on at least one type of transition characteristic selected from a group consisting of a specified level of major discontinuity between the data visualizations, and a specified level of minor or syntactic discontinuity between the data visualizations.

19. The computer program product of claim 15 , the operations further comprising:

responsive to determining the distribution of the data fields and the data visualization channels across the plurality of data visualizations, assigning a score to each of a plurality of candidate data visualizations, each score indicating how closely a respective candidate data visualization fits specified criteria or desired characteristics;

wherein determining the collection of the data visualizations based on the distribution of the data fields and the data visualization channels across the plurality of data visualizations comprises selecting a specified number of the candidate data visualizations having highest scores.

20. The computer program product of claim 15 , the operations further comprising:

identifying at least one data visualization in the collection of the data visualizations that is flagged by a user as being of interest;

responsive to identifying the at least one data visualization in the collection of the data visualizations that is flagged by the user as being of interest, generating or selecting at least one additional data visualization;

identifying a second set of transition characteristics comprising continuities and discontinuities between data fields and data visualization channels among the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

determining a distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by the user as being of interest;

responsive to determining the distribution of the data fields and the data visualization channels across the at least one additional data visualization and the at least one data visualization that is flagged by a user as being of interest, assigning at least one respective score to the at least one additional data visualization; and

responsive to the at least one score at least equaling a threshold value, adding the at least one additional data visualization to the collection of the data visualizations.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 3, 2021
From: KEAHEY, T. ALAN; ROPE, DANIEL J.; WILLS, GRAHAM J.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 055136/0803 →
Continuity (3)
Continuation 15884302 · Jan 30, 2018
Continuation 15199071 · Jun 30, 2016
Related Publication 20210157819A1 · May 27, 2021
References Cited (135)
US 5121467A · Skeirik · 1992 [cited by applicant]
US 6012015A · Tubel · 2000 [cited by applicant]
US 7072899B2 · Lokken · 2006 [cited by applicant]
US 7089261B2 · Hladik, Jr. · 2006 [cited by applicant]
US 7366719B2 · Shaw · 2008 [cited by applicant]
US 7426520B2 · Gorelik · 2008 [cited by applicant]
US 7463263B2 · Gilboa · 2008 [cited by applicant]
US 7584415B2 · Cory · 2009 [cited by applicant]
US 7603326B2 · Bonabeau · 2009 [cited by applicant]
US 8117139B2 · Bonabeau · 2012 [cited by applicant]
US 8132122B2 · Risch · 2012 [cited by applicant]
US 8301585B2 · Mourey · 2012 [cited by applicant]
US 8352400B2 · Hoffberg · 2013 [cited by applicant]
US 8356000B1 · Koza · 2013 [cited by applicant]
US 8531451B2 · Mital · 2013 [cited by applicant]
US 8838510B2 · Baughman · 2014 [cited by applicant]
US 8935249B2 · Traub · 2015 [cited by examiner]
US 9230440B1 · Penilla · 2016 [cited by applicant]
US 9336268B1 · Moudy · 2016 [cited by applicant]
US 9418283B1 · Natarajan · 2016 [cited by applicant]
US 9576196B1 · Natarajan · 2017 [cited by applicant]
US 10599979B2 · Keahey · 2020 [cited by applicant]
US 10607139B2 · Keahey · 2020 [cited by applicant]
US 10685035B2 · Keahey · 2020 [cited by applicant]
US 10949444B2 · Keahey et al. · 2021 [cited by applicant]
US 20030130996A1 · Bayerl · 2003 [cited by applicant]
US 20040117239A1 · Mittal · 2004 [cited by applicant]
US 20050102325A1 · Gould · 2005 [cited by applicant]
US 20050192680A1 · Cascia · 2005 [cited by applicant]
US 20060195204A1 · Bonabeau · 2006 [cited by applicant]
US 20070112840A1 · Carson · 2007 [cited by applicant]
US 20080065685A1 · Frank · 2008 [cited by applicant]
US 20080077451A1 · Anthony · 2008 [cited by applicant]
US 20080104101A1 · Kirshenbaum · 2008 [cited by applicant]
US 20090096812A1 · Boixel · 2009 [cited by applicant]
US 20090105984A1 · Wen · 2009 [cited by applicant]
US 20090327883A1 · Robertson · 2009 [cited by applicant]
US 20100194778A1 · Robertson · 2010 [cited by applicant]
US 20110113003A1 · Roy · 2011 [cited by applicant]
US 20110261049A1 · Cardno · 2011 [cited by examiner]
US 20110316884A1 · Giambalvo · 2011 [cited by applicant]
US 20120136666A1 · Corpier · 2012 [cited by applicant]
US 20120159620A1 · Seifert · 2012 [cited by applicant]
US 20120245435A1 · Corpier · 2012 [cited by applicant]
US 20120313949A1 · Rope · 2012 [cited by applicant]
US 20130103677A1 · Chakra · 2013 [cited by applicant]
US 20130132042A1 · Chan · 2013 [cited by applicant]
US 20130166337A1 · MacGregor · 2013 [cited by applicant]
US 20130265319A1 · Fisher · 2013 [cited by applicant]
US 20140004489A1 · Kim · 2014 [cited by applicant]
US 20140025690A1 · Tareen · 2014 [cited by applicant]
US 20140039975A1 · Hill · 2014 [cited by applicant]
US 20140049546A1 · Wang · 2014 [cited by applicant]
US 20140052731A1 · Dahule · 2014 [cited by applicant]
US 20140108135A1 · Osborn · 2014 [cited by applicant]
US 20140114629A1 · Jojgov · 2014 [cited by applicant]
US 20140156331A1 · Cordasco · 2014 [cited by applicant]
US 20140205977A1 · Bak · 2014 [cited by applicant]
US 20140214335A1 · Siefert · 2014 [cited by applicant]
US 20140229164A1 · Martens · 2014 [cited by applicant]
US 20140247268A1 · Drucker · 2014 [cited by applicant]
US 20140267367A1 · Chong · 2014 [cited by applicant]
US 20140278738A1 · Feit · 2014 [cited by applicant]
US 20140279730A1 · Gamon · 2014 [cited by applicant]
US 20140330821A1 · Tullis · 2014 [cited by applicant]
US 20140354650A1 · Singh · 2014 [cited by applicant]
US 20140358999A1 · Rabinowitz · 2014 [cited by applicant]
US 20140359552A1 · Misra · 2014 [cited by applicant]
US 20150002518A1 · Nakajima · 2015 [cited by applicant]
US 20150007074A1 · Mackinlay · 2015 [cited by applicant]
US 20150161805A1 · Glazer · 2015 [cited by applicant]
US 20150220972A1 · Subramanya · 2015 [cited by applicant]
US 20150278371A1 · Anand · 2015 [cited by applicant]
US 20150279371A1 · Fujioka · 2015 [cited by applicant]
US 20150339301A1 · Paalborg · 2015 [cited by applicant]
US 20150347489A1 · Sherwin · 2015 [cited by applicant]
US 20160104311A1 · Allyn · 2016 [cited by applicant]
US 20160124960A1 · Moser · 2016 [cited by examiner]
US 20160205137A1 · Babb · 2016 [cited by applicant]
US 20160217578A1 · Can · 2016 [cited by applicant]
US 20160335497A1 · Williams · 2016 [cited by applicant]
US 20160342910A1 · Chu · 2016 [cited by applicant]
US 20160350275A1 · Keahey · 2016 [cited by applicant]
US 20160379084A1 · Keahey · 2016 [cited by applicant]
US 20170083814A1 · Keahey · 2017 [cited by applicant]
US 20170213135A1 · Keahey · 2017 [cited by applicant]
US 20180004811A1 · Keahey · 2018 [cited by applicant]
US 20180173765A1 · Keahey · 2018 [cited by applicant]
US 20200175381A1 · Keahey · 2020 [cited by applicant]
CN 103077288A · 2013 [cited by applicant]
JP 3790699B2 · 2006 [cited by examiner]
WO 2009154484A2 · 2009 [cited by applicant]
WO 2014210521A1 · 2014 [cited by applicant]
WO 2015077896A1 · 2015 [cited by applicant]
WO WO2016049634A1 · 2016 [cited by examiner]
IBM: List of IBM Patents or Patent Applications Treated as Related, Apr. 18, 2021, 2 pg. [cited by applicant]
Keahey, et al., U.S. Appl. No. 14/724,396, filed May 28, 2015, Titled: “Measuring Transitions Between Visualizations”, 32 pg. [cited by applicant]
Keahy et al., U.S. Appl. No. 15/199,071, titled “Determining a Collection of Data Visualizations”, filed Jun. 30, 2016, 44 pg. [cited by applicant]
Keahy et al., U.S. Appl. No. 15/884,302, titled “Determining a Collection of Data Visualizations”, filed Jan. 30, 2018, 44 pg. [cited by applicant]
Keahy, et al., U.S. Appl. No. 14/862,562, filed Sep. 23, 2015, titled “Candidate Visualization Techniques for Use With Genetic Algorithms”, 36 pg. [cited by applicant]
Keahy, et al., Pending U.S. Appl. No. 15/480,422, filed Apr. 6, 2017, titled “Candidate Visualization Techniques for Use With Genetic Algorithms”, 36 pg. [cited by applicant]
Keahy, et al., Pending U.S. Appl. No. 16/787,848, filed Feb. 11, 2020, titled “Candidate Visualization Techniques for Use With Genetic Algorithms”, 36 pg. [cited by applicant]
Agrawal, R. et al., “Querying Shapes of Histories,” In Proc. of the 21st Very Large Data Bases Conf., 1995, 13 pg. [cited by applicant]
Bista et al., “Multifaceted Visualization of Annotated Social Media Data,” In Big Data, IEEE Int'l. Congress on Big Data, IEEE Computer Society, Jun. 27, 2014, pp. 699-706. [cited by applicant]
Bonissone, P.P., “Lazy meta-learning: creating customized model ensembles on demand,” In IEEE World Congress on Computational Intelligence (pp. 1-23) Jun. 2012. [cited by applicant]
Buche, D. et al. (2005). “Accelerating evolutionary algorithms with Gaussian process fitness function models”. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews). Volume: 35, Issue: 2,… [cited by applicant]
Carty, D.M. “An Analysis of boosted regression trees to predict the strength properties of wood composites,” Master's Thesis, Univ. of Tennessee, Aug. 2011, 105 pg. [cited by applicant]
Collins, C. et al., “VisLink: Revealing relationships amongst visualizations,” In IEEE Transactions on Visualization and Computer Graphics, vol. 13, No. 6, pp. 1192-1199, 2007. [cited by applicant]
Cooper, L.L. et al., “The Effects of Data and Graph Type on Concepts and Visualizations of Variability,” In Journal of Statistics Education, Jul. 1, 2010, vol. 18, No. 2, 16 pg. [cited by applicant]
Edwards, J., “Visualization of Data Flow Graphs for In-Situ Analysis,” Doctoral Dissertation, Technische Universitat Berlin, Jul. 31, 2015, 79 pg. [cited by applicant]
Farooq, H. et al., “An interactive visualization of Genetic Algorithm on 2-D graph,” In 10th IEEE Int'l. Conf.on Cognitive Informatics & Cognitive Computing (ICCI* CC), Aug. 2011, pp. 144-151. [cited by applicant]
Forbus, T., “Using Evolutionary Algorithms to Generate Multi-view Visualization Layouts,” PhD. Diss., University of Oklahoma, 2012, 96 pg. [cited by applicant]
Gotz, D. et al., “Behavior-driven visualization recommendation,” In Proc. Of 14th Int'l. Conf. on Intelligent User Interfaces, pp. 351-324, ACM. [cited by applicant]
Hart, E. et al., “GAVEL—a new tool for genetic algorithm visualization,” In IEEE Transactions on Evolutionary Computation vol. 5, No. 4, 2001, pp. 335-348. [cited by applicant]
Jain, AK et al., “Statistical pattern recognition: A review,” In IEEE Transactions on Pattern Analysis and Machine Intelligence, Jan. 2000, vol. 22, No. 1, pp. 4-37. [cited by applicant]
Jin, Y. et al., “A Comprehensive Survey Of Fitness Approximation In Evolutionary Computation,” In Soft Computing, vol. 9, No. 1, pp. 3-12, Jan. 1, 2005. [cited by applicant]
Jin, Y. et al., “A framework for evolutionary optimization with approximate fitness functions,” IEEE Transactions on Evolutionary Computation. Oct. 2002, vol. 6, No. 5, pp. 481-494. [cited by applicant]
Wagner, M. et al.“Problem characterization and abstraction for visual analytics in behavior-based malware pattern analysis,” In Proc. Of the 11th Workshop on Visualization for Cyber Security, VizSec '14, pp. 9-16, ACM. [cited by applicant]
Voight, M. et al., “Context-aware recommendation of visualization components,” In 4th Int'l. Conf. on Information, Process, and Knowledge Management (eKNOW), Feb. 2012, pp. 101-109. [cited by applicant]
Sun, Y. et al., “Articulate: A semi-automated model for translating natural language queries into meaningful visualizations,” In Int'l. Sym. on Smart Graphics, Jun. 24, 2010, pp. 184-195, Springer, Berlin, Heidelberg. [cited by applicant]
Kinch, R.J., “Computer-aided design of computer architectures using interactive graphic representation,” No. 951-958, University of Illinois at Urbana-Champaign. 1979. [cited by applicant]
Klimek, J. et al., “Application of the Linked Data Visualization Model on Real World Data from the Czech LOD Cloud,” In LDOW 2014, Apr. 2014, 10 pg. [cited by applicant]
Kosala, R. et al., Web mining research: a SurveyACM Sigkdd Explorations Newsletter, vol. 2, No. 1, pp. 1-15, 2000. [cited by applicant]
Li, J., “Direct manipulation of integrated documents: an approach to interactively manipulate spatial relationships based on constraint programming techniques,” Univ. Royal Inst. Technology Institute of Information, Tec… [cited by applicant]
Lu, J. et al., “Data Visualization of Web Service with Parallel Coordinates and NodeTrix,” In 2014 IEEE Int'l. Conf. on Services Computing (SCC), pp. 766-773, 2014. [cited by applicant]
Mell, P. et al., “The NIST definition of cloud computing,” National Institute of Standards and Technology, NIST Special Publication 800-145, Sep. 2011. [cited by applicant]
Mladenic, D., “Text-learning and related intelligent agents: a Survey,” IEEE Intelligent Systems and Their Applications, vol. 14, No. 4, pp. 44-54, 1999. [cited by applicant]
Nagypal, G. et al., “Applying the semantic web: The VICODI experience in creating visual contextualization for history, ”In Literary and Linguistic Computing, Sep. 1, 2005, vol. 20, No. 3, pp. 327-439. [cited by applicant]
Palotai, Z. et al., “Labelmovie: Semi-supervised machine annotation tool with quality assurance and crowd sourcing options for videos,” In IEEEE 12th Int'l. Workshop on Content-Based Multimedia Indexing (CBMI), Jun. 18,… [cited by applicant]
Poli, R. et al. (1991 ). “A Neural Network Expert System for Diagnosing and Treating Hypertension”. Computer. vol. 24 , Issue: 3 , Mar. 1991. IEEE. pp. 64-71. DOI: 10.1109/2.73514 (Year: 1991). [cited by applicant]
Rivera, S. et al., “Proposing a framework for crowd-sourced green infrastructure design,” Int'l. Environmental Modelling and Software Society (iEMSs), 7th Int'l Congress on Env. Modelling and software, 2014, 11 pg. [cited by applicant]
Rusu, D. et al., “Document visualization based on semantic graphs,” In IEEE 13th Int'l. Conf. Information Visualisation, pp. 292-297, Jul. 2009. [cited by applicant]
Sciacca, E., et al., “Visivo workflow-oriented science gateway for astrophysical visualization,” In 2013 21st Euromicro Int'l. Conf. on Parallel, Distributed, and Network-Based Processing, pp. 165-177, IEEE, 2013. [cited by applicant]
Shen, J. et al., “A hybrid learning system for recognizing user tasks from desktop activities and email messages,” In ACM Proc. of 11th Int'l. Conf. on Intelligent User Interfaces, Jan. 29, 2006, pp. 86-92. [cited by applicant]
Sledz, D.A. et al., “A dynamic three-dimensional network visualization program for integration into CyberCIEGE and other network visualization scenarios,” Naval Postgraduate School, Monterey, CA, 2007, 135 pg. [cited by applicant]