STADI

Description:

STAD is a dimensionality reduction algorithm, that generates an abstract representation of high-dimensional data by giving each data point a location in a graph which preserves the distances in the original high-dimensional space. The STAD graph is built upon the Minimum Spanning Tree (MST) to which new edges are added until the correlation between the graph and the original dataset is maximized. Additionally, STAD supports the inclusion of filter functions to analyse data from new perspectives, emphasizing traits in data which otherwise would remain hidden.

More Information:

• Grand Challenge/Workpackage(s): GC1 - WP3
• Responsible Research Lead: Jan Aerts
• Authors: Jan Aerts, D. Alcaide
• Programming Language: Python
• Link to the Repository
• Categories: Optimization

Publications:

• Alcaide, D., & Aerts, J. (2020). Spanning Trees as Approximation of Data Structures. IEEE Transactions on Visualization and Computer Graphics. https://doi.org/10.1109/TVCG.2020.2995465