Premium
Visual Clustering in Parallel Coordinates
Author(s) -
Zhou Hong,
Yuan Xiaoru,
Qu Huamin,
Cui Weiwei,
Chen Baoquan
Publication year - 2008
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2008.01241.x
Subject(s) - cluster analysis , computer science , parallel coordinates , clutter , enhanced data rates for gsm evolution , curvature , exploit , artificial intelligence , parallelism (grammar) , pattern recognition (psychology) , computer vision , data mining , visualization , data visualization , parallel computing , mathematics , geometry , telecommunications , radar , computer security
Parallel coordinates have been widely applied to visualize high‐dimensional and multivariate data, discerning patterns within the data through visual clustering. However, the effectiveness of this technique on large data is reduced by edge clutter. In this paper, we present a novel framework to reduce edge clutter, consequently improving the effectiveness of visual clustering. We exploit curved edges and optimize the arrangement of these curved edges by minimizing their curvature and maximizing the parallelism of adjacent edges. The overall visual clustering is improved by adjusting the shape of the edges while keeping their relative order. The experiments on several representative datasets demonstrate the effectiveness of our approach.