Automating the Design of Graphical Presentations of Relational InformationOverviewSlide 3The Graphical Presentation ProblemApproach: Expressiveness CriteriaExpressiveness CriteriaSlide 7Slide 8Expressiveness EncodingSlide 10Effectiveness CriteriaSlide 12CompositionAxis CompositionSlide 15Mark CompositionImplementationPartitionSelection and CompositionSummaryDiscussion/CritiqueAutomating the Design of Graphical Presentations of Relational InformationBy Jock Mackinlay (Stanford)Presented by:Jeremy Mansonand Bill ShapiroOverview•Automate the design of 2D graphical presentations for relational data •Why is this hard?–Must express design criteria so that the machine can understand them (expressiveness criteria).–Must express information in an understandable way given the capabilities of the output medium (effectiveness criteria).Overview•Given application data, a presentation tool (APT) creates an image that effectively displays the data.The Graphical Presentation Problem•What is an effective encoding of information?•Example:Given a car database:•Present the P r ice and Mileage relations.•The details about the set of Cars can be omitted.•Exponential number of ways of encoding any information.Approach: Expressiveness Criteria•Graphical presentations are “sentences of graphical languages”, essentially logical statements•A set of facts is expressible in a language if and only if it contains a sentence that describes exactly that set of facts: no more, no less.Expressiveness Criteria•A graphical sentence s describes objects and their locations.–Object: Square, Circle, Triangle, Plus, Minus, Star, Smiley Face, etc.–Location: Xmin, Xpos, Xmax, Ymin, Ypos, Ymax. LlOolos  |,Expressiveness Criteria•Example: You can describe a 1-D horizontal graph using a “horizontal position” language•A graphical sentence can belong to this language if it describes either the horizontal axis or a “+” mark on that axis: )max()()min()()max(,hXlXposhXconstlYposhYplusobjomlomhssHorzPosExpressiveness Criteria•Encodes relation: given a language for presenting information (like HorzPos), Encodes is the relationship between the facts you are encoding and the objects on the screenExpressiveness Encoding•Example: given a relation r with tuples (ai, bi) (where a is an element of the set of marks and b is an element of the set of positions) for the HorzPos language, there are three Encodes relations:–the range of locations are encoded by the horizontal axis:•Encodes(h, {b1…bn}, HorzPos)–Each located object oi in the set of marks m encodes an ai•Encode(oi, ai, HorzPos)Expressiveness Encoding–The relation r can be encoded by the position of each mark along the horizontal axis in the horzPos language•Encodes(position(m,h), r, HorzPos)Effectiveness Criteria•How do we design an effective presentation automatically?•Based on empirically verified knowledge, not mathematical rigor.•A ranking of perceptual tasks is used to decide which graphical language to employ (Fig 14-15).Effectiveness Criteria•Principle of Importance Ordering:–Encode more important information more accurately (use information higher in the ranking to encode more important information)Composition•How do you design new presentation designs?–Can just have a laundry list of them–But it is better to take a bunch of simple “primitive” ones and combine them.•Principle of Composition:–Compose two designs by merging parts that encode the same information.Axis Composition•Example: ozone measurements in two different cities.–Y-axis: ozone density–X-axis: date–first figure, from Yonkers, second from Stamford: overlay them.•Only can do this if the axes encode the same informationAxis Composition•Formally:         jjiijjiijijilyvEncodeslyvEncodeslxhEncodeslxhEncodeshhvv,,,,,,,,•Similar for single axis compositionMark Composition•Merges mark sets if the sets encode the same information in the same way–position: positions of located objects along the existing axes must be the same–retinal: retinal properties must be the sameImplementation•Uses logic programming to determine possible designs given the formalisms.•Uses divide and conquer algorithm:–Partition–Selection–CompositionPartition•Partition (divide)–order the attributes by importance–divide them up into groups that match expressiveness criteria–<Price, Mileage, Repair, Weight> can be partitioned into <Price>, <Mileage, Repair, Weight>.–<Mileage, Repair, Weight> must be repartitioned recursively until something that can be encoded is obtainedSelection and Composition•Selection–For each partition, filter out incompatible design criteria•e.g., cannot use maps to encode <Price, Mileage, Repair, Weight>•Composition–Composes the individual designs into a unified presentation of all informationSummary•Formalizes Bertin’s graphical presentation scheme•Shows that machine generated presentations are feasible•Develops a formal model for analyzing graphical representations of dataDiscussion/Critique•Strengths:–Was the first to develop a framework for automating graphical presentation creation–Defined criteria for evaluating presentation tools (effectiveness, expressiveness)•Weaknesses:–Not clear that APT is particularly useful–Are APT generated presentations effective?–Can only do limited types of