Interactive Data Mining with 3D-Parallel-Coordinate-Trees
Summary: 3D-parallel-coordinate-trees extend parallel coordinates into 3D to place more axes adjacently, addressing axis-ordering gaps in high-dimensional visualization. An interactive tool with axis-arrangement strategies enables exploration of complex data sets for data mining. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Elke Achtert (Ludwig Maximilian University of Munich)
- 2. Hans-Peter Kriegel (Ludwig Maximilian University of Munich)
- 3. Erich Schubert (Ludwig Maximilian University of Munich)
- 4. Arthur Zimek (Ludwig Maximilian University of Munich)
BibTeX Citation
@inproceedings{achtert_sigmod13,
title = {{Interactive Data Mining with 3D-Parallel-Coordinate-Trees}},
author = {Achtert, Elke and Kriegel, Hans-Peter and Schubert, Erich and Zimek, Arthur},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2463696},
url = {https://dl.acm.org/doi/10.1145/2463676.2463696},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,952 | A Framework for Clustering Uncertain Data | 2015 | VLDB | 5.9365561e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 583 | Efficient Algorithms for Mining Outliers from Large Data Sets | 2000 | SIGMOD | 0.00015960125 |
| 1,679 | Fast Algorithms for Projected Clustering | 1999 | SIGMOD | 9.9079414e-05 |
| 1,881 | Finding Generalized Projected Clusters in High Dimensional Spaces | 2000 | SIGMOD | 9.4403736e-05 |
| 4,299 | Outlier Detection for High Dimensional Data | 2001 | SIGMOD | 6.6789252e-05 |
| 4,972 | Computing Clusters of Correlation Connected Objects | 2004 | SIGMOD | 6.3318975e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,348 | Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data | 2004 | SIGMOD |
| 2 | 300 | OPTICS: Ordering Points To Identify the Clustering Structure | 1999 | SIGMOD |
| 3 | 1,679 | Fast Algorithms for Projected Clustering | 1999 | SIGMOD |
| 4 | 7,468 | Parallel Algorithms for High-dimensional Proximity Joins | 1997 | VLDB |
| 5 | 1,881 | Finding Generalized Projected Clusters in High Dimensional Spaces | 2000 | SIGMOD |
| 6 | 8,869 | Interactive Visual Exploration of Neighbor-Based Patterns in Data Streams | 2010 | SIGMOD |
| 7 | 14,530 | Data Mining Techniques | 1996 | SIGMOD |
| 8 | 6,076 | Mining Multi-Dimensional Constrained Gradients in Data Cubes | 2001 | VLDB |
| 9 | 14,485 | Free Parallel Data Mining | 1998 | SIGMOD |
| 10 | 14,313 | An Effective Visual Data Mining Environment | 2002 | VLDB |