mQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations
arXiv:1804.00656 · doi:10.1145/3205455.3205457
Abstract
Algorithms for data visualizations are essential tools for transforming data into useful narratives. Unfortunately, very few visualization algorithms can handle the large datasets of many real-world scenarios. In this study, we address the visualization of these datasets as a Multi-Objective Optimization Problem. We propose mQAPViz, a divide-and-conquer multi-objective optimization algorithm to compute large-scale data visualizations. Our method employs the Multi-Objective Quadratic Assignment Problem (mQAP) as the mathematical foundation to solve the visualization task at hand. The algorithm applies advanced sampling techniques originating from the field of machine learning and efficient data structures to scale to millions of data objects. The algorithm allocates objects onto a 2D grid layout. Experimental results on real-world and large datasets demonstrate that mQAPViz is a competitive alternative to existing techniques.
arXiv commentProceeding GECCO 18 Proceedings of the Genetic and Evolutionary Computation Conference. Pages 737-744 Kyoto, Japan - July 15 - 19, 2018
References in corpus (5)
- Distributed Representations of Words and Phrases and their Compositionality
- DeepWalk: Online Learning of Social Representations
- LINE: Large-scale Information Network Embedding
- Visualizing Large-scale and High-dimensional Data
- PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem