Patents by Inventor Daniel Keim

Daniel Keim has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7716227
    Abstract: A method comprises determining an importance value for each series data set among a plurality of series data sets and visually representing each of the series data sets in accordance with the importance values.
    Type: Grant
    Filed: November 3, 2005
    Date of Patent: May 11, 2010
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Ming C. Hao, Umeshwar Dayal, Daniel Keim, Toblas Schreck
  • Publication number: 20100103189
    Abstract: Continually-incoming time series data is displayed in a visualization screen. In response to detecting that the visualization screen has become full with time series data, a first portion of the time series data is overwritten with additional incoming data such that the additional incoming data replaces the first portion of the time series data in the visualization screen. A second portion of the time series data is maintained unshifted even though the additional incoming data has been added to the visualization screen.
    Type: Application
    Filed: October 28, 2008
    Publication date: April 29, 2010
    Inventors: Ming C. Hao, Umeshwar Dayal, Daniel A. Keim
  • Publication number: 20090033664
    Abstract: To visualize and analyze data, selection of at least one focus area in a visualization of a data set is received. Based on characteristics of the selected at least one focus area, using at least one analytic technique to mine relationships between data items and at least one attribute in the selected at least one focus area and data items and at least one attribute in remaining portions of the data set. At least one visual representation is generated to show mining results produced from selected data items and one or more attributes in the selected at least one focus area and the remaining portions of the data set, where the generated visual representation is composed to have an order and layout to represent the mined results.
    Type: Application
    Filed: July 31, 2007
    Publication date: February 5, 2009
    Inventors: Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Dominik Morent
  • Publication number: 20080180382
    Abstract: A collection of data values is divided into plural bins, wherein a number of the bins is dependent upon a change feature of the data values. Parameter values associated with respective bins are determined. Based on the parameter values, visualization of the plural bins is provided in corresponding plural display screen partitions of a display screen, wherein at least one of the display screen partitions has a resolution that is different from another of the display screen partitions.
    Type: Application
    Filed: January 31, 2007
    Publication date: July 31, 2008
    Inventors: Ming C. Hao, Tobias Schreck, Umeshwar Dayal, Daniel A. Keim
  • Patent number: 7286144
    Abstract: A system, method and computer-readable media are disclosed for generating an image from another image of contiguous polygons and a vector containing values to which areas of corresponding polygons are scaled. The method embodiment relates to generating an image from a plurality of contiguous polygons having vertices. The method comprises calculating a shape value associated with a polygon, calculating an altered shape value associated with an altered polygon, the altered polygon being an altered version of the polygon, calculating a shape distortion by comparing the shape value and the altered shape value and determining whether to accept the altered polygon based on the calculated shape distortion.
    Type: Grant
    Filed: October 13, 2004
    Date of Patent: October 23, 2007
    Assignee: AT&T Corp.
    Inventors: Daniel Keim, Stephen Charles North, Christian Panse
  • Patent number: 7221474
    Abstract: A method for graphically presenting large volumes of data without aggregation using a pixel bar chart. Records having multiple attributes are sorted for constructing a graphically displayable array, wherein the graphically displayable array comprises a plurality of pixels. Each pixel represents one record. The non-aggregation data visualization technique of the present invention provides solutions to meet the need of automatic data preparation for the visual data mining of massive data volumes. The present invention effectively uses screen space to represent each record without cluttering the display, allowing a user to easily discover patterns and correlations. The present invention provides a visual impression by representing the value of a record by a color and representing the number of records by the area of a group. With “drill down” capability, a user can navigate through each record to find detail information.
    Type: Grant
    Filed: July 27, 2001
    Date of Patent: May 22, 2007
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Ming C. Hao, Julian Ladisch, Umeshwar Dayal, Meichun Hsu, Daniel Keim
  • Patent number: 7202868
    Abstract: The disclosed embodiments relate to a system and method for providing a graphical representation of data. Embodiments of the present invention comprise: abstracting a plurality of parameters from the parameter set, dividing the plurality of parameters into data groups, defining a plurality of partitions for a graphical representation, mapping the data groups to corresponding nodes on the plurality of partitions, and connecting the nodes graphically with indicia that indicates an association between data groups.
    Type: Grant
    Filed: March 31, 2004
    Date of Patent: April 10, 2007
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Ming C. Hao, Umeshwar Dayal, Fabio Casati, Daniel A. Keim, Eric Stammers
  • Publication number: 20060095858
    Abstract: Receiving a hierarchical dataset including child data items that depend directly or indirectly from one or more parent data items. Processing the hierarchical dataset to generate nodes for each data item within the hierarchical dataset, wherein nodes for child data items are generated within nodes for parent data items and aligning nodes representing like data items in a dashboard view.
    Type: Application
    Filed: October 29, 2004
    Publication date: May 4, 2006
    Inventors: Ming Hao, Umeshwar Dayal, Daniel Keim, Joern Schneidewind, Robert Raymond
  • Publication number: 20050219262
    Abstract: The disclosed embodiments relate to a system and method for providing a graphical representation of data. Embodiments of the present invention comprise: abstracting a plurality of parameters from the parameter set, dividing the plurality of parameters into data groups, defining a plurality of partitions for a graphical representation, mapping the data groups to corresponding nodes on the plurality of partitions, and connecting the nodes graphically with indicia that indicates an association between data groups.
    Type: Application
    Filed: March 31, 2004
    Publication date: October 6, 2005
    Inventors: Ming Hao, Umeshwar Dayal, Fabio Casati, Daniel Keim, Eric Stammers
  • Publication number: 20050062763
    Abstract: A system, method and computer-readable media are disclosed for generating an image from another image of contiguous polygons and a vector containing values to which areas of corresponding polygons are scaled. The method embodiment relates to generating an image from a plurality of contiguous polygons having vertices. The method comprises calculating a shape value associated with a polygon, calculating an altered shape value associated with an altered polygon, the altered polygon being an altered version of the polygon, calculating a shape distortion by comparing the shape value and the altered shape value and determining whether to accept the altered polygon based on the calculated shape distortion.
    Type: Application
    Filed: October 13, 2004
    Publication date: March 24, 2005
    Applicant: AT&T Corp.
    Inventors: Daniel Keim, Stephen North, Christian Panse
  • Patent number: 6853386
    Abstract: The present invention is a method for generating cartograms using a base map of contiguous polygons and a vector containing values to which areas of corresponding polygons are scaled. The general problem is intractable, so an iterative heuristic is proposed. The heuristic is based on “scanlines.” The scanlines may be defined automatically (typically, by placing a grid over the map) or entered manually (to provide finer control over the results). At each step, one scanline is chosen and a new candidate map is made by adjusting the vertices of polygons intersected by the scanline, moving them orthogonally to the scanline. A candidate solution is accepted if it improves the solution and preserves the input mesh's topology. Improvement depends on metrics for area and shape error.
    Type: Grant
    Filed: February 21, 2003
    Date of Patent: February 8, 2005
    Assignee: AT&T Corp.
    Inventors: Daniel Keim, Stephen Charles North, Christian Panse
  • Publication number: 20040205450
    Abstract: A method for graphically presenting large volumes of data without aggregation using a pixel bar chart. Records having multiple attributes are sorted for constructing a graphically displayable array, wherein the graphically displayable array comprises a plurality of pixels. Each pixel represents one record. The non-aggregation data visualization technique of the present invention provides solutions to meet the need of automatic data preparation for the visual data mining of massive data volumes. The present invention effectively uses screen space to represent each record without cluttering the display, allowing a user to easily discover patterns and correlations. The present invention provides a visual impression by representing the value of a record by a color and representing the number of records by the area of a group. With “drill down” capability, a user can navigate through each record to find detail information.
    Type: Application
    Filed: July 27, 2001
    Publication date: October 14, 2004
    Inventors: Ming C. Hao, Julian Ladisch, Umeshwar Dayal, Meichum Hsu, Daniel Keim
  • Publication number: 20030071815
    Abstract: A method for effective placement of data for visualization of multidimensional data sets using multiple pixel bar charts. Data is received comprising a plurality of records, each record having a plurality of attributes. From the plurality of attributes, a set of attributes is determined for placement of the plurality of records in a graphically displayable array comprising a plurality of data points, each data point representing one record of the plurality of records. In one embodiment, the graphically displayable array is a pixel bar chart. The plurality of records are arranged to construct the pixel bar chart for presenting the data in a format for detecting relationships between the plurality of records. The present invention provides a pixel visualization technique having a method of optimal data placement to resolve the locality and ordering constraints.
    Type: Application
    Filed: October 17, 2001
    Publication date: April 17, 2003
    Inventors: Ming C. Hao, Umeshwar Dayal, Meichun Hsu, Daniel A. Keim, Adrian Krug, Julian Ladisch