Scatterplot Selection Applying a Graph Coloring Problem

09/15/2020
by   Takayuki Itoh, et al.
0

Scatterplot selection is an effective approach to represent essential portions of multidimensional data in a limited display space. Various metrics for evaluation of scatterplots such as scagnostics have been presented and applied to scatterplot selection. This paper presents a new scatterplot selection technique that applies multiple metrics. The technique firstly calculates scores of scatterplots with multiple metrics and then constructs a graph by connecting similar scatterplots. The technique applies a graph coloring problem so that different colors are assigned to similar scatterplots. We can extract a set of various scatterplots by selecting them that the specific same color is assigned. This paper introduces visualization examples with a retail dataset containing multidimensional climate and sales values.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2020

Brushing Feature Values in Immersive Graph Visualization Environment

There are a variety of graphs where multidimensional feature values are ...
research
03/20/2018

Balanced Black and White Coloring Problem on knights chessboards

Graph anticoloring problem is partial coloring problem where the main fe...
research
09/18/2014

Solving Graph Coloring Problems with Abstraction and Symmetry

This paper introduces a general methodology, based on abstraction and sy...
research
02/01/2021

Role Coloring Bipartite Graphs

A k-role coloring alpha of a graph G is an assignment of k colors to the...
research
11/30/2018

A Branch and Price Algorithm for List Coloring Problem

Coloring problems in graphs have been used to model a wide range of real...
research
11/12/2018

Sliding Window Temporal Graph Coloring

Graph coloring is one of the most famous computational problems with app...

Please sign up or login with your details

Forgot password? Click here to reset