Editing Parallel coordinates (section)

== Limitations ==
In parallel coordinates, each axis can have at most two neighboring axes (one on the left, and one on the right). For a ''n''-dimensional data set, at most ''n''-1 relationships can be shown at a time without altering the approach. In [[time series]] visualization, there exists a natural predecessor and successor; therefore in this special case, there exists a preferred arrangement. However, when the axes do not have a unique order, finding a good axis arrangement requires the use of experimentation and feature engineering. To explore more relationships, axes may be reordered or restructured.

One approach arranges axes in 3-dimensional space (still in parallel, forming a [[Lattice graph]]), an axis can have more than two neighbors in a circle around the central attribute, and the arrangement problem can be improve by using a [[minimum spanning tree]].<ref name="sigmod13">{{cite book |author=Elke Achtert |author2=[[Hans-Peter Kriegel]] |author3=Erich Schubert |author4=Arthur Zimek
| title=Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| chapter=Interactive data mining with 3D-parallel-coordinate-trees
| pages=1009–1012
| publisher=Association for Computing Machinery
| location=New York City, NY | year=2013 | doi=10.1145/2463676.2463696| isbn=9781450320375
| s2cid=14850709
}}</ref> A prototype of this visualization is available as extension to the data mining software [[ELKI]]. However, the visualization is harder to interpret and interact with than a linear order.