Research article · May 2015
Conference abstractPublished 2018
Ordinally equivalent patterns: an approach to improving visualization in parallel coordinates
National Research University Higher School of Economics–Moscow, Russia
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. 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, corresponding 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 class 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 the 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.
Subjects
Computer Science & ITEngineeringAsk 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.
Similar by topic
Conference abstract · 10 Aug 2015
Cylindrical coordinates security visualization for multiple domain command and control botnet detection
Research article · 8 Apr 2017
Parallel Improved Pulse Coupled Neural Network Application for Edge Detection in Image Processing
Research article · Oct 2014
A Parallelized Social Network Analysis Using Virtualization for Student?s Academic Improvement
Research article · Oct 2014
A New Hybrid Scalable Parallel Clustering Approach For Large Data Using FCM And FA
More from this journal
The newest in Journal of Computer Engineering & Information Technology.
Review article · 27 Oct 2025
Dukan Daari Inventory Management System
Research article · 17 Jun 2025
Leveraging Information Flow Tracking for Enhanced Security in Cloud Computing
Editorial · 31 Mar 2025
Low-Code/No-Code Platforms: Democratizing Software Development
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 “Alexey Myachin”
- BylineArticles whose byline prints “Boris Mirkin”

