| Patent application number | Description | Published |
|---|
| 20080222562 | Graph Selection Method - Embodiments of the present invention provide a decision framework for selecting graph types based on attributes such as task, end-user, data-bound, and representational attributes. According to one embodiment, a computer-implemented method for aiding a user in selecting a graph type for a graph comprises receiving a selection of a graph type subset from the user, the graph type subset selected from a plurality of graph type subsets, the selection responsive to at least one task attribute corresponding to an intended use for the graph. The method further comprises generating a user interface to be displayed to the user, the user interface including an indication of at least one graph type in the selected graph type subset, an indication of at least one attribute, and an indication of whether the at least one graph type is appropriate in view of the at least one attribute, thereby providing guidance to the user in selecting an appropriate graph type. | 09-11-2008 |
| 20080278496 | RENDERING DATA VISUALIZATION WITH MINIMAL ROUND-OFF ERROR - Systems and methods in accordance with various embodiments of the present invention provide for the rendering of data visualizations with minimal round-off errors. The data visualization method represents a dataset as graphical elements within a graphical layout area by performing layout of a data value within the dataset on the graphical layout area. The data value is positioned on the graphical layout area by determining a floating point position of the data value. A round-off error is calculated by casting the floating point position to an integer position on the graphical layout area. The round-off error is distributed to one or more subsequent data values that are yet to be positioned on the graphical layout area. | 11-13-2008 |
| 20090049372 | METHODS AND SYSTEMS FOR IMPLEMENTING A DYNAMIC HIERARCHICAL DATA VIEWER - Methods, systems, and machine-readable mediums are disclosed for viewing multiply-dimensioned data. In one embodiment, a method is disclosed which comprises displaying multiply-dimensioned data in a table format, the table format having a plurality of rows, a plurality of columns, and a plurality of cells displaying data, a first column of the plurality of columns including data having at least two hierarchical levels. Data for at least a first set of the plurality of cells is displayed in a graphical format, the first set including cells in the first column, the graphical format of the cells in the first set in the first column indicating a hierarchical level associated with the cell data and a mechanism is displayed for a first one of the rows to display at least one additional row having data in the first column associated with a lower hierarchical level of the first row data. | 02-19-2009 |
| 20100118030 | RADIAL VECTOR PLOTS FOR PATHS - Techniques for displaying path-related information. Techniques are provided for generating and displaying graphical representations for a path. In one embodiment, a radial vector plot is generated and output for a path. | 05-13-2010 |
| 20100118032 | RADIAL HISTOGRAMS FOR DEPICTING PATH INFORMATION - Techniques for displaying path-related information. Techniques are provided for generating and displaying one or more graphical representations for a path. In one embodiment, a radial histogram is generated and output for a path. | 05-13-2010 |
| 20100118267 | FINDING SEQUENTIAL MATCHES IN EYE TRACKING DATA - Embodiments of the invention provide systems and methods for analyzing eye tracking data. The eye tracking data can represent a number of different scanpaths and can be analyzed, for example, to find patterns or commonality between the scanpaths. According to one embodiment, a method of analyzing eye tracking data can comprise receiving the eye tracking data which can include a plurality of scanpaths, each scanpath representing a sequence of regions of interest on a stimulus image. A dotplot can be generated and can include each of the plurality of scanpaths. One or more patterns within the eye tracking data can be identified based on the dotplot. | 05-13-2010 |
| 20100119111 | TIME EXPANSION FOR DISPLAYING PATH INFORMATION - Embodiments of the present invention provide systems and methods for displaying sequential information representing a path. The sequential information can include a number of tokens representing a path. A representation of the tokens and path of the sequential information can be displayed. An instruction to adjust the representation of the path of the sequential information can be received. For example, instruction can comprise user instruction, including but not limited to a user manipulation of a slider control of a user interface through which the representation of the sequence is displayed. The displayed representation of the path of the sequential information can be updated based on and corresponding to the instruction. So for example, the user can click and drag or otherwise manipulate the slider control above and the displayed representation of the path can be expanded and/or contracted based on the user's movement of the slider control. | 05-13-2010 |
| 20100119112 | GRAPHICAL REPRESENTATIONS FOR AGGREGATED PATHS - Techniques for displaying path-related information. Techniques are provided for generating and displaying graphical representations for a path. For example, radial histograms, radial vector plots, and other graphical representations may be rendered for multiple paths aggregated together. | 05-13-2010 |
| 20100121812 | USING DOTPLOTS FOR COMPARING AND FINDING PATTERNS IN SEQUENCES OF DATA POINTS - Embodiments of the invention provide systems and methods for analyzing sequential data. The sequential data can comprise a sequence of data points arranged in a particular order and thus representing a sequence. A number of such sequences can be analyzed, for example, to identify patterns or commonalities within the sequences or portions of sequences represented by the data. According to one embodiment, a method of identifying patterns in sequences of data points can comprise reading a set of sequential data. The sequential data can comprises a plurality of sequences and each of the plurality of sequences can represent an ordered sequence of tokens. A dotplot representing matches between each sequence of the plurality sequences can be generated. One or more patterns within the sequential data can then be identified based on the dotplot. | 05-13-2010 |
| 20110074789 | INTERACTIVE DENDROGRAM CONTROLS - Embodiments of the invention provide systems and methods for analyzing and presenting, e.g., displaying, a set of data. Analyzing the data can include grouping or clustering data that are similar in some way, e.g., similar ranges of quantities, similar categories, etc. and providing an interactive dendrogram representing the clustered data. More specifically, a method for providing an interactive representation of data of a data set can comprise clustering the data into a hierarchical set of clustered data. A dendrogram can be generated based on the clustered data and representing a hierarchy of the clustered data and displayed on a page of a user interface. A selection of a depth of the dendrogram can be received via the user interface and the page can be updated based on the selection of the depth of the dendrogram. | 03-31-2011 |
| 20110078144 | HIERARCHICAL SEQUENTIAL CLUSTERING - Embodiments of the invention provide systems and methods for analyzing sequential data. Analyzing the sequential data can include grouping or clustering data that are similar in some way, e.g., similar ranges of quantities, similar categories, etc. More specifically, a method for hierarchical clustering of sequential data can comprise creating a dotplot of the sequential data. The dotplot can represent a plurality of sequences within the sequential data. A number of clusters represented by the plurality of sequences can be initialized, e.g., one cluster per sequence. A pair of sequences of the plurality of sequences having a longest sequential match can be identified, e.g., based on a line fitting technique, and merged into a single cluster. Identifying a pair of sequences of the plurality of sequences having a longest sequential match and merging the identified pair of sequences into a single cluster can be repeated until a single cluster remains. | 03-31-2011 |
