Scholars Central

Conference abstractPublished 2018

Ordinally equivalent patterns: an approach to improving visualization in parallel coordinates

Authors: Boris Mirkin, Alexey Myachin

National Research University Higher School of Economics, Moscow, RF

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Parallel coordinates is a well-known framework for data visualization. Rather than conventionally considering data objects as points in a multidimensional space, this approach visualizes the objects as polylines between parallel axes representing different features [1, 2]. Attempts at applying parallel coordinates to big data tables face issues. Of those probably the most important is the so-called clutter at which no data structure can be reliably seen on the picture. There have been various attempts at overcoming the issue such as edge bundling or continuous parallel coordinates. We propose a different approach: extracting ordinally-equivalent, or co-monotone, patterns. Given an ordering p =(x1, x2,…, xn) of data features, we refer to objects i1 and i2 as p–equivalent if the parallel coordinate polylines for these two objects are co-monotone, so that, for any k, k=1, 2, …, n-1: (a) xk(i1)>xk+1(i1) iff xk(i2)>xk+1(i2), (b) xk(i1)<xk+1(i1) iff xk(i2) < xk+1(i2), and (c) xk(i1) = xk+1(i1) iff xk(i2) = xk+1(i2). We refer to the two objects as ordinally equivalent if they are p-equivalent at any order p of parallel coordinates. Obviously, the ordinal equivalence is an equivalence relation, thus, correspo-nding to a partition of the observations in classes of ordinally equivalent objects. Of course, no clutter may emerge at the parallel coordinate graphs of a class of the ordinal equivalence. Although, on the first glance, finding ordinal equivalence classes is a complex, non-polynomial, combinatorial problem, we prove that, in fact, it is quadratic over n, and give several algorithms for finding the classes, depending on user’s preferences. The algorithms are scalable to big data sizes. We give examples of using ordinally equivalent patterns for extraction and visualization of patterns prevailing in data related to various application domains. References Johansson, J., and Forsell, C. (2016). Evaluation of parallel coordinates: Overview, categorization and guidelines for future research. IEEE Transactions on Visualization and Computer Graphics, 22(1), 579-588. Heinrich, J., and Weiskopf, D. (2013). State of the art of parallel coordinates. In Eurographics (STARs), 95-116.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Computer Engineering & Information Technology.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Computer Engineering & Information Technology
  • SubjectComputer Science & IT
  • SubjectEngineering
  • BylineArticles whose byline prints “Boris Mirkin”
  • BylineArticles whose byline prints “Alexey Myachin”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels